Sciweavers

128 search results - page 2 / 26
» Plan Selection Based on Query Clustering
Sort
View
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 5 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
SSD
2005
Springer
122views Database» more  SSD 2005»
13 years 10 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
13 years 9 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
13 years 11 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
BDA
2004
13 years 6 months ago
Path Sequence-Based XML Query Processing
We present the path sequence storage model, a new logical model for storing XML documents. This model partitions XML data and content according to the document paths; and uses orde...
Ioana Manolescu, Andrei Arion, Angela Bonifati, An...