Efficient Processing of Ordered XML Twig Pattern

@inproceedings{Lu2005EfficientPO,
  title={Efficient Processing of Ordered XML Twig Pattern},
  author={Jiaheng Lu and Tok Wang Ling and Tian Yu and Changqing Li and Wei Ni},
  booktitle={DEXA},
  year={2005}
}
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results. The existing holistic join algorithms, however, cannot deal with ordered twig queries. A straightforward approach that first matches the unordered twig queries and then prunes away the undesired answers is obviously not optimal in… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Structural XML Query Processing

ACM Comput. Surv. • 2017
View 7 Excerpts
Highly Influenced

Extended XML Tree Pattern Matching: Theories and Algorithms

IEEE Transactions on Knowledge and Data Engineering • 2011
View 5 Excerpts
Highly Influenced

A NOVEL WAY OF INFORMATION RETRIEVAL FROM XML USING EFFICIENT HOLISTIC ALGORITHMS

Ravi Kiran Yandrapragada, Poreddy Dayakar
2013
View 5 Excerpts
Highly Influenced

QTwig: A Structural Join Algorithm for Efficient Query Retrieval Based on Region-Based Labeling

International Journal of Software Engineering and Knowledge Engineering • 2017
View 2 Excerpts

A Survey of XML Tree Patterns

IEEE Transactions on Knowledge and Data Engineering • 2013

56 Citations

051015'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 56 citations based on the available data.

See our FAQ for additional information.