The design and analysis of spatial data structures
The design and analysis of spatial data structures
Recent directions in netlist partitioning: a survey
Integration, the VLSI Journal
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Parallel Incremental Graph Partitioning
IEEE Transactions on Parallel and Distributed Systems
Multidimensional access methods
ACM Computing Surveys (CSUR)
Multilevel k-way partitioning scheme for irregular graphs
Journal of Parallel and Distributed Computing
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Spectral-based multiway FPGA partitioning
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
Finding time-dependent shortest paths over large graphs
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
Efficient network query processing is extremely important in Geographical Information Systems (GIS) and Intelligent Transportation Systems (ITS) which include various applications of transportation, utility and communication networks, etc. In order to reduce the I/O cost in network query processing a given network should be stored with high disk-space utilization and a low edge-cut ratio. To do so the nodes in the network should be clustered in such a way that each cluster fits in a disk page with as small number of edge-cuts as possible. This is known as the network clustering problem which is NP-complete. In this paper we present a network clustering method, called Network-Traversal Clustering (NTC) method, which assigns the nodes of a given network to disk pages with optimal disk-space utilization and a low edge-cut ratio. NTC is suitable for the bulk loading operation into a network indexing structure. In the experimental results NTC outperformed the Connectivity-Clustered Access Method, the Spatial Partition Clustering (SPC) and SPC-R which is a modification of SPC on various networks.