On the public citation graph
Query Processing Using Distance Oracles for Spatial Networks
0 signed · 105 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-39658-1_69openalex-snapshot
Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs
inferredcites →https://doi.org/10.1007/978-3-540-69497-7_12openalex-snapshot
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
inferredcites →https://doi.org/10.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1016/0020-0190(79)90117-0openalex-snapshot
Decomposable searching problems
inferredcites →https://doi.org/10.1016/0020-0190(82)90027-8openalex-snapshot
Multidimensional tries used for associative searching
inferredcites →https://doi.org/10.1016/b978-012722442-8/50076-8openalex-snapshot
Query Processing in Spatial Network Databases
inferredcites →https://doi.org/10.1016/j.ipl.2008.02.008openalex-snapshot
Well-separated pair decomposition in linear time?
inferredcites →https://doi.org/10.1023/a:1025153016110openalex-snapshot
A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases
inferredcites →https://doi.org/10.1109/69.687976openalex-snapshot
Hierarchical encoded path views for path query processing: an optimal model and its performance evaluation
inferredcites →https://doi.org/10.1109/icde.2006.60openalex-snapshot
Enabling Query Processing on Spatial Networks
inferredcites →https://doi.org/10.1109/icde.2009.53openalex-snapshot
Distance Oracles for Spatial Networks
inferredcites →https://doi.org/10.1109/tkde.2002.1033772openalex-snapshot
An efficient path computation model for hierarchically structured topographical road maps
inferredcites →https://doi.org/10.1109/tpami.1979.4766900openalex-snapshot
Operations on Images Using Quad Trees
inferredcites →https://doi.org/10.1137/1.9781611972870.5openalex-snapshot
In Transit to Constant Time Shortest-Path Queries in Road Networks
inferredcites →https://doi.org/10.1137/s0097539703436357openalex-snapshot
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications
inferredcites →https://doi.org/10.1137/s0097539799361671openalex-snapshot
Approximating the Stretch Factor of Euclidean Graphs
inferredcites →https://doi.org/10.1145/1097064.1097093openalex-snapshot
Efficient query processing on spatial networks
inferredcites →https://doi.org/10.1145/1183471.1183506openalex-snapshot
Distance join queries on spatial networks
inferredcites →https://doi.org/10.1145/1376616.1376623openalex-snapshot
Scalable network distance browsing in spatial databases
inferredcites →https://doi.org/10.1145/200836.200853openalex-snapshot
A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
inferredcites →https://doi.org/10.1145/253260.253302openalex-snapshot
On saying “Enough already!” in SQL
inferredcites →https://doi.org/10.1145/253262.253302openalex-snapshot
On saying “Enough already!” in SQL
inferredcites →https://doi.org/10.1145/275487.275492openalex-snapshot
An overview of query optimization in relational systems
inferredcites →https://doi.org/10.1145/276304.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/276305.276326openalex-snapshot
Incremental distance join algorithms for spatial databases
inferredcites →https://doi.org/10.1145/335191.335428openalex-snapshot
Adaptive multi-stage distance join processing
inferredcites →https://doi.org/10.1145/342009.335428openalex-snapshot
Adaptive multi-stage distance join processing
inferredcites →https://doi.org/10.1145/358728.358741openalex-snapshot
An effective way to represent quadtrees
inferredcites →https://doi.org/10.1145/602421.602453openalex-snapshot
Use of the SAND spatial browser for digital government applications
inferredcites →https://doi.org/10.14778/1687627.1687763openalex-snapshot
Path oracles for spatial networks
inferredcites →https://doi.org/10.5555/313559.313777openalex-snapshot
Faster algorithms for some geometric graph problems in higher dimensions
inferredcites →https://doi.org/10.5555/545381.545489openalex-snapshot
Approximate distance oracles for geometric graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_15openalex-snapshot
Applications of Geometric Spanner Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1556openalex-snapshot
Foundations of Nearest Neighbor Queries in Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-319-18120-2_14openalex-snapshot
On Efficient Passenger Assignment for Group Transportation
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1556-1openalex-snapshot
Foundations of Nearest Neighbor Queries in Euclidean Space
inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_2openalex-snapshot
Route Planning in Transportation Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_15-2openalex-snapshot
Applications of Geometric Spanner Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-32316-4_4openalex-snapshot
A Hybrid Shortest Path Algorithm for Intra-Regional Queries on Hierarchical Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-53974-9_8openalex-snapshot
Benchmarking Spatial Big Data
inferred← citeshttps://doi.org/10.1007/978-981-13-2324-9_10openalex-snapshot
Multithreaded Query Processing Using Quadtree
inferred← citeshttps://doi.org/10.1007/s00778-017-0464-7openalex-snapshot
I/O-efficient algorithms for top-k nearest keyword search in massive graphs
inferred← citeshttps://doi.org/10.1007/s00778-021-00705-1openalex-snapshot
RNE: computing shortest paths using road network embedding
inferred← citeshttps://doi.org/10.1007/s00778-023-00789-xopenalex-snapshot
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
inferred← citeshttps://doi.org/10.1007/s10707-011-0126-7openalex-snapshot
Editing and versioning for high performance network models in a multiuser environment
inferred← citeshttps://doi.org/10.1007/s10707-016-0265-yopenalex-snapshot
Discovering historic traffic-tolerant paths in road networks
inferred← citeshttps://doi.org/10.1007/s10707-016-0287-5openalex-snapshot
Hub Labels on the database for large-scale graphs with the COLD framework
inferred← citeshttps://doi.org/10.1109/bdcloud.2014.85openalex-snapshot
Real Time Routing in Road Networks
inferred← citeshttps://doi.org/10.1109/eecs.2018.00073openalex-snapshot
Shortest Path Algorithm Based on Community Detection
inferred← citeshttps://doi.org/10.1109/hpec.2016.7761581openalex-snapshot
Landmark routing for large graphs in fixed-memory environments
inferred← citeshttps://doi.org/10.1109/icde.2013.6544863openalex-snapshot
Memory-efficient algorithms for spatial network queries
inferred← citeshttps://doi.org/10.1109/icde.2013.6544917openalex-snapshot
Sorting in Space: Multidimensional, spatial, and metric data structures for applications in spatial databases, geographic information systems (GIS), and location-based services
inferred← citeshttps://doi.org/10.1109/icde.2016.7498328openalex-snapshot
SPDO: High-throughput road distance computations on Spark using Distance Oracles
inferred← citeshttps://doi.org/10.1109/icde.2017.172openalex-snapshot
Smart Personalized Routing for Smart Cities
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00038openalex-snapshot
A Learning-based Method for Computing Shortest Path Distances on Road Networks
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00170openalex-snapshot
FedRoad: Secure and Efficient Road Network Queries over Traffic Data Federation
inferred← citeshttps://doi.org/10.1109/ism.2015.128openalex-snapshot
Location Specification and Representation in Multimedia Databases
inferred← citeshttps://doi.org/10.1109/mdm.2014.8openalex-snapshot
Cost-Efficient Spatial Network Partitioning for Distance-Based Query Processing
inferred← citeshttps://doi.org/10.1109/mdm.2016.45openalex-snapshot
ParDiSP: A Partition-Based Framework for Distance and Shortest Path Queries on Road Networks
inferred← citeshttps://doi.org/10.1109/tcss.2024.3382944openalex-snapshot
Visualizing Routes With AI-Discovered Street-View Patterns
inferred← citeshttps://doi.org/10.1109/tkde.2013.176openalex-snapshot
Towards Online Shortest Path Computation
inferred← citeshttps://doi.org/10.1109/tkde.2016.2531667openalex-snapshot
Proxies for Shortest Path and Distance Queries
inferred← citeshttps://doi.org/10.1145/2258056.2258058openalex-snapshot
Spatial big-data challenges intersecting mobility and cloud computing
inferred← citeshttps://doi.org/10.1145/2463676.2465277openalex-snapshot
Shortest path and distance queries on road networks
inferred← citeshttps://doi.org/10.1145/2525314.2525364openalex-snapshot
Output-sensitive well-separated pair decompositions for dynamic point sets
inferred← citeshttps://doi.org/10.1145/2674918.2674924openalex-snapshot
Realtime response of shortest path computation
inferred← citeshttps://doi.org/10.1145/2820783.2820806openalex-snapshot
Analytical queries on road networks
inferred← citeshttps://doi.org/10.1145/2904378openalex-snapshot
Static presentation consistency issues in smartphone mapping apps
inferred← citeshttps://doi.org/10.1145/2939672.2939694openalex-snapshot
Aircraft Trajectory Prediction Made Easy with Predictive Analytics
inferred← citeshttps://doi.org/10.1145/2971322openalex-snapshot
Dynamic presentation consistency issues in smartphone mapping apps
inferred← citeshttps://doi.org/10.1145/3183713.3196913openalex-snapshot
When Hierarchy Meets 2-Hop-Labeling
inferred← citeshttps://doi.org/10.1145/3219819.3219874openalex-snapshot
Predicting Estimated Time of Arrival for Commercial Flights
inferred← citeshttps://doi.org/10.1145/3274895.3274947openalex-snapshot
Prescriptive analytics system for long-range aircraft conflict detection and resolution
inferred← citeshttps://doi.org/10.1145/3274895.3274978openalex-snapshot
Multi-level filtering to retrieve similar trajectories under the Fréchet distance
inferred← citeshttps://doi.org/10.1145/3318464.3389718openalex-snapshot
Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks
inferred← citeshttps://doi.org/10.1145/3328832openalex-snapshot
A Data-driven Framework for Long-Range Aircraft Conflict Detection and Resolution
inferred← citeshttps://doi.org/10.1145/3347146.3359378openalex-snapshot
Data Management and Analytics System for Online Flight Conformance Monitoring and Anomaly Detection
inferred← citeshttps://doi.org/10.1145/3486183.3492801openalex-snapshot
Visualizing accessibility with choropleth maps
inferred← citeshttps://doi.org/10.1145/3615890openalex-snapshot
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Searching and Mining Large Collections of Geospatial Data
inferred← citeshttps://doi.org/10.1145/3615890.3628531openalex-snapshot
Metric Indexing for the Earth Mover's Distance
inferred← citeshttps://doi.org/10.1145/3678717.3691225openalex-snapshot
Safety-Aware Route Navigation: Driving with Less Sun Glare
inferred← citeshttps://doi.org/10.1145/3802031openalex-snapshot
Constrained Shortest Path Finding on Terrain Surfaces
inferred← citeshttps://doi.org/10.14264/uql.2014.487openalex-snapshot
Efficient Distance-based Query Processing in Spatial Networks
inferred← citeshttps://doi.org/10.14778/2140436.2140438openalex-snapshot
Shortest path and distance queries on road networks
inferred← citeshttps://doi.org/10.14778/2536206.2536217openalex-snapshot
Top-K nearest keyword search on large graphs
inferred← citeshttps://doi.org/10.32657/10356/61838openalex-snapshot
Efficient query processing on large graphs
inferred← citeshttps://doi.org/10.3390/ijgi7070270openalex-snapshot
Shared Execution Approach to ε-Distance Join Queries in Dynamic Road Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1401.2690openalex-snapshot
Distance Landmarks Revisited for Road Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1603.00963openalex-snapshot
Using Quadrilaterals to Compute the Shortest Path
inferred← citeshttps://doi.org/10.48550/arxiv.1607.07696openalex-snapshot
Parallelized Proximity-Based Query Processing Methods for Road Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2010.08622openalex-snapshot
LiMITS: An Effective Approach for Trajectory Simplification
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.