Sciweavers

Share
ESA
2004
Springer

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects

10 years 3 months ago
Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
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.
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Y
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where ESA
Authors Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Yu
Comments (0)
books