7593 search results - page 1307 / 1519 » Querying XML Databases |
168
click to vote
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
154
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
172
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
163
click to vote
KDD
2012
ACM
13 years 6 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
170
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...