BPI: XML query evaluation using bitmapped path indices

Authors:
Neamat El Tazi;H. V. Jagadish
Affiliations:
Cairo University, Egypt;Ann Arbor, MI
Venue:
Proceedings of the 2009 EDBT/ICDT Workshops
Year:
2009

Citing 19
Cited 0

On supporting containment queries in relational database management systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Labeling dynamic XML trees

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
APEX: an adaptive path index for XML data

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Relational Databases for Querying XML Documents: Limitations and Opportunities

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Efficiently Publishing Relational Data as XML Documents

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
ViST: a dynamic index method for querying XML data by tree structures

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
XJoin Index: Indexing XML Data for Efficient Handling of Branching Path Expressions

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
PRIX: Indexing And Querying XML Using Prüfer Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
BLAS: an efficient XPath processing system

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
An evaluation of XML indexes for structural join

ACM SIGMOD Record
Efficient structural joins on indexed XML documents

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Holistic twig joins on indexed XML documents

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
LCS-TRIM: dynamic programming meets XML indexing and querying

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A path-based node filtering method for efficient structural joins

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new technique for fast computation of structural join "pattern trees" in XML. Using a small amount of pre-computed path information, typically small enough to fit easily in main memory, we are able to render structural join computation almost independent of data set size. Our technique is amenable to bit-mapped processing, leading to further speed-up. In this paper, we present our technique and experimentally evaluate its performance.