Sciweavers

409 search results - page 58 / 82
» Plan Databases: Model and Algebra
Sort
View
SBBD
2004
119views Database» more  SBBD 2004»
14 years 11 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
VLDB
1995
ACM
132views Database» more  VLDB 1995»
15 years 1 months ago
Coloring Away Communication in Parallel Query Optimization
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering and query rewrite (JOQR) followed by parallelization. We focus on t...
Waqar Hasan, Rajeev Motwani
VLDB
2005
ACM
133views Database» more  VLDB 2005»
15 years 3 months ago
Caching with 'Good Enough' Currency, Consistency, and Completeness
SQL extensions that allow queries to explicitly specify data quality requirements in terms of currency and consistency were proposed in an earlier paper. This paper develops a dat...
Hongfei Guo, Per-Åke Larson, Raghu Ramakrish...
SIGMOD
2004
ACM
147views Database» more  SIGMOD 2004»
15 years 9 months ago
Robust Query Processing through Progressive Optimization
Virtually every commercial query optimizer chooses the best plan for a query using a cost model that relies heavily on accurate cardinality estimation. Cardinality estimation erro...
Volker Markl, Vijayshankar Raman, David E. Simmen,...
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
15 years 1 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker