511 search results - page 38 / 103 » Approximate Selection Queries over Imprecise Data |
254
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
267
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
170
click to vote
TOIS
2008
15 years 6 months ago
2008
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over multip...
165
click to vote
AAAI
2010
15 years 7 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
155
click to vote
SSDBM
2003
IEEE
15 years 11 months ago
2003
IEEE
Accessing data stored in persistent memory represents a bottleneck for current visual exploration applications. Semantic caching of frequent queries at the client-side along with ...