Advertisement

Faster Twig Pattern Matching Using Extended Dewey ID

  • Chung Keung Poon
  • Leo Yuen
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Input Stream Large Data Base Query Node Document Tree Query Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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)CrossRefGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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. 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. 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)CrossRefGoogle Scholar
  7. 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. 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. 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. 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. 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)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Chung Keung Poon
    • 1
  • Leo Yuen
    • 1
  1. 1.Department of Computer ScienceCity University of Hong Kong 

Personalised recommendations