Efficient evaluation of continuous range queries on moving objects

DOI10.1007/3-540-46146-9_72MaRDI QIDQ4410706zbMATH OpenFDO

Authors D. V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch, Walid G. Aref

Publication date 3 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2453/24530731.htm

Mathematics Subject Classification ID

Database theory (68P15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies and applications (68U99)

Recommendations

• Algorithms – ESA 2004
• Indexing moving points
• QGrid: a parallel indexing structure for spatial moving objects
• STAR-tree: An efficient self-adjusting index for moving objects
• SEB-tree: An approach to index continuously moving objects

Cited in

(10)

• Efficient computation of continuous range skyline queries in road networks
• Pruning optimization over threshold-based historical continuous query
• Monitoring nearest neighbor queries with cache strategies
• SEB-tree: An approach to index continuously moving objects
• Safe-region generation methods for continuous trip route planning queries
• Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
• QGrid: a parallel indexing structure for spatial moving objects
• Algorithms – ESA 2004
• Voronoi-based range and continuous range query processing in mobile databases
• Pickup scheduling algorithms with spatio-temporal coordination for urban educational facilities

This page was built for publication: Efficient evaluation of continuous range queries on moving objects

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