Heuristic search in database systems
Proceedings from the first international workshop on Expert database systems
Introduction to algorithms
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Time-parameterized queries in spatio-temporal databases
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
I/O-Efficiency of Shortest Path Algorithms: An Analysis
Proceedings of the Eighth International Conference on Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
HiTi Graph Model of Topographical Roadmaps in Navigation Systems
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Location-based spatial queries
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Distance indexing on road networks
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Acceleration of shortest path and constrained shortest path computation
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Hierarchical Graph Embedding for Efficient Query Processing in Very Large Traffic Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Managing Sensor Data on Urban Traffic
ER '08 Proceedings of the ER 2008 Workshops (CMLSA, ECDM, FP-UML, M2AS, RIGiM, SeCoGIS, WISM) on Advances in Conceptual Modeling: Challenges and Opportunities
Memory-efficient A*-search using sparse embeddings
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Voronoi-based range query for trajectory data in spatial networks
Proceedings of the 2011 ACM Symposium on Applied Computing
Proximity queries in time-dependent traffic networks using graph embeddings
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Computational Transportation Science
Merged aggregate nearest neighbor query processing in road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Efficient proximity detection among mobile objects in road networks with self-adjustment methods
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm of filter-refinement query processing and can be used for proximity queries on both static as well as dynamic objects. In particular, we present how our embedding can be used to compute a lower and upper bounding filter distance which approximates the true shortest path distance significantly better than traditional filters, e.g. the Euclidean distance. These distance approximations can be used within a filter step to prune true drops and true hits as well as in the refinement step in order to guide an informed A* search. Our experimental evaluation on several real-world data sets demonstrates a significant performance boosting of our proposed concepts over existing work.