Information management for engineering design
Information management for engineering design
A clustering algorithm for hierarchical structures
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Operations and Implementation of Complex Objects
Proceedings of the Third International Conference on Data Engineering
New features for a relational database system to support computer aided design
New features for a relational database system to support computer aided design
A file structure supporting traversal recursion
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
A compression technique to materialize transitive closure
ACM Transactions on Database Systems (TODS)
Effective clustering of complex objects in object-oriented databases
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Efficient assembly for complex objects
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
The term retrieval abstract machine
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Performances of clustering policies in object bases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Spatial data traversal in road map databases: a graph indexing approach
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Self-adaptive, on-line reclustering of complex object data
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Effective clustering of objects stored by linear hashing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Effective graph clustering for path queries in digital map databases
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
View materialization techniques for complex hierarchical objects
CIKM '97 Proceedings of the sixth international conference on Information and knowledge management
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
Cache-conscious structure layout
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Vclusters: a flexible, fine-grained object clustering mechanism
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Logically Clustered Architectures for Networked Databases
Distributed and Parallel Databases
Object Organization on a Single Broadcast Channel in the Mobile Computing Environment
Multimedia Tools and Applications
IEEE Transactions on Knowledge and Data Engineering
Path Signatures: A Way to Speed Up Recursion in Relational Databases
IEEE Transactions on Knowledge and Data Engineering
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Clustering Techniques for Minimizing External Path Length
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Affinity-Based Probabilistic Reasoning and Document Clustering on the WWW
COMPSAC '00 24th International Computer Software and Applications Conference
A Linear-Order Based Access Method for Efficient Network Computations
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Opportunistic Prioritised Clustering Framework (OPCF)
Proceedings of the International Symposium on Objects and Databases
ICGT '02 Proceedings of the First International Conference on Graph Transformation
On the computation of recursion in relational databases
Effective databases for text & document management
Challenges in graph-based relational data visualization
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
A unified framework for image database clustering and content-based retrieval
Proceedings of the 2nd ACM international workshop on Multimedia databases
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
A clustering method based on path similarities of XML data
Data & Knowledge Engineering
Opportunistic prioritised clustering framework for improving OODBMS performance
Journal of Systems and Software
XTRON: An XML data management system using relational databases
Information and Software Technology
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
Proceedings of the first international conference on Networks for grid applications
A Lagrangian approach for storage of spatio-temporal network datasets: a summary of results
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Decomposing DAGs into disjoint chains
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
| Hi-index | 0.01 |
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.