301 search results - page 8 / 61 » Efficient Sketches for the Set Query Problem |
173
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessin...
143
click to vote
CORR
1999
Springer
14 years 10 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
PODS
2005
ACM
15 years 11 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
106
Voted
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
In a database system, disclosure of confidential private data may occur if users can put together the answers of past queries. Traditional access control mechanisms cannot guard a...
165
click to vote
SIGMOD
2006
ACM
15 years 11 months ago
2006
ACM
Geographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search tec...