Efficient tradeoff schemes in data structures for querying moving objects

Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsSusanne Albers, Tomasz Radzik
PublisherSpringer
Pages4-15
Number of pages12
ISBN (Print)3540230254, 9783540230250
DOIs
StatePublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3221
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Efficient tradeoff schemes in data structures for querying moving objects'. Together they form a unique fingerprint.

Cite this