Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

ESA
2004
Springer

favoriteEmaildiscussreport

106views Algorithms» more ESA 2004»

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects

13 years 10 months ago

Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects

Download www.cs.duke.edu

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

Real-time Traffic

Algorithms | Data Structure | Data Structure Size | ESA 2004 | Spatio-temporal Database Systems |

claim paper

Related Content

» Declustering of Trajectories for Indexing of Moving Objects Databases

» An Efficient Trajectory Index Structure for Moving Objects in LocationBased Services

» Efficient Location Updates for Continuous Queries over Moving Objects

» Structures for InNetwork Moving Object Tracking in Wireless Sensor Networks

» Dynamic Splitting Policies of the Adaptive 3DRTree for Indexing Continuously Moving Object...

» SpaceTime Tradeoffs for Proximity Searching in Doubling Spaces

» Algorithms for Nearest Neighbor Search on Moving Object Trajectories

» Change Tolerant Indexing for Constantly Evolving Data

» Concurrency Control in Distributed MRA Index Structure

Post Info
More Details (n/a)

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)