Sciweavers

123 search results - page 5 / 25
» Structural Join Order Selection for XML Query Optimization
Sort
View
EDBT
2009
ACM
110views Database» more  EDBT 2009»
14 years 6 days ago
A sampling approach for XML query selectivity estimation
As the Extensible Markup Language (XML) rapidly establishes itself as the de facto standard for presenting, storing, and exchanging data on the Internet, large volume of XML data ...
Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qia...
CIKM
2005
Springer
14 years 1 months ago
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization
Modern query optimizers select an efficient join ordering for a physical execution plan based essentially on the average join selectivity factors among the referenced tables. In ...
Neoklis Polyzotis
EDBTW
2006
Springer
13 years 11 months ago
Hash-Based Structural Join Algorithms
Abstract. Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many ...
Christian Mathis, Theo Härder
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 7 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...