XML databases and beyond-plenty of architectural challenges ahead

Authors:
Theo Härder
Affiliations:
University of Kaiserslautern, Kaiserslautern, Germany
Venue:
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Year:
2005

Citing 11
Cited 3

Storing and querying ordered XML using a relational database system

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
What next?: A dozen information-technology research goals

Journal of the ACM (JACM)
ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes

VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Advanced data processing in KRISYS: modeling concepts, implementation techniques, and client/server issues

The VLDB Journal — The International Journal on Very Large Data Bases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The next database revolution

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Relaxed currency and consistency: how to say "good enough" in SQL

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
ORDPATHs: insert-friendly XML node labels

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Self-tuning database technology and information services: from wishful thinking to viable engineering

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Cache tables: paving the way for an adaptive database cache

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
ROX: relational over XML

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Essential Performance Drivers in Native XML DBMSs

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Efficiently querying XML documents stored in RDBMS in the presence of Dewey-based labeling scheme

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
Architecture-Driven Modelling Methodologies

Proceedings of the 2011 conference on Information Modelling and Knowledge Bases XXII

Quantified Score

Hi-index	0.00

Visualization

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.