Efficient Complex Query Support for Multiversion XML Documents

  • Shu-Yao Chien
  • Vassilis J. Tsotras
  • Carlo Zaniolo
  • Donghui Zhang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2287)

Abstract

Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML data (e.g., regular path expressions, structural projections, DIFF queries). In this paper, we examine the problem of supporting efficiently complex queries on multiversioned XML documents. Our approach relies on a scheme based on durable node numbers (DNNs) that preserve the order among the XML tree nodes and are invariant with respect to updates. Using the document’s DNNs various complex queries are reduced to combinations of partial version retrieval queries. We examine three indexing schemes to efficiently evaluate partial version retrieval queries in this environment. A thorough performance analysis is then presented to reveal the advantages of each scheme.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Al-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, D. Srivastava and Y. Wu, “Structural Joins: A Primitive for Efficient XML Query Pattern Matching”, Proc. of ICDE, 2002.Google Scholar
  2. 2.
    S. Abiteboul, D. Quass, J. McHugh, J. Widom and J. L. Wiener, “The Lorel Query Language for Semistructured Data”, Journal on Digital Libraries 1(1), pp. 68–88, Apr 1997.Google Scholar
  3. 3.
    B. Becker, S. Gschwind, T. Ohler, B. Seeger and P. Widmayer, “An Asymptotically Optimal Multiversion B-Tree”, VLDB Journal 5(4), pp. 264–275, 1996.CrossRefGoogle Scholar
  4. 4.
    G. Cobena, S. Abiteboul and A. Marian, “XyDi. Tools Detecting changes in XML Documents”, http://www-rocq.inria.fr/~cobena
  5. 5.
    S. Ceri, S. Comai, E. Damiani, P. Fraternali, S. Paraboschi and L. Tanca, “XMLGL: A Graphical Language for Querying and Restructuring XML”, Proc. of WWW Conf., pp. 93–109, 1999.Google Scholar
  6. 6.
    D. Chamberlin, J. Robie, D. Florescu, “Quilt: An XML Query Language for Heterogeneous Data Sources”, Proc. of WebDB, 2000.Google Scholar
  7. 7.
    S. Chawathe, A. Rajaraman, H. Garcia-Molina and J. Widom, “Change Detection in Hierarchically Structured Information”, Proc. of SIGMOD, 1996.Google Scholar
  8. 8.
    S.-Y. Chien, V.J. Tsotras and C. Zaniolo, “Version Management of XML Documents”, WebDB Workshop, 2000.Google Scholar
  9. 9.
    S.-Y. Chien, V.J. Tsotras and C. Zaniolo, “Efficient Management of Multiversion Documents by Object Referencing”, Proc. of VLDB, 2001.Google Scholar
  10. 10.
    S.-Y. Chien, V.J. Tsotras, C. Zaniolo, and D. Zhang, “Storing and Querying Multiversion XML Documents using Durable Node Numbers”, Proc. of WISE, 2001.Google Scholar
  11. 11.
    A. Deutsch, M. Fernandez, D. Florescu, A. Levy and D. Suciu, “A Query Language for XML”, Proc. of WWW Conf., pp. 77–91, 1999.Google Scholar
  12. 12.
    R. H. Katz and E. Change, “Managing Change in Computer-Aided Design Databases”, Proc. of VLDB, 1987.Google Scholar
  13. 13.
    A. Kumar, V. J. Tsotras and C. Faloutsos, “Designing Access Methods for bitemporal Databases”, IEEE TKDE 10(1), pp. 1–20, 1998.Google Scholar
  14. 14.
    M. Fernandez and D. Suciu, “Optimizing Regular Path Expressions Using Graph Schemas”, Proc. of ICDE, 1998.Google Scholar
  15. 15.
    J. McHugh and J. Widom, “Query optimization for XML”, Proc. of VLDB, 1999.Google Scholar
  16. 16.
    Q. Li and B. Moon, “Indexing and Querying XML Data for Regular Path Expressions”, Proc. of VLDB, 2001.Google Scholar
  17. 17.
    D. Lomet and B. Salzberg, “Access Methods for Multiversion Data”, Proc. of SIGMOD, pp. 315–324, 1989.Google Scholar
  18. 18.
    A. Marian, S. Abiteboul, G. Cobena and L. Mignet, “Change-Centric Management of Versions in An XML Warehouse”, Proc. of VLDB, 2001.Google Scholar
  19. 19.
    G. Ozsoyoglu and R. Snodgrass, “Temporal and Real-Time Databases: A Survey”, IEEE TKDE 7(4), pp. 513–532, 1995.Google Scholar
  20. 20.
    M. J. Rochkind, “The Source Code Control System”, IEEE Tran. on Software Engineering SE-1(4), pp. 364–370, Dec 1975.Google Scholar
  21. 21.
    B. Salzberg and V. J. Tsotras, “Comparison of Access Methods for Time-Evolving Data”, ACM Computing Surveys 31(2), pp. 158–221, 1999.CrossRefGoogle Scholar
  22. 22.
    J. Shanmugasundaram, K. Tufte, G. He, C. Zhang, D. J. DeWitt and J. F. Naughton, “Relational Databases for Querying XML Documents: Limitations and Opportunities” Proc. of VLDB, pp. 302–314, 1999.Google Scholar
  23. 23.
    W. F. Tichy, “RCS-A System for Version Control”, Software-Practice&Experience 15(7), pp. 637–654, July 1985.CrossRefGoogle Scholar
  24. 24.
    F. Tian, D. J. DeWitt, J. Chen and C. Zhang, “The Design and Performance Evaluation of Various XML Storage Strategies”, http://www.cs.wisc.edu/niagara/Publications.html
  25. 25.
    V.J. Tsotras and N. Kangelaris, “The Snapshot Index: An I/O-Optimal Access Method for Timeslice Queries”, Information Systems 20(3), pp. 237–260, 1995.CrossRefGoogle Scholar
  26. 26.
    Y. Tao and D. Papadias, “MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries”, Proc. of VLDB, pp. 431–440, 2001.Google Scholar
  27. 27.
    P. Varman and R. Verma, “An Efficient Multiversion Access Structure”, IEEE TKDE 9(3), pp. 391–409, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Shu-Yao Chien
    • 1
  • Vassilis J. Tsotras
    • 2
  • Carlo Zaniolo
    • 1
  • Donghui Zhang
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaLos Angeles
  2. 2.Computer Science DepartmentUniversity of CaliforniaRiverside

Personalised recommendations