Sciweavers

243 search results - page 21 / 49
» Selectivity Estimation for Boolean Queries
Sort
View
PODS
2008
ACM
250views Database» more  PODS 2008»
15 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
ICDE
2012
IEEE
228views Database» more  ICDE 2012»
13 years 2 days ago
A General Method for Estimating Correlated Aggregates over a Data Stream
—On a stream of two dimensional data items (x, y) where x is an item identifier, and y is a numerical attribute, a correlated aggregate query requires us to first apply a selec...
Srikanta Tirthapura, David P. Woodruff
ICDE
2007
IEEE
164views Database» more  ICDE 2007»
15 years 4 months ago
An Integer Linear Programming Approach to Database Design
Existing index selection tools rely on heuristics to efficiently search within the large space of alternative solutions and to minimize the overhead of using the query optimizer ...
Stratos Papadomanolakis, Anastassia Ailamaki
PPDP
2010
Springer
14 years 8 months ago
Deriving predicate statistics in datalog
Database query optimizers rely on data statistics in selecting query execution plans. Similar query optimization techniques are desirable for deductive databases and, to make this...
Senlin Liang, Michael Kifer
CIDR
2009
152views Algorithms» more  CIDR 2009»
14 years 10 months ago
Visualizing the robustness of query execution
In database query processing, actual run-time conditions (e.g., actual selectivities and actual available memory) very often differ from compile-time expectations of run-time cond...
Goetz Graefe, Harumi A. Kuno, Janet L. Wiener