Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing States of the Art and Practice - SAC '93 1993
DOI: 10.1145/162754.162807
|View full text |Cite
|
Sign up to set email alerts
|

Object-oriented schema extension and abstraction

Abstract: An algorithm is presented that abstracts out the "largest" common substructure of two given objectoriented class structures. This abstraction algorithm is based on two concepts: (1) a mathematical formulation of extension for class structures containing part-of and inheritance relationships, and (2) a definition of similarity on the class level. The algorithm shows how class structures can be optimized with respect to the extension relation, and how it can be used to abstract out a candidate parameterized clas… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1993
1993
1997
1997

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…The semantics formally defines the order of wrapper execution for prefix and suffix wrappers. The feasibility of the evolution framework is demonstrated for a representative set of primitive class structure transformations, mainly based on the extension relations identified in [12], [18]. Such extension relations are useful means for quality control of schema transformations.…”
Section: Related Researchmentioning
confidence: 99%
“…The semantics formally defines the order of wrapper execution for prefix and suffix wrappers. The feasibility of the evolution framework is demonstrated for a representative set of primitive class structure transformations, mainly based on the extension relations identified in [12], [18]. Such extension relations are useful means for quality control of schema transformations.…”
Section: Related Researchmentioning
confidence: 99%