Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Introduction to algorithms
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
Hybrid transitive closure algorithms
Proceedings of the sixteenth international conference on Very large databases
Distributed transitive closure computations: the disconnection set approach
Proceedings of the sixteenth international conference on Very large databases
Complex transitive closure queries on a fragmented graph
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Incremental algorithms for minimal length paths
Journal of Algorithms
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
What's special about spatial?: database requirements for vehicle navigation in geographic space
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Hierarchical optimization of optimal path finding for transportation applications
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Path queries for transportation networks: dynamic reordering and sliding window paging techniques
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Parallel hierarchical evaluation of transitive closure queries
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Integrated Query Processing Strategies for Spatial Path Queries
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Data fragmentation for parallel transitive closure strategies
Proceedings of the Ninth International Conference on Data Engineering
Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index
Proceedings of the Ninth International Conference on Data Engineering
An Access Structure for Generalized Transitive Closure Queries
Proceedings of the Ninth 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
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA/DB
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Materialization and Incremental Update of Path Information
Proceedings of the Fifth International Conference on Data Engineering
Efficient Search in Very Large Databases
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Finding shortest paths in large network systems
Proceedings of the 9th ACM international symposium on Advances in geographic information systems
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
A Linear-Order Based Access Method for Efficient Network Computations
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Covering minimum spanning trees of random subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Clustering objects on a spatial network
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Reverse Nearest Neighbors in Large Graphs
IEEE Transactions on Knowledge and Data Engineering
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Distance join queries on spatial networks
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Optimization and evaluation of shortest path queries
The VLDB Journal — The International Journal 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
A fast unified optimal route query evaluation algorithm
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Methods for path and service planning under route constraints
International Journal of Computer Applications in Technology
Methods for path and service planning under route constraints
International Journal of Computer Applications in Technology
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
On-line exact shortest distance query processing
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Fast object search on road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Navigational path privacy protection: navigational path privacy protection
Proceedings of the 18th ACM conference on Information and knowledge management
Two-layer hierarchical wavelength routing for islands of transparency optical networks
Computer Communications
Monitoring minimum cost paths on road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multi-type nearest neighbor queries in road networks with time window constraints
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Distance-join: pattern match query in a large graph database
Proceedings of the VLDB Endowment
Path oracles for spatial networks
Proceedings of the VLDB Endowment
Probabilistic path queries in road networks: traffic uncertainty aware path selection
Proceedings of the 13th International Conference on Extending Database Technology
Efficient and scalable multi-geography route planning
Proceedings of the 13th International Conference on Extending Database Technology
Network-tree model and shortest path algorithm
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Continuous evaluation of fastest path queries on road networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Towards a semantic spatial model for pedestrian indoor navigation
ER'07 Proceedings of the 2007 conference on Advances in conceptual modeling: foundations and applications
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
Shortest path computation on air indexes
Proceedings of the VLDB Endowment
Neighborhood-privacy protected shortest distance computing in cloud
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Subgraph search over massive disk resident graphs
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Dynamic pickup and delivery with transfers
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Direction-based surrounder queries for mobile recommendations
The VLDB Journal — The International Journal on Very Large Data Bases
Context-aware nearest neighbor query on social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
Top-K possible shortest path query over a large uncertain graph
WISE'11 Proceedings of the 12th international conference on Web information system engineering
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
New query processing algorithms for range and k-NN search in spatial network databases
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
A parallel algorithm for computing shortest paths in large-scale networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
A safe-exit approach for efficient network-based moving range queries
Data & Knowledge Engineering
An efficient shortest path computation system for real road networks
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Answering pattern match queries in large graph databases via graph embedding
The VLDB Journal — The International Journal on Very Large Data Bases
Dynamic skyline queries in large graphs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
Shortest path and distance queries on road networks: an experimental evaluation
Proceedings of the VLDB Endowment
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Materialization-Based range and k-nearest neighbor query processing algorithms
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
A highway-centric labeling approach for answering distance queries on large sparse graphs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Top-k spatial keyword queries on road networks
Proceedings of the 15th International Conference on Extending Database Technology
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Aggregate nearest neighbor search methods using SSMTA* algorithm on road-network
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Finding nearest neighbors in road networks: a tree decomposition method
Proceedings of the Joint EDBT/ICDT 2013 Workshops
Shortest path and distance queries on road networks: towards bridging theory and practice
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
G-tree: an efficient index for KNN search on road networks
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Shortest path finder with light materialized path view for location based services
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Efficient path computation is essential for applications such as intelligent transportation systems (ITS) and network routing. In ITS navigation systems, many path requests can be submitted over the same, typically huge, transportation network within a small time window. While path precomputation (path view) would provide an efficient path query response, it raises three problems which must be addressed: 1) precomputed paths exceed the current computer main memory capacity for large networks; 2) disk-based solutions are too inefficient to meet the stringent requirements of these target applications; and 3) path views become too costly to update for large graphs (resulting in out-of-date query results). We propose a hierarchical encoded path view (HEPV) model that addresses all three problems. By hierarchically encoding partial paths, HEPV reduces the view encoding time, updating time and storage requirements beyond previously known path precomputation techniques, while significantly minimizing path retrieval time. We prove that paths retrieved over HEPV are optimal. We present complete solutions for all phases of the HEPV approach, including graph partitioning, hierarchy generation, path view encoding and updating, and path retrieval. In this paper, we also present an in-depth experimental evaluation of HEPV based on both synthetic and real GIS networks. Our results confirm that HEPV offers advantages over alternative path finding approaches in terms of performance and space efficiency.