2217 search results - page 70 / 444 » Rank-aware Query Optimization |
93
Voted
WAIM
2004
Springer
15 years 7 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
117
click to vote
SIGMOD
2002
ACM
15 years 2 months ago
2002
ACM
Traditional query processors generate full, accurate query results, either in batch or in pipelined fashion. We argue that this strict model is too rigid for exploratory queries o...
144
click to vote
ER
2010
Springer
15 years 14 days ago
2010
Springer
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
143
Voted
WSDM
2012
ACM
13 years 10 months ago
2012
ACM
Most standard information retrieval models use a single source of information (e.g., the retrieval corpus) for query formulation tasks such as term and phrase weighting and query ...
226
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...