Efficient successor retrieval operations for aggregate query processing on clustered road networks
- 1 July 2010
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 180 (14) , 2743-2762
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed verticesJournal of Parallel and Distributed Computing, 2008
- Hypergraph-Partitioning-Based Remapping Models for Image-Space-Parallel Direct Volume Rendering of Unstructured GridsIEEE Transactions on Parallel and Distributed Systems, 2006
- Optimization and evaluation of shortest path queriesThe VLDB Journal, 2006
- Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases2006
- Permuting Sparse Rectangular Matrices into Block-Diagonal FormSIAM Journal on Scientific Computing, 2004
- A Framework for Generating Network-Based Moving ObjectsGeoInformatica, 2002
- Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplicationIEEE Transactions on Parallel and Distributed Systems, 1999
- Two novel multiway circuit partitioning algorithms using relaxed lockingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- Generalized best-first search strategies and the optimality of A*Journal of the ACM, 1985