126 search results - page 24 / 26 » Lower Bounds for Set Intersection Queries |
164
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
177
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
73
Voted
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
94
Voted
MONET
2007
14 years 9 months ago
2007
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...