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.
|Number of pages||10|
|State||Published - 1 Jan 1995|
|Event||Proceedings of the 1995 IEEE 11th International Conference on Data Engineering - Taipei, Taiwan|
Duration: 6 Mar 1995 → 10 Mar 1995
|Conference||Proceedings of the 1995 IEEE 11th International Conference on Data Engineering|
|Period||6/03/95 → 10/03/95|