skip to main content
10.1145/2588555.2610506acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Querying virtual hierarchies using virtual prefix-based numbers

Published:18 June 2014Publication History

ABSTRACT

Prefix-based numbering is a popular method for numbering nodes in a hierarchy. But prefix-based numbering breaks down when a node's location within a hierarchy changes, such as when XML data is queried after being transformed by an XSLT program or when data is reformatted in the return clause of an inner FLWR expression in a nested XQuery program. A query on transformed data cannot be evaluated as efficiently since the extant prefix-based node numbers cannot be used (unless the data is materialized and then renumbered, which can be expensive). In this paper we present a novel strategy to virtually transform the data without instantiating and renumbering. Our method, which we call virtual prefix-based numbering, couples each prefix-based node number with a level array that locates the node in the numbering space of the virtual hierarchy. The virtual numbering space preserves the property that location-based relationships between nodes can be determined by comparing (virtual) numbers.

References

  1. F. N. Afrati, R. Chirkova, M. Gergatsoulis, B. Kimelfeld, V. Pavlaki, and Y. Sagiv. On rewriting XPath queries using views. In EDBT, pages 168--179, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Amer-Yahia, S. Cho, and D. Srivastava. Tree Pattern Relaxation. In EDBT, pages 496--513, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. N. Augsten, M. H. Böhlen, and J. Gamper. The q-gram distance between ordered labeled trees. ACM Trans. Database Syst., 35(1), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. T. Böhme and E. Rahm. Supporting Efficient Streaming and Insertion of XML Data in RDBMS. In DIWeb, pages 70--81, 2004.Google ScholarGoogle Scholar
  5. E. F. Codd. A Relational Model of Data for Large Shared Data Banks. CACM, 13(6):377--387, 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Cohen, J. Mamou, Y. Kanza, and Y. Sagiv. XSEarch: A Semantic Search Engine for XML. In VLDB, pages 45--56, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. E. Dyreson and S. S. Bhowmick. Querying XML Data: As You Shape It. In ICDE, pages 642--653, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. E. Dyreson, S. S. Bhowmick, and K. Mallampalli. Using XMorph to Transform XML Data. PVLDB, 3(2):1541--1544, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. El-Sayed, E. A. Rundensteiner, and M. Mani. Incremental Maintenance of Materialized XQuery Views. In ICDE, page 129, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. R. Goldman and J. Widom. DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases. In VLDB, pages 436--445, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. G. Gou and R. Chirkova. Efficiently Querying Large XML Data Repositories: A Survey. IEEE Trans. Knowl. Data Eng., 19(10):1381--1403, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. M. P. Haustein, T. H\"arder, C. Mathis, and M. Wagner. Deweyids - the key to fine-grained management of xml documents. JIDM, 1(1):147--160, 2010.Google ScholarGoogle Scholar
  13. Y. Kanza and Y. Sagiv. Flexible Queries over Semistructured Data. In PODS, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. Katsifodimos, I. Manolescu, and V. Vassalos. Materialized view selection for XQuery workloads. In SIGMOD Conference, pages 565--576, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. H.-K. Ko and S. Lee. A binary string approach for updates in dynamic ordered xml data. IEEE Trans. Knowl. Data Eng., 22(4):602--607, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. S. Krishnamurthi, K. E. Gray, and P. T. Graunke. Transformation-by-Example for XML. In PADL, pages 249--262, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. C. Li and T. W. Ling. An Improved Prefix Labeling Scheme: A Binary String Approach for Dynamic Ordered XML. In DASFAA, pages 125--137, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C. Li, T. W. Ling, and M. Hu. Efficient Updates in Dynamic XML Data: From Binary String to Quaternary String. VLDB J., 17(3):573--601, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Y. Li, C. Yu, and H. V. Jagadish. Schema-Free XQuery. In VLDB, pages 72--83, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Z. Liu, J. Walker, and Y. Chen. XSeek: A Semantic XML Search Engine Using Keywords. In VLDB, pages 1330--1333, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. D. Luo, T. Chen, T. W. Ling, and X. Meng. On View Transformation Support for a Native XML DBMS. In DASFAA, pages 226--231, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  22. I. Manolescu, K. Karanasos, V. Vassalos, and S. Zoupanos. Efficient XQuery rewriting using multiple views. In ICDE, pages 972--983, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. T. Pankowski. A High-Level Language for Specifying XML Data Transformations. In ADBIS, pages 159--172, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  24. Y. Papakonstantinou and V. Vassalos. Query Rewriting for Semistructured Data. In SIGMOD Conference, pages 455--466, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. V. Sans and D. Laurent. Prefix based numbering schemes for xml: techniques, applications and performances. PVLDB, 1(2):1564--1573, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. I. Tatarinov, S. Viglas, K. S. Beyer, J. Shanmugasundaram, E. J. Shekita, and C. Zhang. Storing and Querying Ordered XML using a Relational Database System. In SIGMOD Conference, pages 204--215, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. B. Q. Truong, S. S. Bhowmick, and C. E. Dyreson. SINBAD: Towards Structure-Independent Querying of Common Neighbors in XML Databases. In DASFAA (1), pages 156--171, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. B. Q. Truong, S. S. Bhowmick, C. E. Dyreson, and A. Sun. MESSIAH: Missing Element-Conscious SLCA Nodes Search in XML Data. In SIGMOD Conference, pages 37--48, 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Y. Xu and Y. Papakonstantinou. Efficient Keyword Search for Smallest LCAs in XML Databases. In SIGMOD Conference, pages 537--538, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. J. X. Yu, D. Luo, X. Meng, and H. Lu. Dynamically Updating XML Data: Numbering Scheme Revisited. World Wide Web, 8(1):5--26, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. S. Zhang and C. E. Dyreson. Symmetrically Exploiting XML. In WWW, pages 103--111, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Querying virtual hierarchies using virtual prefix-based numbers

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGMOD '14: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data
        June 2014
        1645 pages
        ISBN:9781450323765
        DOI:10.1145/2588555

        Copyright © 2014 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 18 June 2014

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        SIGMOD '14 Paper Acceptance Rate107of421submissions,25%Overall Acceptance Rate785of4,003submissions,20%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader