On Indexing Mobile Objects
Summary: Dynamic external-memory indexes for mobile objects in 1D (with 2D extensions): a worst-case linear-space algorithm and a practical dynamic approximation with linear space and expected log query time. Also: restricted-case log queries, a d‑dimensional I/O lower bound, and initial experiments vs. traditional indexes. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. George Kollios (Polytechnic University)
- 2. Dimitrios Gunopulos (University of California Riverside)
- 3. Vassilis J. Tsotras (University of California Riverside)
BibTeX Citation
@inproceedings{kollios_pods99,
address = {New York, NY, USA},
series = {{PODS} '99},
title = {{On Indexing Mobile Objects}},
url = {https://dl.acm.org/doi/10.1145/303976.304002},
doi = {10.1145/303976.304002},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Kollios, George and Gunopulos, Dimitrios and Tsotras, Vassilis J.},
year = {1999}
}
Incoming Citations (Sorted by Pagerank)
Showing 21 of 21 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2 | R-Trees: A Dynamic Index Structure For Spatial Searching | 1984 | SIGMOD | 0.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 42 | The R+-Tree: A Dynamic Multi-Dimensional Index for Objects | 1987 | VLDB | 0.00046170812 |
| 1,219 | Processing Queries By Linear Constraints | 1997 | PODS | 0.00011620957 |
| 1,561 | Efficient Searching with Linear Constraints (Extended Abstract) | 1998 | PODS | 0.00010361147 |
| 1,877 | The LSD tree: spatial access to multidimensional point and non-point objects | 1989 | VLDB | 9.5658249e-05 |
| 2,003 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS | 9.3214272e-05 |
| 2,168 | A Qualitative Comparison Study of Data Structures for Large Line Segment Databases | 1992 | SIGMOD | 9.0469646e-05 |
| 4,620 | On Indexing Line Segments | 1990 | VLDB | 6.6025691e-05 |
| 7,310 | The hB-Pi-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation | 1995 | VLDB | 5.6494751e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 560 | Indexing the Positions of Continuously Moving Objects | 2000 | SIGMOD |
| 2 | 8,810 | Dynamic Data Structures for Document Collections and Graphs | 2015 | PODS |
| 3 | 2,375 | Novel Approaches to the Indexing of Moving Object Trajectories | 2000 | VLDB |
| 4 | 4,730 | A Lower Bound Theorem for Indexing Schemes and its Application to Multidimensional Range Queries | 1998 | PODS |
| 5 | 3,741 | Spatial Online Sampling and Aggregation | 2016 | VLDB |
| 6 | 8,937 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 7 | 11,751 | On the I/O Complexity of the k-Nearest Neighbors Problem | 2020 | PODS |
| 8 | 2,003 | Indexing for Data Models with Constraints and Classes (Extended Abstract) | 1993 | PODS |
| 9 | 1,611 | Indexing Moving Points (Extended Abstract) | 2000 | PODS |
| 10 | 1,529 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |