Efficient tradeoff schemes in data structures for querying moving objects

Journal Article (Journal Article)

The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for answering various queries on moving objects, including range and proximity queries, and study tradeoffs between various performance measures-query time, data structure size, and accuracy of results. © Springer-Verlag 2004.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Arge, L; Erickson, J; Yu, H

Published Date

  • January 1, 2004

Published In

Volume / Issue

  • 3221 /

Start / End Page

  • 4 - 15

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

Digital Object Identifier (DOI)

  • 10.1007/978-3-540-30140-0_3

Citation Source

  • Scopus