This Article 
 Bibliographic References 
 Add to: 
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
January-February 1997 (vol. 9 no. 1)
pp. 102-119

Abstract—Current Spatial Database Management Systems (SDBMS) provide efficient access methods and operators for point and range queries over collections of spatial points, line segments, and polygons. However, it is not clear if existing spatial access methods can efficiently support network computations which traverse line-segments in a spatial network based on connectivity rather than geographic proximity. The expected I/O cost for many network operations can be reduced by maximizing the Weighted Connectivity Residue Ratio (WCRR), i.e., the chance that a pair of connected nodes that are more likely to be accessed together are allocated to a common page of the file. CCAM is an access method for general networks that uses connectivity clustering. 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. The nodes of the network are assigned to disk pages via a graph partitioning approach to maximize the WCRR. CCAM includes methods for static clustering, as well as dynamic incremental reclustering, to maintain high WCRR in the face of updates, without incurring high overheads. We also describe possible modifications to improve the WCRR that can be achieved by existing spatial access methods. Experiments with network computations on the Minneapolis road map show that CCAM outperforms existing access methods, even though the proposed modifications also substantially improve the performance of existing spatial access methods.

[1] "Intelligent Vehicle Highway Systems Projects," Dept. of Transportation, Minnesota Document, Mar. 1994.
[2] D. Abel and D. Mark, "A Comparative Analysis of Some Two-Dimensional Orderings," Int'l J. GIS, vol. 4, no. 1, pp. 21-31, 1990.
[3] R. Agrawal and H.V. Jagadish, "Algorithms for Searching Massive Graphs," IEEE Trans. Knowledge and Data Eng., vol. 6, no. 2, Apr. 1994.
[4] R. Agrawal and J. Kiernan, " An Access Structure for Generalized Transitive Closure Queries," Proc. Ninth Int'l Conf. Data Eng., pp. 429-438. IEEE, Apr. 1993.
[5] J. Banerjee, S. Kim, W. Kim, and J. Garza, "Clustering a DAG for CAD Databases," IEEE Trans. Software Eng., vol. 14, no. 11, pp. 1,684-1,699, Nov. 1988.
[6] E.R. Barnes, "An Algorithm for Partitioning the Nodes of a Graph," SIAM J. Algorithms Discrete Methods., vol. 3, no. 4, pp. 541-550, Dec. 1982.
[7] C.K. Cheng and Y.C. Wei, "An Improved Two-Way Partitioning Algorithm with Stable Performance," IEEE Trans. Computer-Aided Design, vol. 10, no. 12, pp. 1,502-1,511, Dec. 1991.
[8] W.C. Collier and R.J. Weiland, "Smart Cars, Smart Highways," IEEE Spectrum, pp. 27-33, Apr. 1994.
[9] "On the Optimality of A*," J. Artificial Intelligence, vol. 8, no. 1, pp. 69-76, 1977.
[10] S. Dar and H.V. Jagadish, "A Spanning Tree Transitive Closure Algorithm," Proc. Int'l Conf. Data Eng., IEEE, 1992.
[11] C. Faloutsos and Y. Rong, "DOT: A Spatial Access Method Using Fractals," Proc. Seventh Int'l Conf. Data Eng., IEEE, 1991.
[12] C. Faloutsos and S. Roseman, "Fractals for Secondary Key Retrival," Proc. Symp. Principles of Database Systems, SIGMOD-SIGACT PODS, 1989.
[13] C.M. Fiduccia and R.M. Mattheyses, "A Linear Time Heuristic for Improving Network Partitions," Proc. 19th Design Automation Conf., pp. 175-181, 1982.
[14] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[15] M.F. Goodchild, "Towards an Enumeration and Classification of GIS Functions," Proc. Int'l Geographic Info. Systems Symp., 1987.
[16] O. Gunther, "The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases," Proc. Fifth Int'l Conf. Data Eng., Feb. 1989.
[17] O. Gunther and J. Bilmes, "Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation," IEEE Trans. Knowledge and Data Eng., vol. 3, no. 3, Sept. 1991.
[18] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD Conf. Management of Data, 1984.
[19] P. Haggett and R.J. Chorley, Network Analysis in Geography.New York: St. Martin's Press, 1969.
[20] K. Hua, J. Su, and C. Hua, "An Efficient Strategy for Traversal Recursive Query Evaluation," Proc. Ninth Int'l Conf. Data Eng. IEEE, Apr. 1993.
[21] Y. Ioannidis, R. Ramakrishnan, and L. Winger, "Transitive Closure Algorithms Based on Graph Traversal," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.
[22] H.V. Jagadish, "Linear Clustering of Objects with Multiple Attributes," Proc. Int'l Conf. Management of Data, pp. 332-342, ACM SIGMOD, 1990.
[23] B. Jiang, "I/O Efficiency of Shortest Path Algorithms: An Analysis," Proc. Int'l Conf. Data Eng., IEEE, 1992.
[24] I. Kamel and C. Faloutsos, "Hilbert R-Tree: An Improved R-Tree using Fractals," Proc. Int'l Conf. Very Large Data Bases, 1994.
[25] B.W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs," Bell System Technology J., vol. 49, no. 2, pp. 291-307, Feb. 1970.
[26] R. Kung, E. Hanson et al., "Heuristic Search in Data Base Systems," Proc. Expert Database Systems, Benjamin Cummings, 1986.
[27] Y. Kusumi, S. Nishio, and T. Hasegawa, "File Access Level Optimization Using Page Access Graph on Recursive Query Evaluation," Proc. Conf. Extending Database Technology, EDBT, 1988.
[28] P.A. Larson and V. Deshpande, "A File Structure Supporting Traversal Recursion," Proc. SIGMOD Conf., pp. 243-252, ACM, 1989.
[29] R. Laurini and D. Thompson, Fundamentals of Spatial Information Systems," chapter 5 paragraph 2.5.4, no. 37, The A.P.I.C. Series. Academic Press, 1992.
[30] D.R. Liu and S. Shekhar, "CCAM: Connectivity-Clustered Access Method for Networks and Network Computations," Technical Report TR 93-78, Computer Science Dept., Univ. of Minnesota, 1993.
[31] J. Nievergelt, H. Hinterberger, and K.C. Sevcik, "The Grid File: An Adaptable, Symmetric Multikey File Structure," ACM Trans. Database Systems, vol. 9, no. 1, pp. 38-71, Mar. 1984.
[32] A. Orenstein and T. Merrett, "A Class of Data Structures for Associative Searching," Proc. Symp. Principles of Database Systems, pp. 181-190, SIGMOD-SIGACT PODS, 1984.
[33] J.T. Robinson, “The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 10-18, 1981.
[34] H. Samet, The Design and Analysis of Spatial Data Structures. Addison-Wesley, 1990.
[35] P. Scheuermann and M. Ouskel, "Multidimensional B-trees for Associative Searching in Database Systems," Information Systems, vol. 7, no. 2, 1982.
[36] T. Sellis, N. Roussopoulos, and C. Faloutsos, “The R+-Tree: A Dynamic Index for Multidimensional Objects,” Proc. 13th Int'l Conf. Very Large Data Bases (VLDB), 1987.
[37] S. Shekhar, A. Kohli, and M. Coyle, "Can Proximity-Based Access Methods Efficiently Support Network Computations?" Technical Report TR-93-57, Computer Science Dept., Univ. of Minnesota, 1993.
[38] S. Shekhar, A. Kohli, and M. Coyle, "Path Computation Algorithms for Advanced Traveler Information System," Proc. Ninth Int'l Conf. Data Eng., pp. 31-39, IEEE, Apr. 1993.
[39] S. Shekhar and D.R. Liu., "Genesis and Advanced Traveler Information Systems (ATIS): Killer Applications for Mobile Computting," Proc. National Science Foundation MOBIDATA Workshop, Mobile and Wireless Information Systems, 1994.
[40] M. Stonebraker, J. Frew, K. Gardels, and J. Meredith, "The Sequoia 2000 Benchmark," Proc. Int'l Conf. Management of Data, ACM, 1993.
[41] M.M. Tsangaris and J.F. Naughton, "A Stochastic Approach for Clustering in Object Bases," Proc. SIGMOD Conf. Management of Data, pp. 12-21, ACM, 1991.
[42] P. Valduriez and H. Boral, "Evaluation of Recursive Queries Using Join Indices," Proc. Int'l Conf. Expert Database Systems, 1986.
[43] A.P. Vonderohe et al., "Adaption of GIS for Transportation," NCHRP Report 359, Transportation Research Board, National Research Council, 1993.
[44] J.L. Wiener and J.F. Naughton, "Bulk Loading into an OODB: A Performance Study," Proc. Int'l Conf. Very Large Data Bases, 1994.
[45] C.W. Yeh, C.K. Cheng, and T.T.Y. Lin, "A General Purpose Multiple Way Partitioning Algorithm," Proc. 28th ACM/IEEE Design Automation Conf., pp. 421-426, 1991.

Index Terms:
Access methods, geographic information systems, network computations, spatial databases, spatial networks.
Shashi Shekhar, Duen-Ren Liu, "CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations," IEEE Transactions on Knowledge and Data Engineering, vol. 9, no. 1, pp. 102-119, Jan.-Feb. 1997, doi:10.1109/69.567054
Usage of this product signifies your acceptance of the Terms of Use.