Sciweavers

116 search results - page 14 / 24
» Estimating Compilation Time of a Query Optimizer
Sort
View
PVLDB
2008
122views more  PVLDB 2008»
13 years 7 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
ICLP
2007
Springer
13 years 11 months ago
OnEQL: An Ontology Efficient Query Language Engine for the Semantic Web
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...
Edna Ruckhaus, Maria-Esther Vidal, Eduardo Ruiz
EDBT
2006
ACM
105views Database» more  EDBT 2006»
14 years 8 months ago
HASE: A Hybrid Approach to Selectivity Estimation for Conjunctive Predicates
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
Xiaohui Yu, Nick Koudas, Calisto Zuzarte
VLDB
2005
ACM
139views Database» more  VLDB 2005»
14 years 1 months ago
Statistical Learning Techniques for Costing XML Queries
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
Ning Zhang 0002, Peter J. Haas, Vanja Josifovski, ...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer