Mathematical model of composite objects and its application for organizing engineering databases

The clustering concept of component aggregation is introduced for use with design databases. Component aggregation treats assemblies having the same types of parts as being equivalent objects. A mathematical model of composite objects is developed from the idea of equivalent objects. Composite objec...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering 1988, Vol.14 (1), p.71-84
Main Authors: KETABCHI, M. A, BERZINS, V
Format: Article
Language:English
Subjects:
Algebra
Applied sciences
Boolean
CAD
Cluster analysis
Clusters
Composites
Computer aided design
Computer engineering
Computer science
Computer science
control theory
systems
Data base management systems
Designers
Engineering
Exact sciences and technology
Explosions
Information retrieval
Information systems. Data bases
Mathematical models
Memory organisation. Data processing
Software
Software engineering
Statistical analysis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The clustering concept of component aggregation is introduced for use with design databases. Component aggregation treats assemblies having the same types of parts as being equivalent objects. A mathematical model of composite objects is developed from the idea of equivalent objects. Composite objects are descriptions of assemblies of parts that can themselves be assemblies of other parts. The set of equivalence classes of objects forms a Boolean algebra whose minterms represent the objects that are not considered composite at the current viewing level. This algebraic structure provides a technique for organizing composite objects and supporting the materialization of explosion views. From this technique is derived a clustering mechanism that partitions the database into meaningful and application-oriented clusters. The technique also allows any desired explosion view to be materialized using a minimal set of stored views.
ISSN:0098-5589
1939-3520
DOI:10.1109/32.4624