Indexing highly dynamic hierarchical data

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

Publikation: Beitrag in Buch/Bericht/KonferenzbandKapitelBegutachtung

11 Zitate (Scopus)

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.

OriginalspracheEnglisch
TitelProceedings of the VLDB Endowment
Herausgeber (Verlag)Association for Computing Machinery
Seiten986-997
Seitenumfang12
Auflage10
DOIs
PublikationsstatusVeröffentlicht - 2015
Veranstaltung3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006 - Seoul, Südkorea
Dauer: 11 Sept. 200611 Sept. 2006

Publikationsreihe

NameProceedings of the VLDB Endowment
Nummer10
Band8
ISSN (elektronisch)2150-8097

Konferenz

Konferenz3rd Workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd International Conference on Very Large Data Bases, VLDB 2006
Land/GebietSüdkorea
OrtSeoul
Zeitraum11/09/0611/09/06

Fingerprint

Untersuchen Sie die Forschungsthemen von „Indexing highly dynamic hierarchical data“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren