Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
ACM SIGMOD Record
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
The BT-tree: A Branched and Temporal Access Method
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Change-Centric Management of Versions in an XML Warehouse
Proceedings of the 27th International Conference on Very Large Data Bases
Efficient Complex Query Support for Multiversion XML Documents
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
Supporting Branched Versions on XML Documents
RIDE '04 Proceedings of the 14th International Workshop on Research Issues on Data Engineering: Web Services for E-Commerce and E-Government Applications (RIDE'04)
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Staircase join: teach a relational DBMS to watch its (axis) steps
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Indexing temporal XML documents
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Temporal XML: modeling, indexing, and query processing
The VLDB Journal — The International Journal on Very Large Data Bases
Prefix based numbering schemes for XML: techniques, applications and performances
Proceedings of the VLDB Endowment
DDE: from dewey to a fully dynamic XML labeling scheme
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A Labeling Scheme for Temporal XML
WISM '09 Proceedings of the 2009 International Conference on Web Information Systems and Mining
Storage techniques for multi-versioned XML documents
DASFAA'08 Proceedings of the 13th international conference on Database systems for advanced applications
SIAM Journal on Computing
HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
Representing versions in XML documents using versionstamp
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
SAP HANA database: data management for modern business applications
ACM SIGMOD Record
Maintaining versions of dynamic XML documents
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Hi-index | 0.00 |
Main-memory database systems are emerging as the new backbone of business applications. Besides flat relational data representations also hierarchical ones are essential for these modern applications; therefore we devise a new indexing and versioning approach for hierarchies that is deeply integrated into the relational kernel. We propose the DeltaNI index as a versioned pendant of the nested intervals (NI) labeling scheme. The index is space- and time-efficient and yields a gapless, fixed-size integer NI labeling for each version while also supporting branching histories. In contrast to a naive NI labeling, it facilitates even complex updates of the tree structure. As many query processing techniques that work on top of the NI labeling have already been proposed, our index can be used as a building block for processing various kinds of queries. We evaluate the performance of the index on large inputs consisting of millions of nodes and thousands of versions. Thereby we show that DeltaNI scales well and can deliver satisfying performance for large business scenarios.