Generalized best-first search strategies and the optimality of A*
Journal of the ACM (JACM)
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Multilevel hypergraph partitioning: applications in VLSI domain
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An improved network clustering method for I/O-efficient query processing
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
A Framework for Generating Network-Based Moving Objects
Geoinformatica
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
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
Hypergraph Models and Algorithms for Data-Pattern-Based Clustering
Data Mining and Knowledge Discovery
SIAM Journal on Scientific Computing
Clustering objects on a spatial network
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Iterative-improvement-based declustering heuristics for multi-disk databases
Information Systems
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
Proceedings of the 2006 ACM symposium on Applied computing
IEEE Transactions on Parallel and Distributed Systems
Parallel image restoration using surrogate constraint methods
Journal of Parallel and Distributed Computing
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
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
Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods
SIAM Journal on Scientific Computing
Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices
Journal of Parallel and Distributed Computing
Mining frequent trajectory patterns in spatial-temporal databases
Information Sciences: an International Journal
Exploiting the performance gains of modern disk drives by enhancing data locality
Information Sciences: an International Journal
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
Two novel multiway circuit partitioning algorithms using relaxed locking
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Replicated partitioning for undirected hypergraphs
Journal of Parallel and Distributed Computing
Algorithmic superactivation of asymptotic quantum capacity of zero-capacity quantum channels
Information Sciences: an International Journal
Hi-index | 0.07 |
Get-Successors (GS) which retrieves all successors of a junction is a kernel operation used to facilitate aggregate computations in road network queries. Efficient implementation of the GS operation is crucial since the disk access cost of this operation constitutes a considerable portion of the total query processing cost. Firstly, we propose a new successor retrieval operation Get-Unevaluated-Successors (GUS), which retrieves only the unevaluated successors of a given junction. The GUS operation is an efficient implementation of the GS operation, where the candidate successors to be retrieved are pruned according to the properties and state of the algorithm. Secondly, we propose a hypergraph-based model for clustering successively retrieved junctions by the GUS operations to the same pages. The proposed model utilizes query logs to correctly capture the disk access cost of GUS operations. The proposed GUS operation and associated clustering model are evaluated for two different instances of GUS operations which typically arise in Dijkstra's single source shortest path algorithm and incremental network expansion framework. Our simulation results show that the proposed successor retrieval operation together with the proposed clustering hypergraph model is quite effective in reducing the number of disk accesses in query processing.