Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects
ALGORITHMS ESA 2004, PROCEEDINGS(2004)
摘要
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.
更多查看译文
关键词
data structure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要