Efficient tradeoff schemes in data structures for querying moving objects

DOI10.1007/978-3-540-30140-0_3MaRDI QIDQ5464590zbMATH OpenOpenAlexFDO

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

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficient evaluation of continuous range queries on moving objects
• Dynamic queries over mobile objects
• Indexing moving points
• Data Structures for Mobile Data
• Time responsive external data structures for moving points

Cited in

(10)

• Pruning optimization over threshold-based historical continuous query
• An extended MD-tree with internal leaf for efficient management of moving objects
• ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES
• Efficient evaluation of continuous range queries on moving objects
• An efficient indexing scheme for multi-dimensional moving objects
• Time responsive external data structures for moving points
• Continuous queries within an architecture for querying XML-represented moving objects
• Querying mobile objects in spatio-temporal databases
• Competitive query strategies for minimising the ply of the potential locations of moving points
• Kinetic sorting and kinetic convex hulls

This page was built for publication: Efficient tradeoff schemes in data structures for querying moving objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464590)