Abstract
As XML data nowadays are extensively used in the applications of data exchange and other fields, supporting efficient query processing on XML data, particularly in determining the structural relationships between two elements, is in great demand recently. To avoid the time-consuming tree traversal tasks, many labeling schemes have been proposed to assign each node a unique label, so that the structural relationships between nodes, such as the ancestor-descendant relationship, can be efficiently determined by comparing their labels. However, to the best of our knowledge, none of the existing labeling schemes can support all structural relationships in constant time and also require the least amount of space. In this paper, we propose a labeling scheme based on the concept of the complete tree, which is called the CT (complete-tree) labeling scheme. This labeling scheme is simple and the resultant labels are compact. We formally analyze its properties and perform an empirical evaluation between the CT labeling scheme and other state-of-the-art labeling schemes on different data sets. The experimental results show that the space requirement of our CT labeling scheme is superior to others in most cases. It is also demonstrated that this scheme can efficiently support all structural relationships and may perform even better than other labeling schemes.
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
Chen, L.J., Bernstein, P.A., Carlin, P., Filipovic, D., Rys, M., Shamgunov, N., Terwilliger, J.F., Todic, M., Tomasevic, S., Tomic, D.: Mapping XML to a Wide Sparse Table. In: ICDE, pp. 630–641 (2012)
Chen, Y., Davidson, S.B., Zheng, Y.: BLAS: an Efficient XPath Processing System. In: SIGMOD, pp. 47–58 (2004)
Härder, T., Haustein, M.P., Mathis, C., Wagner, M.: Node Labeling Schemes for Dynamic XML Documents Reconsidered. Data & Knowledge Engineering 60, 126–149 (2007)
Li, C., Ling, T.W.: QED: a Novel Quaternary Encoding to Completely Avoid Re-labeling in XML Updates. In: CIKM, pp. 501–508 (2005)
Li, Q., Moon, B.: Indexing and Querying XML Data for Regular Path Expressions. In: VLDB, pp. 361–370 (2001)
Lin, R.-R., Chang, Y.-H., Chao, K.-M.: Identifying Relevant Matches with NOT Semantics over XML Documents. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 466–480. Springer, Heidelberg (2011)
Lu, J., Lin, T.W., Chan, C.-Y., Chen, T.: From Region Encoding to Extended Dewey: on Efficient Processing of XML Twig Pattern Matching. In: VLDB, pp. 193–204 (2005)
O’Neil, P., O’Neil, E., Pal, S., Cseri, I., Schaller, G., Westbury, N.: ORDPATHs: Insert-Friendly XML Node Labels. In: SIGMOD, pp. 903–908 (2004)
Rao, P., Moon, B.: PRIX: Indexing And Querying XML Using Prufer Sequences. In: ICDE, pp. 288–300 (2004)
Tatarinov, I., Viglas, S., Beyer, K.S., Shanmugasundaram, J., Shekita, E.J., Zhang, C.: Storing and Querying Ordered XML Using a Relational Database System. In: SIGMOD, pp. 204–215 (2002)
Tatikonda, S., Parthasarathy, S., Goyder, M.: LCSTRIM: Dynamic Programming Meets XML Indexing and Querying. In: VLDB, pp. 63–74 (2007)
Wu, L., Ling, T.W., Wu, H., Bao, Z.: DDE: From Dewey to a Fully Dynamic XML Labeling Scheme. In: SIGMOD, pp. 719–730 (2009)
Wu, X., Lee, M.-L., Hsu, W.: A Prime Number Labeling Scheme for Dynamic Ordered XML Trees. In: ICDE, pp. 66–78 (2004)
Xiao, Y., Hong, J., Cui, W., He, Z., Wang, W., Feng, G.: Branch Code: A Labeling Scheme for Efficient Query Answering on Trees. In: ICDE, pp. 654–665 (2012)
Xu, Y., Papakonstantinou, Y.: Efficient Keyword Search for Smallest LCAs in XML Databases. In: SIGMOD, pp. 527–538 (2005)
Zhang, C., Naughton, J.F., DeWitt, D.J., Luo, Q., Lohman, G.M.: On Supporting Containment Queries in Relational Database Management Systems. In: SIGMOD, pp. 425–436 (2001)
DOM Level 3 Core Specification (2004), http://www.w3.org/TR/2004/REC-DOM-Level-3-Core-20040407/
XQuery and XPath Full Text 1.0 (2011), http://www.w3.org/TR/xpath-full-text-10/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, RR., Chang, YH., Chao, KM. (2013). A Compact and Efficient Labeling Scheme for XML Documents. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds) Database Systems for Advanced Applications. DASFAA 2013. Lecture Notes in Computer Science, vol 7825. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37487-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-37487-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37486-9
Online ISBN: 978-3-642-37487-6
eBook Packages: Computer ScienceComputer Science (R0)