DocumentCode :
1444280
Title :
Clustering a DAG for CAD databases
Author :
Banerjee, Jay ; Kim, Won ; Kim, Sung-jo ; Garza, Jorge F.
Volume :
14
Issue :
11
fYear :
1988
fDate :
11/1/1988 12:00:00 AM
Firstpage :
1684
Lastpage :
1699
Abstract :
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
Keywords :
CAD; data structures; database management systems; directed graphs; storage management; CAD databases; DAG; clustered sequences; clustering sequences; computer-aided design; data structure; design hierarchy; direct acyclic graph; storage management; Assembly systems; Clustering algorithms; Data structures; Databases; Design automation; Design engineering; Helium; Information retrieval; Microprocessor chips; Software systems;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/32.9055
Filename :
9055
Link To Document :
بازگشت