Effective graph clustering for path queries in digital map databases
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
Multidimensional access methods
ACM Computing Surveys (CSUR)
A Multiresolution Terrain Model for Efficient Visualization Query Processing
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
CCAM is an access method for general networks. It uses connectivity clustering. The nodes of the network are assigned to disk pages via the graph partitioning approach to maximize the CRR, i.e., the chances that a pair of connected nodes are allocated to a common page of the file. CCAM supports the operations of insert, delete, create, and find as well as the new operations, get-A-successor and get-successors, which retrieve one or all successors of a node to facilitate aggregate computations on networks. CCAM includes methods for static clustering, as well as dynamic incremental reclustering, to maintain, high CRR, in the face of updates without incurring high overheads. Experimental analysis indicates that CCAM can outperform many other access methods for network operations.