Sciweavers

483 search results - page 56 / 97
» Evaluating Top-k Selection Queries
Sort
View
BTW
2009
Springer
132views Database» more  BTW 2009»
14 years 10 days ago
A Bayesian Approach to Estimating the Selectivity of Conjunctive Predicates
: Cost-based optimizers in relational databases make use of data statistics to estimate intermediate result cardinalities. Those cardinalities are needed to estimate access plan co...
M. Heimel, Volker Markl, Keshava Murthy
EMNLP
2008
13 years 9 months ago
The Linguistic Structure of English Web-Search Queries
Web-search queries are known to be short, but little else is known about their structure. In this paper we investigate the applicability of part-of-speech tagging to typical Engli...
Cory Barr, Rosie Jones, Moira Regelson
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 7 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 8 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden