Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings 11th International Workshop on Database and Expert Systems Applications |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 881-888 |
| Number of pages | 8 |
| Volume | 2000 |
| ISBN (print) | 0-7695-0680-1 |
| Publication status | Published - 2000 |
Abstract
We present a family of four tree-based access structures for indexing spatio-temporal objects. Our indexing methods support spatio-temporal, as well as purely spatial and purely temporal queries. In order to handle sets of extended spatio-temporal objects we propose to specialize generalized search trees by combining the advantages of the well-known spatial structures R∗-tree (Beckmann et al., 1990) and SS-tree (White and Jain, 1996). We consider size-based (R∗-tree like) and distance-based (SS-tree like) penalty metrics for insertions, and we view the temporal dimension either as a regular third or as a special dimension. We evaluate the four access methods on different real-life datasets and identify one of them to be the most efficient access structure for the case of general spatio-temporal data with known extents in every dimension. This method continues the R∗-tree split policy with penalty metric and insertion policy from the SS-tree and treats the temporal dimension as a special dimension.
Keywords
- Database languages, Database systems, Geography, Geometry, Indexing, Shape, Spatial databases, Tail, Testing, Transaction databases
ASJC Scopus subject areas
- Engineering(all)
- General Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings 11th International Workshop on Database and Expert Systems Applications. Vol. 2000 Institute of Electrical and Electronics Engineers Inc., 2000. p. 881-888 875130.
Research output: Chapter in book/report/conference proceeding › Contribution to book/anthology › Research › peer review
}
TY - CHAP
T1 - Efficient Index Structures for Spatio-Temporal Objects
AU - Kleiner, Carsten
AU - Lipeck, Udo W.
PY - 2000
Y1 - 2000
N2 - We present a family of four tree-based access structures for indexing spatio-temporal objects. Our indexing methods support spatio-temporal, as well as purely spatial and purely temporal queries. In order to handle sets of extended spatio-temporal objects we propose to specialize generalized search trees by combining the advantages of the well-known spatial structures R∗-tree (Beckmann et al., 1990) and SS-tree (White and Jain, 1996). We consider size-based (R∗-tree like) and distance-based (SS-tree like) penalty metrics for insertions, and we view the temporal dimension either as a regular third or as a special dimension. We evaluate the four access methods on different real-life datasets and identify one of them to be the most efficient access structure for the case of general spatio-temporal data with known extents in every dimension. This method continues the R∗-tree split policy with penalty metric and insertion policy from the SS-tree and treats the temporal dimension as a special dimension.
AB - We present a family of four tree-based access structures for indexing spatio-temporal objects. Our indexing methods support spatio-temporal, as well as purely spatial and purely temporal queries. In order to handle sets of extended spatio-temporal objects we propose to specialize generalized search trees by combining the advantages of the well-known spatial structures R∗-tree (Beckmann et al., 1990) and SS-tree (White and Jain, 1996). We consider size-based (R∗-tree like) and distance-based (SS-tree like) penalty metrics for insertions, and we view the temporal dimension either as a regular third or as a special dimension. We evaluate the four access methods on different real-life datasets and identify one of them to be the most efficient access structure for the case of general spatio-temporal data with known extents in every dimension. This method continues the R∗-tree split policy with penalty metric and insertion policy from the SS-tree and treats the temporal dimension as a special dimension.
KW - Database languages
KW - Database systems
KW - Geography
KW - Geometry
KW - Indexing
KW - Shape
KW - Spatial databases
KW - Tail
KW - Testing
KW - Transaction databases
UR - http://www.scopus.com/inward/record.url?scp=0013027131&partnerID=8YFLogxK
U2 - 10.1109/DEXA.2000.875130
DO - 10.1109/DEXA.2000.875130
M3 - Contribution to book/anthology
AN - SCOPUS:0013027131
SN - 0-7695-0680-1
VL - 2000
SP - 881
EP - 888
BT - Proceedings 11th International Workshop on Database and Expert Systems Applications
PB - Institute of Electrical and Electronics Engineers Inc.
ER -