1890 search results - page 115 / 378 » Querying Big Data by Accessing Small Data |
177
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
171
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
192
click to vote
KYOTODL
2000
15 years 7 months ago
2000
Today, bibliographical information is kept in a variety of digital libraries available on the Internet. The integration of bibliographical data is considered as one of the most im...
181
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Web search logs are of growing importance to researchers as they help understanding search behavior and search engine performance. However, search logs typically contain sensitive...
162
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...