Roads, Codes, and Spatiotemporal Queries
Summary: Coding-based hypercube embedding assigns compact labels to road-network nodes so Hamming distance approximates shortest-path distance, enabling ultra-fast distance-aware indexing and spatial hashing. Supports join/range/intercept and spatiotemporal queries for objects moving along network curves with analytic bounds and empirical validation on large planar road graphs. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sandeep Gupta (University of California Riverside)
- 2. Swastik Kopparty (University of California Riverside)
- 3. Chinya Ravishankar (University of California Riverside)
BibTeX Citation
@inproceedings{gupta_pods04,
address = {New York, NY, USA},
series = {{PODS} '04},
title = {{Roads, Codes, and Spatiotemporal Queries}},
url = {https://dl.acm.org/doi/10.1145/1055558.1055576},
doi = {10.1145/1055558.1055576},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Gupta, Sandeep and Kopparty, Swastik and Ravishankar, Chinya},
year = {2004}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB | 0.00013028107 |
| 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD | 0.00011664469 |
| 9,143 | Processing Proximity Relations in Road Networks | 2010 | SIGMOD | 5.3153925e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 449 | Query Processing in Spatial Network Databases | 2003 | VLDB | 0.0001826404 |
| 560 | Indexing the Positions of Continuously Moving Objects | 2000 | SIGMOD | 0.00016525569 |
| 896 | On Indexing Mobile Objects | 1999 | PODS | 0.0001334014 |
| 957 | The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries | 2003 | VLDB | 0.00012962576 |
| 1,611 | Indexing Moving Points (Extended Abstract) | 2000 | PODS | 0.00010218339 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,807 | Diversified Top-k Route Planning in Road Network | 2022 | VLDB |
| 2 | 2,871 | P2H: Efficient Distance Querying on Road Networks by Projected Vertex Separators | 2021 | SIGMOD |
| 3 | 9,619 | Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks | 2025 | SIGMOD |
| 4 | 1,232 | A Highway-Centric Labeling Approach for Answering Distance Queries on Large Sparse Graphs | 2012 | SIGMOD |
| 5 | 1,205 | Shortest Path and Distance Queries on Road Networks: Towards Bridging Theory and Practice | 2013 | SIGMOD |
| 6 | 6,292 | Hierarchical Cut Labelling – Scaling Up Distance Queries on Road Networks | 2023 | SIGMOD |
| 7 | 9,111 | Efficient Algorithms for Finding Optimal Meeting Point on Road Networks | 2011 | VLDB |
| 8 | 7,602 | Clustering Objects on a Spatial Network | 2004 | SIGMOD |
| 9 | 1,613 | When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks | 2018 | SIGMOD |
| 10 | 949 | Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation | 2012 | VLDB |