Skip to main content

Faster Twig Pattern Matching Using Extended Dewey ID

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4080))

Abstract

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm that uses the extended Dewey labelling scheme and reported better performance compared with other state-of-the-art holistic twig join algorithms, both in terms of number of elements scanned and stored during the computation. In this paper, we designed an enhancement to further exploit the power of the extended Dewey ID. This reduces the CPU cost and also favors indexed inputs. Our algorithm can be shown analytically as efficient as TJFast in terms of worst case I/O, and experimentally performs significantly better.

This research was fully supported by a grant from the Research Grants Council of the Hong Kong SAR, China [Project No. 9040906 (RGC Ref. No. CityU 1164/04E)].

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: Proceedings of the 2002 ACM SIGMOD Conference on the Management of Data, pp. 310–321 (2002)

    Google Scholar 

  2. Choi, B., Mahoui, M., Wood, D.: On the Optimality of Holistic Algorithms for Twig Queries. In: Mařík, V., Štěpánková, O., Retschitzegger, W. (eds.) DEXA 2003. LNCS, vol. 2736, pp. 28–37. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Jiang, H., Lu, H., Wang, W.: Efficient processing of XML twig queries with or-predicates. In: SIGMOD 2004: Proceedings of the 2004 ACM SIGMOD international conference on Management of data, pp. 59–70. ACM Press, New York (2004)

    Chapter  Google Scholar 

  4. Jiang, H., Wang, W., Lu, H., Yu, J.X.: Holistic twig joins in indexed XML documents. In: Proceedings of the 30th International Conference on Very Large Data Bases (2003)

    Google Scholar 

  5. Kriegel, H.-P., Potke, M., Seidl, T.: Managing intervals efficiently in object-relational databases. In: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 407–418 (2000)

    Google Scholar 

  6. Lu, J., Chen, T., Ling, T.W.: Efficient processing of XML twig patterns with parent child edges: a look-ahead approach. In: CIKM 2004: Proceedings of the thirteenth ACM conference on Information and knowledge management, pp. 533–542. ACM Press, New York (2004)

    Chapter  Google Scholar 

  7. Lu, J., Ling, T.W., Chan, C.-Y., Chen, T.: From region encoding to extended dewey: on efficient processing of XML twig pattern matching. In: VLDB 2005: Proceedings of the 31st international conference on Very large data bases. VLDB Endowment, pp. 193–204 (2005)

    Google Scholar 

  8. Rao, P., Moon, B.: PRIX: indexing and query XML using Prüfer sequences. In: 20th International Conference on Data Engineering, pp. 288–300 (2004)

    Google Scholar 

  9. Tatarinov, I., Viglas, S.D., Beyer, K., Shanmugasundaram, J., Shekita, E., Zhang, C.: Storing and querying ordered XML using a relational database system. In: Proceedings of the 2002 ACM SIGMOD Conference on the Management of Data, pp. 204–215 (2002)

    Google Scholar 

  10. Wang, H., Park, S., Fan, W., Yu, P.: Vist: A dynamic index method for querying XML data by tree structures (2003)

    Google Scholar 

  11. Yuen, L., Poon, C.K.: Relational Index Support for XPath Axes. In: Bressan, S., Ceri, S., Hunt, E., Ives, Z.G., Bellahsène, Z., Rys, M., Unland, R. (eds.) XSym 2005. LNCS, vol. 3671, pp. 84–98. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Poon, C.K., Yuen, L. (2006). Faster Twig Pattern Matching Using Extended Dewey ID. In: Bressan, S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2006. Lecture Notes in Computer Science, vol 4080. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11827405_29

Download citation

  • DOI: https://doi.org/10.1007/11827405_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37871-6

  • Online ISBN: 978-3-540-37872-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics