Sciweavers

363 search results - page 48 / 73
» Analyzing Plan Diagrams of Database Query Optimizers
Sort
View
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 9 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
VLDB
1998
ACM
138views Database» more  VLDB 1998»
14 years 1 months ago
TOPAZ: a Cost-Based, Rule-Driven, Multi-Phase Parallelizer
Currently the key problems of query optimization are extensibility imposed by object-relational technology, as well as query complexity caused by forthcoming applications, such as...
Clara Nippl, Bernhard Mitschang
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
14 years 1 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
VLDB
1994
ACM
153views Database» more  VLDB 1994»
14 years 1 months ago
Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
Waqar Hasan, Rajeev Motwani
EDBT
1992
ACM
111views Database» more  EDBT 1992»
14 years 17 days ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin