DBScholar

Back to papers

Indexing Moving Points (Extended Abstract)

Summary: External-memory indexing for N planar points moving linearly: first structure uses O(N/B) blocks and answers rectangle-at-time queries in O((N/B)^{1/2+ε}+K/B) I/Os, supports time-interval reports and O(log_{2B} N) updates. Also: an evolving-index that trades query time vs. index-update frequency for chronological queries, a scheme whose query cost is monotone in |tq−now|, and an efficient index for approximate nearest neighbors among moving points. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1206
Venue
PODS
Year
2000
Pagerank
0.00010218339
Overall Rank
1,611 | 88.95%
DOI
10.1145/335168.335220

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{agarwal_pods00,
        address = {New York, NY, USA},
        series = {{PODS} '00},
        title = {{Indexing Moving Points (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/335168.335220},
        doi = {10.1145/335168.335220},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Agarwal, Pankaj K. and Arge, Lars and Erickson, Jeff},
        year = {2000}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers