Database Paper Browser

Back to papers

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)

Paper ID
1314
Venue
PODS
Year
2004
Pagerank
7.1855249e-05
Overall Rank
3,352 | 76.69%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

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
389 Query Processing in Spatial Network Databases 2003 VLDB 0.00024620268
631 Indexing the Positions of Continuously Moving Objects 2000 SIGMOD 0.00018935493
1,002 On Indexing Mobile Objects 1999 PODS 0.00014702555
1,067 The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries 2003 VLDB 0.00014327945
1,766 Indexing Moving Points (Extended Abstract) 2000 PODS 0.000106236
Previous Page 1 / 1 Next

Semantically Similar Papers