Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Integration Models: Templates for Business Transformation
Integration Models: Templates for Business Transformation
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
Metapattern: Context and Time in Information Models
Metapattern: Context and Time in Information Models
Generating DB Queries for Web NL Requests Using Schema Information and DB Content
NLDB'01 Proceedings of the 6th International Workshop on Applications of Natural Language to Information Systems
Many-Dimensional Schema Modeling
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Component development and construction for database design
Data & Knowledge Engineering - Special issue: ER 2002
Component-driven engineering of database applications
APCCM '06 Proceedings of the 3rd Asia-Pacific conference on Conceptual modelling - Volume 53
Engineering database component ware
TEAA'06 Proceedings of the 2nd international conference on Trends in enterprise application architecture
Complete Conceptual Schema Algebras
Fundamenta Informaticae
| Hi-index | 0.00 |
Practical experience shows that the maintenance of databases with a very large schema causes severe problems, and no systematic support is provided. In a recent study based on the analysis of a large number of very large database schemata twelve frequently recurring meta-structures were identified and classified into three categories associated with schema construction, lifespan and context. The systematic use of these meta-structures supports the modelling and maintenance of very large database schemata. In this paper we complement this study by a schema algebra that permits building larger schemata by composing smaller ones. Similar to abstraction mechanisms found in semantic data models the constructors can be classified into three groups for building associations and collections of subschemata, and for folding subschemata.