6846 search results - page 1238 / 1370 » Querying a summary of database |
366
Voted
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
262
Voted
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
— The web today is increasingly characterized by social and real-time signals, which we believe represent two frontiers in information retrieval. In this paper, we present Earlyb...
182
Voted
AAAI
2012
13 years 9 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
182
click to vote
SIGMOD
1997
ACM
15 years 11 months ago
1997
ACM
The Strudel system applies concepts from database management systems to the process of building Web sites. Strudel’s key idea is separating the management of the site’s data, t...
304
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with t...