KIT | KIT-Bibliothek | Impressum | Datenschutz

High-dimensional spatio-temporal indexing

Menninghaus, Mathias; Breunig, Martin; Pulvermüller, Elke

There exist numerous indexing methods which handle either spatio-temporal or high-dimensional data well. How-
ever, those indexing methods which handle spatio-temporal data well have certain drawbacks when confronted
with high-dimensional data. As the most efficient spatio-temporal indexing methods are based on the R-tree and
its variants, they face the well known problems in high-dimensional space. Furthermore, most high-dimensional
indexing methods try to reduce the number of dimensions in the data being indexed and compress the information
given by all dimensions into few dimensions but are not able to store now - relative data. One of the most efficient
high-dimensional indexing methods, the Pyramid Technique, is able to handle high-dimensional point-data only.
Nonetheless, we take this technique and extend it such that it is able to handle spatio-temporal data as well. We
introduce a technique for querying in this structure with spatio-temporal queries. We compare our technique, the
Spatio-Temporal Pyramid Adapter (STPA), to the RST-tree for in-memory and on-disk applications. We show that
for high ... mehr

Open Access Logo

Verlagsausgabe §
DOI: 10.5445/IR/1000077039
Veröffentlicht am 30.11.2017
Seitenaufrufe: 19
seit 30.05.2018
Downloads: 20
seit 30.01.2018
Zugehörige Institution(en) am KIT Geodätisches Institut (GIK)
Publikationstyp Zeitschriftenaufsatz
Jahr 2016
Sprache Englisch
Identifikator ISSN: 2199-3459
KITopen-ID: 1000077039
Erschienen in Open journal of databases
Band 3
Heft 1
Schlagworte high-dimensional, spatio-temporal, databases, indexing, access methods, subway-track planning
KIT – Die Forschungsuniversität in der Helmholtz-Gemeinschaft
KITopen Landing Page