The VLDB Journal

, Volume 26, Issue 1, pp 55–80

Order Indexes: supporting highly dynamic hierarchical data in relational main-memory database systems

  • Jan Finis
  • Robert Brunel
  • Alfons Kemper
  • Thomas Neumann
  • Norman May
  • Franz Faerber
Special Issue Paper

DOI: 10.1007/s00778-016-0436-3

Cite this article as:
Finis, J., Brunel, R., Kemper, A. et al. The VLDB Journal (2017) 26: 55. doi:10.1007/s00778-016-0436-3


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 Order Indexes—a dynamic representation of the nested intervals encoding—which offer competitive query performance, unprecedented update efficiency, and robustness for highly dynamic workloads.


Hierarchical data Indexing Nested intervals Tree data Tree indexing Nested intervals 

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Technical University of MunichGarchingGermany
  2. 2.SAP SEWalldorfGermany

Personalised recommendations