Indexing highly dynamic hierarchical data

Jan Finis, Robert Brunel, Alfons Kemper, Thomas Neumann, Norman Mayy, Franz Faerbery

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

11 Scopus citations

Abstract

Maintaining and querying hierarchical data in a relational database system is an important task in many business applications. This task is especially challenging when considering dynamic use cases with a high rate of complex, possibly skewed structural updates. Labeling schemes are widely considered the indexing technique of choice for hierarchical data, and many different schemes have been proposed. However, they cannot handle dynamic use cases well due to various problems which we investigate in this paper. We therefore propose our dynamic Order Indexes, which order competitive query performance, unprecedented update efficiency, and robustness for highly dynamic workloads.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
PublisherAssociation for Computing Machinery
Pages986-997
Number of pages12
Edition10
DOIs
StatePublished - 2015
Event3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006 - Seoul, Korea, Republic of
Duration: 11 Sep 200611 Sep 2006

Publication series

NameProceedings of the VLDB Endowment
Number10
Volume8
ISSN (Electronic)2150-8097

Conference

Conference3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006
Country/TerritoryKorea, Republic of
CitySeoul
Period11/09/0611/09/06

Fingerprint

Dive into the research topics of 'Indexing highly dynamic hierarchical data'. Together they form a unique fingerprint.

Cite this