A Benchmark for Evaluating Moving Object Indexes
Summary: Proposes a benchmark for evaluating moving-object indexes, targeting current and near-future position data. Emphasizes update efficiency, query performance, concurrency control, and storage; validates the benchmark on six indexes to reveal tradeoffs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Su Chen (National University of Singapore)
- 2. Christian S. Jensen (Aalborg University)
- 3. Dan Lin (Purdue University)
BibTeX Citation
@article{chen_vldb08,
title = {{A Benchmark for Evaluating Moving Object Indexes}},
author = {Chen, Su and Jensen, Christian S. and Lin, Dan},
journal = {PVLDB},
series = {{VLDB} '08},
volume = {1},
number = {1},
pages = {1574--1585},
doi = {10.14778/1454159.1454170},
url = {https://doi.org/10.14778/1454159.1454170},
year = {2008}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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 |
| 560 | Indexing the Positions of Continuously Moving Objects | 2000 | SIGMOD | 0.00016525569 |
| 957 | The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries | 2003 | VLDB | 0.00012962576 |
| 2,020 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB | 9.2983514e-05 |
| 2,254 | STRIPES: An Efficient Index for Predicted Trajectories | 2004 | SIGMOD | 8.8603695e-05 |
| 4,043 | ST2B-tree: A Self-Tunable Spatio-Temporal B+-tree Index for Moving Objects | 2008 | SIGMOD | 6.9403241e-05 |
| 4,569 | Supporting Frequent Updates in R-Trees: A Bottom-Up Approach | 2003 | VLDB | 6.6255507e-05 |
| 9,324 | Main-Memory Operation Buffering for Efficient R-Tree Update | 2007 | VLDB | 5.289545e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,481 | Magic mirror in my hand, which is the best in the land? An Experimental Evaluation of Index Selection Algorithms | 2020 | VLDB |
| 2 | 3,792 | Learned Index: A Comprehensive Experimental Evaluation | 2023 | VLDB |
| 3 | 1,087 | The OO7 Benchmark | 1993 | SIGMOD |
| 4 | 8,326 | Index Research: Forest or Trees? | 2000 | SIGMOD |
| 5 | 2,806 | Are Updatable Learned Indexes Ready? | 2022 | VLDB |
| 6 | 1,512 | On the Analysis of Indexing Schemes | 1997 | PODS |
| 7 | 9,322 | An Adaptive Updating Protocol for Reducing Moving Object Database Workload | 2010 | VLDB |
| 8 | 847 | Benchmarking Learned Indexes | 2021 | VLDB |
| 9 | 2,020 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 10 | 10,984 | Benchmarking Adaptive Multidimensional Indices | 2025 | VLDB |