CCAM: a connectivity-clustered access method for aggregate queries on transportation networks: a summary of results

Shashi Shekhar; Duen-Ren Liu

doi:10.1109/ICDE.1995.380356

CCAM: a connectivity-clustered access method for aggregate queries on transportation networks: a summary of results

Shashi Shekhar^*, Duen-Ren Liu

^*Corresponding author for this work

Institute of Information Management

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

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.

Original language	English
Pages	410-419
Number of pages	10
DOIs	https://doi.org/10.1109/ICDE.1995.380356
State	Published - 1995
Event	Proceedings of the 1995 IEEE 11th International Conference on Data Engineering - Taipei, Taiwan Duration: 6 Mar 1995 → 10 Mar 1995

Conference

Conference	Proceedings of the 1995 IEEE 11th International Conference on Data Engineering
City	Taipei, Taiwan
Period	6/03/95 → 10/03/95

Access to Document

10.1109/ICDE.1995.380356

Cite this

@conference{fc10531d9b26435496655ec02dfd348b,

title = "CCAM: a connectivity-clustered access method for aggregate queries on transportation networks: a summary of results",

abstract = "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.",

author = "Shashi Shekhar and Duen-Ren Liu",

year = "1995",

doi = "10.1109/ICDE.1995.380356",

language = "English",

pages = "410--419",

note = "Proceedings of the 1995 IEEE 11th International Conference on Data Engineering ; Conference date: 06-03-1995 Through 10-03-1995",

}

TY - CONF

T1 - CCAM

T2 - Proceedings of the 1995 IEEE 11th International Conference on Data Engineering

AU - Shekhar, Shashi

AU - Liu, Duen-Ren

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029238064&partnerID=8YFLogxK

U2 - 10.1109/ICDE.1995.380356

DO - 10.1109/ICDE.1995.380356

M3 - Paper

AN - SCOPUS:0029238064

SP - 410

EP - 419

Y2 - 6 March 1995 through 10 March 1995

ER -

CCAM: a connectivity-clustered access method for aggregate queries on transportation networks: a summary of results

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this