This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Clustering a DAG for CAD Databases
November 1988 (vol. 14 no. 11)
pp. 1684-1699

A DAG (direct acyclic graph) is an important data structure which requires efficient support in CAD (computer-aided design) databases. It typically arise from the design hierarchy, which describes complex designs in terms of subdesigns. A study is made of the properties of the three types of clustered sequences of nodes for hierarchies and DAGs, and algorithms are developed for generating the clustered sequences, retrieving the descendants of a given node, and inserting new nodes into existing clustered sequences of nodes which preserve their clustering properties. The performance of the clustering sequences is compared.

[1] J. Banerjee, "A clustering algorithm based on recursive traversal patterns in graph models of CAD," MCC, Internal Rep., Oct. 1985.
[2] J. Banerjee and W. Kim, "Storage structures for evaluating recursion in CAD databases," MCC, Internal Rep., Oct. 1985.
[3] R. Bayer and E. McCreight, "Organization and maintenance of large ordered indices,"Acta Inform., vol. 1, 1972.
[4] C. Comer, "The ubiquitousB-trees,"ACM Comput. Surveys, vol. 11, no. 2, pp. 121-136, June 1979.
[5] A. Guttman, "New features for relational database systems to support CAD applications," Ph.D. dissert., Comput. Sci. Dept., Univ. California, Berkley, June 1984.
[6] D. Hsiao, D. S. Kerr, and F. Ng, "DBC software requirements for supporting hierarchical databases," Ohio State Univ. Tech. Rep. OSU-CISRC-TR-77-1, Apr. 1977.
[7] E. Horowitz and S. Sahni,Fundamentals of Computer Algorithms. Rockville, MD: Computer Sci. Press, 1978.
[8] R. Katz,Information Management for Engineering Design(Computer Science Survey Series). Heidelberg, Germany: Springer-Verlag, 1985.
[9] W. Kim, H.-T. Chou, and J. Banerjee, "Semantics and implementation of complex objects," inProc. Int. Conf. Data Engineering, Los Angeles, CA, Feb. 1987.
[10] M. Schkolnick, "A clustering algorithm for hierarchical structures,"ACM Trans. Database Syst., 1977, pp. 27-44.

Index Terms:
storage management; DAG; CAD databases; direct acyclic graph; data structure; computer-aided design; design hierarchy; clustered sequences; clustering sequences; CAD; data structures; database management systems; directed graphs; storage management
Citation:
J. Banerjee, W. Kim, S.-J. Kim, J.F. Garza, "Clustering a DAG for CAD Databases," IEEE Transactions on Software Engineering, vol. 14, no. 11, pp. 1684-1699, Nov. 1988, doi:10.1109/32.9055
Usage of this product signifies your acceptance of the Terms of Use.