Abstract
In recent years, many approaches to XML twig pattern searching have been developed. Holistic approaches are particularly significant in that they provide a theoretical model for optimal processing of some query classes and have very low main memory complexity. Holistic algorithms can be incorporated into XQuery algebra as a twig query pattern operator.
We can find two types of labeling schemes used by indexing methods: element and path labeling schemes. The path labeling scheme is a labeling scheme where we can extract all the ancestor’s labels from a node label. In the TJFast method, authors have introduced an application of the path labeling scheme (Extended Dewey) in the case of holistic methods. In our paper, we depict some improvements of this method that lead to a better scalability of the TJFast algorithm. We introduce the TJDewey algorithm which combines the TJFast algorithm with the DataGuide summary tree. The path labeling schemes have better update features and our article shows that the utilization of a path labeling scheme can have comparable or even better query processing parameters compared to other element labeling scheme approaches.
Work is partially supported by Grants of GACR No. 201/09/0990.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Khalifa, S., Jagadish, H.V., Koudas, N.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proceedings of ICDE 2002. IEEE CS, Los Alamitos (2002)
Bača, R., Krátký, M., Snášel, V.: On the Efficient Search of an XML Twig Query in Large DataGuide Trees. In: Proceedings of the Twelfth International Database Engineering and Applications Symposium, IDEAS 2008. ACM Press, New York (2008)
Bruno, N., Srivastava, D., Koudas, N.: Holistic Twig Joins: Optimal XML Pattern Matching. In: Proceedings of ACM SIGMOD 2002, pp. 310–321. ACM Press, New York (2002)
Chen, S., Li, H.-G., Tatemura, J., Hsiung, W.-P., Agrawal, D., Candan, K.S.: Twig2Stack: Bottom-up Processing of Generalized-tree-pattern Queries Over XML documents. In: Proceedings of VLDB 2006, pp. 283–294 (2006)
Chen, T., Lu, J., Ling, T.: On Boosting Holism in XML Twig Pattern Matching Using Structural Indexing Techniques. In: Proceedings of ACM SIGMOD 2005. ACM Press, New York (2005)
Grust, T.: Accelerating XPath Location Steps. In: Proceedings of ACM SIGMOD 2002, Madison, USA. ACM Press, New York (2002)
Härder, T., Haustein, M., Mathis, C., Wagner, M.: Node Labeling Schemes for Dynamic XML Documents Reconsidered. Data & Knowledge Engineering 60(1), 126–149 (2007)
Jiang, H., Lu, H., Wang, W., Ooi, B.: XR-Tree: Indexing XML Data for Efficient. In: Proceedings of ICDE, 2003. IEEE, Los Alamitos (2003)
Jiang, H., Wang, W., Lu, H., Yu, J.: Holistic Twig Joins on Indexed XML Documents. In: Proceedings of VLDB 2003, pp. 273–284 (2003)
Krátký, M., Bača, R., Snášel, V.: On the Efficient Processing Regular Path Expressions of an Enormous Volume of XML Data. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 1–12. Springer, Heidelberg (2007)
Krátký, M., Pokorný, J., Snášel, V.: Implementation of XPath Axes in the Multi-dimensional Approach to Indexing XML Data. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol. 3268, pp. 219–229. Springer, Heidelberg (2004)
Lu, J., Chen, T., Ling, T.: Efficient Processing of XML Twig Patterns with Parent Child Edges: a Look-ahead Approach. In: Proceedings of ACM CIKM 2004, pp. 533–542 (2004)
Lu, J., Ling, T., Chan, C., Chen, T.: From Region Encoding to Extended Dewey: on Efficient Processing of XML Twig Pattern Matching. In: Proceedings of VLDB 2005 (2005)
Yoshikawa, T.S.M., Amagasa, T., Uemura, S.: XRel: a Path-based Approach to Storage and Retrieval of XML Documents Using Relational Databases. ACM Trans. Inter. Tech. 1(1), 110–141 (2001)
Michiels, P., Mihaila, G., Simeon, J.: Put a tree pattern in your algebra. In: Proceedings of the 23th International Conference on Data Engineering, ICDE 2007, pp. 246–255 (2007)
Moro, M., Vagena, Z., Tsotras, V.: Tree-pattern Queries on a Lightweight XML Processor. In: Proceedings of VLDB 2005, pp. 205–216 (2005)
O’Neil, P., O’Neil, E., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-friendly XML Node Labels. In: Proceedings of ACM SIGMOD 2004 (2004)
Goldman, J.W.R.: DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In: Proceedings of VLDB 1997, pp. 436–445 (1997)
Tatarinov, I., et al.: Storing and Querying Ordered XML Using a Relational Database System. In: Proceedings of ACM SIGMOD 2002, New York, USA, pp. 204–215 (2002)
W3 Consortium. Extensible Markup Language (XML) 1.0, W3C Recommendation (February 10, 1998), http://www.w3.org/TR/REC-xml
Witten, I.H., Moffat, A., Bell, T.C.: Managing Gigabytes, Compressing and Indexing Documents and Images, 2nd edn. Morgan Kaufmann, San Francisco (1999)
Zhang, C., Naughton, J., DeWitt, D., Luo, Q., Lohman, G.: On Supporting Containment Queries in Relational Database Management Systems. In: Proceedings of ACM SIGMOD 2001, pp. 425–436 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bača, R., Krátký, M. (2009). TJDewey – On the Efficient Path Labeling Scheme Holistic Approach. In: Chen, L., Liu, C., Liu, Q., Deng, K. (eds) Database Systems for Advanced Applications. DASFAA 2009. Lecture Notes in Computer Science, vol 5667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04205-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-04205-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04204-1
Online ISBN: 978-3-642-04205-8
eBook Packages: Computer ScienceComputer Science (R0)