Sciweavers

2080 search results - page 17 / 416
» Collections, Cardinalities, and Relations
Sort
View
107
Voted
DAM
2011
14 years 8 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
202
Voted
ICDE
2006
IEEE
134views Database» more  ICDE 2006»
16 years 3 months ago
ISOMER: Consistent Histogram Construction Using Query Feedback
Database columns are often correlated, so that cardinality estimates computed by assuming independence often lead to a poor choice of query plan by the optimizer. Multidimensional...
Utkarsh Srivastava, Peter J. Haas, Volker Markl, M...
SIGMOD
2007
ACM
136views Database» more  SIGMOD 2007»
16 years 2 months ago
Progressive optimization in a shared-nothing parallel database
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
Wook-Shin Han, Jack Ng, Volker Markl, Holger Kache...
88
Voted
SIGMOD
2002
ACM
119views Database» more  SIGMOD 2002»
16 years 2 months ago
Rate-based query optimization for streaming information sources
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
Stratis Viglas, Jeffrey F. Naughton
APAL
2007
90views more  APAL 2007»
15 years 2 months ago
Guessing and non-guessing of canonical functions
It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary s...
David Asperó