CLUSTERING A DAG FOR CAD DATABASES

被引:45
作者
BANERJEE, J
KIM, W
KIM, SJ
GARZA, JF
机构
[1] MCC,AUSTIN,TX
[2] UNIV TEXAS,DEPT COMP SCI,AUSTIN,TX 78712
关键词
Computer Aided Design - Computer Programming--Algorithms - Data Processing--Data Structures - Mathematical Techniques--Graph Theory;
D O I
10.1109/32.9055
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A DAG (direct acyclic graph) is an important data structure which requires efficient support in CAD (computer-aided design) databases. It typically arises 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.
引用
收藏
页码:1684 / 1699
页数:16
相关论文
共 10 条
  • [1] BANERJEE J, 1985, STORAGE STRUCTURES E
  • [2] BANERJEE J, 1985, CLUSTERING ALGORITHM
  • [3] UBIQUITOUS B-TREE
    COMER, D
    [J]. COMPUTING SURVEYS, 1979, 11 (02) : 121 - 137
  • [4] GUTTMAN A, 1984, THESIS U CALIFORNIA
  • [5] Horowitz E., 1978, FUNDAMENTALS COMPUTE
  • [6] HSIAO D, 1977, OSUCISRCTR771 OH STA
  • [7] KATZ R, 1985, COMPUTER SCI SURVEY
  • [8] KIM W, 1987, FEB P INT C DAT ENG
  • [9] Schkolnick M., 1977, ACM Transactions on Database Systems, V2, P27, DOI 10.1145/320521.320531
  • [10] [No title captured]