Indexing highly dynamic hierarchical data

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

doi:10.14778/2794367.2794369

Indexing highly dynamic hierarchical data

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

Technical University of Munich
SAP CEC Karlsruhe

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-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 language	English
Title of host publication	Proceedings of the VLDB Endowment
Editors	Simonas Saltenis, Ki-Joune Li, Christophe Claramunt
Publisher	Association for Computing Machinery
Pages	986-997
Number of pages	12
Volume	8
Edition	10 10
DOIs	https://doi.org/10.14778/2794367.2794369
State	Published - 2015
Event	3rd 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 2006 → 11 Sep 2006

Conference

Conference	3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006
Country/Territory	Korea, Republic of
City	Seoul
Period	11/09/06 → 11/09/06

Access to Document

10.14778/2794367.2794369

Cite this

@inbook{b444f6185f064728a25284009c588f52,

title = "Indexing highly dynamic hierarchical data",

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.",

author = "Jan Finis and Robert Brunel and Alfons Kemper and Thomas Neumann and Norman Mayy and Franz Faerbery",

note = "Publisher Copyright: {\textcopyright} 2015 VLDB.; 3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006 ; Conference date: 11-09-2006 Through 11-09-2006",

year = "2015",

doi = "10.14778/2794367.2794369",

language = "English",

volume = "8",

pages = "986--997",

editor = "Simonas Saltenis and Ki-Joune Li and Christophe Claramunt",

booktitle = "Proceedings of the VLDB Endowment",

publisher = "Association for Computing Machinery",

edition = "10 10",

}

Finis, J, Brunel, R, Kemper, A , Neumann, T, Mayy, N & Faerbery, F 2015, Indexing highly dynamic hierarchical data. in S Saltenis, K-J Li & C Claramunt (eds), Proceedings of the VLDB Endowment. 10 10 edn, vol. 8, Association for Computing Machinery, pp. 986-997, 3rd 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, 11/09/06. https://doi.org/10.14778/2794367.2794369

TY - CHAP

T1 - Indexing highly dynamic hierarchical data

AU - Finis, Jan

AU - Brunel, Robert

AU - Kemper, Alfons

AU - Neumann, Thomas

AU - Mayy, Norman

AU - Faerbery, Franz

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84953851155

U2 - 10.14778/2794367.2794369

DO - 10.14778/2794367.2794369

M3 - Chapter

AN - SCOPUS:84953851155

VL - 8

SP - 986

EP - 997

BT - Proceedings of the VLDB Endowment

A2 - Saltenis, Simonas

A2 - Li, Ki-Joune

A2 - Claramunt, Christophe

PB - Association for Computing Machinery

T2 - 3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006

Y2 - 11 September 2006 through 11 September 2006

ER -

Indexing highly dynamic hierarchical data

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this