Advertisement

XML Databases and Beyond-Plenty of Architectural Challenges Ahead

  • Theo Härder
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3631)

Abstract

A key observation is that the invariants in database management determine the mapping steps of the supporting architecture. Referring to the multi-layered architecture of record-oriented database management systems (DBMSs), we sketch the advances made during the past decades. Then, we explore the ways how this proven architecture can be used to implement XML DBMSs (XDBMSs). Major changes and adaptations are needed in most of the layers to support fine-grained XML document processing (XDP). The use of DeweyIDs opens a new paradigm for the management of XML document trees: While preventing node relabeling, even in case arbitrary large subtrees are inserted into an XML document, DeweyIDs offer great benefits for efficient navigation in the document trees, for declarative query processing, and for fine-grained locking thereby avoiding access to external storage as far as possible. The proposed architecture also captures horizontal and vertical distribution of XML processing. Nevertheless, new architectural models are needed beyond record-oriented data types.

Keywords

Access Path Document Index External Storage Document Order Lock Manager 
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.
    Al-Khalifa, S., et al.: Structural Joins: A Primitive for Efficient XML Query Pattern Matching. In: Proc. 18th Int. Conf. on Data Engineering, vol. 141 (2002)Google Scholar
  2. 2.
    Altinel, M., et al.: Cache Tables: Paving the Way for an Adaptive Database Cache. In: VLDB 2003, pp. 718–729 (2003)Google Scholar
  3. 3.
    Deßloch, S., Härder, T., Mattos, N.M., Mitschang, B., Thomas, J.: Advanced Data Processing in KRISYS. VLDB J. 7(2), 79–95 (1998)CrossRefGoogle Scholar
  4. 4.
    Graefe, G.: Dynamic Query Evaluation Plans: Some Course Corrections? IEEE Data Eng. Bull. 23(2), 3–6 (2000)Google Scholar
  5. 5.
    Gray, J.: What next?: A dozen information-technology research goals. J. ACM 50(1), 41–57 (2003) (Journal Version of the 1999 ACM Turing Award Lecture)Google Scholar
  6. 6.
    Gray, J.: The Next Database Revolution. In: SIGMOD Conference, pp. 1–4 (2004)Google Scholar
  7. 7.
    Guo, H., Larson, P.-A., Ramakrishnan, R., Goldstein, J.: Relaxed Currency and Consistency: How to Say "Good Enough" in SQL. In: SIGMOD Conference, pp. 815–826 (2004)Google Scholar
  8. 8.
    Härder, T.: DBMS Architecture—Still an Open Problem. In: Proc. Datenbanksysteme in Business, Technologie und Web (BTW 2005). LNIP, vol. 65, pp. 2–28. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Härder, T.: Caching over the Entire User-to-Data Path in the Internet. In: Härder, T., Lehner, W. (eds.) Data Management in a Connected World. LNCS, vol. 3551, pp. 67–89. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Härder, T., Bühmann, A.: Query Processing in Constraint-Based Database Caches. Data Engineering Bulletin 27(2), 3–10 (2004)Google Scholar
  11. 11.
    Härder, T., Reuter, A.: Concepts for Implementing a Centralized Database Management System. In: Proc. Int. Comp. Symp. on Appl. Systems Development, Nürnberg, pp. 28–60 (1983)Google Scholar
  12. 12.
    Haustein, M., Härder, T.: Optimizing Concurrent XML Processing (2005) (submitted)Google Scholar
  13. 13.
    Haustein, M., Härder, T., Mathis, C., Wagner, M.: DeweyIDs—The Key to Fine-Grained Management of XML Documents (2005) (submitted)Google Scholar
  14. 14.
    Haustein, M., Härder, T., Luttenberger, K.: Contest of Lock Protocols—The Winner is taDOM3+ (2005), http://wwwdvs.informatik.uni-kl.de/pubs/p2005.html (submitted)
  15. 15.
    Halverson, A., Josifovski, V., Lohman, G., Pirahesh, H., Mörschel, M.: ROX: Relational Over XML. In: Proc. 30th Int. Conf. on Very Large Data Bases, Toronto (September 2004)Google Scholar
  16. 16.
    Mohan, C.: ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. In: VLDB 1990, pp. 392–405 (1990)Google Scholar
  17. 17.
    O’Neil, P.E., et al.: ORDPATHs: Insert-Friendly XML Node Labels. In: Proc. SIGMOD Conf., pp. 903–908 (2004)Google Scholar
  18. 18.
    Senko, M.E., Altman, E.B., Astrahan, M.M., Fehder, P.L.: Data Structures and Accessing in Data Base Systems. IBM Systems Journal 12(1), 30–93 (1973)CrossRefGoogle Scholar
  19. 19.
    Tatarinov, I., et al.: Storing and Querying Ordered XML Using a Relational Database System. In: Proc. ACM SIGMOD, Madison, Wisconsin, USA, pp. 204–215 (2002)Google Scholar
  20. 20.
    Weikum, G., Mönkeberg, A., Hasse, C., Zabback, P.: Self-tuning Database Technology and Information Services: from Wishful Thinking to Viable Engineering. In: VLDB 2002, pp. 20–31 (2002)Google Scholar
  21. 21.
    W3C Recommendations (2004), http://www.w3c.org

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Theo Härder
    • 1
  1. 1.University of KaiserslauternKaiserslauternGermany

Personalised recommendations