Rule-based schema evolution in object-oriented databases

Date

2003-01-01

Author

Alhajj, R
Polat, Faruk

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

165
views

0
downloads

In this paper, a rule-based mechanism for schema evolution in object-oriented databases is presented. We have benefited from having an object algebra maintaining closure that makes it possible to have the output from a query persistent in the hierarchy. The actual class hierarchy and the corresponding hierarchy which reflects the relationship between operands and results of queries are utilized. In order to have query results reflected into the class hierarchy and classes reflected into the operands hierarchy, we also define mappings between the two hierarchies. As a result, it is possible to maximize reusability in object-oriented databases. The object algebra is utilized to handle basic schema evolution. functions without requiring any special set of built-in functions. The invariants and the conflict resolving rules are specified. It is also shown how other schema functions are derivable from the basic ones.

Subject Keywords

Rule-based systems, Object-oriented data model, Schema evolution, Conflict resolution, Reusability, SYSTEM

URI

https://hdl.handle.net/11511/34392

Journal

KNOWLEDGE-BASED SYSTEMS

DOI

https://doi.org/10.1016/s0950-7051(02)00051-5

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

View maintenance in object-oriented databases Alhajj, R; Polat, Faruk (1996-01-01) In this paper, we present a model that facilitates view maintenance within object-oriented databases. For that purpose, we differentiate between two categories of classes, base classes and brother classes. While the former constitute the actual database, the latter are introduced to hold virtual database, i.e., views derived from base classes. To achieve incremental view update, we introduce a modification list into each base class. A series of algorithms are developed to serve the purpose. Finally it happe...
Confidence-based concept discovery in relational databases Kavurucu, Yusuf; Karagöz, Pınar; Toroslu, İsmail Hakkı (2009-11-16) Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, we improve an ILP-based con...
Fuzzy association rule mining from spatio-temporal data Calargun, Seda Unal; Yazıcı, Adnan (2008-07-03) The use of fuzzy sets in mining association rules from spatio-temporal databases is useful since fuzzy sets are able to model the uncertainty embedded in the meaning of data. There are several fuzzy association rule mining techniques that can work on spatio-temporal data. Their ability to mine fuzzy association rules has to be compared on a realistic scenario. Besides the performance criteria, other criteria that can express the quality of an association rule discovered shall be specified. In this paper, fu...
Concept discovery on relational databases: New techniques for search space pruning and rule quality improvement Kavurucu, Yusuf; Karagöz, Pınar; Toroslu, İsmail Hakkı (Elsevier BV, 2010-12-01) Multi-relational data mining has become popular due to the limitations of propositional problem definition in structured domains and the tendency of storing data in relational databases. Several relational knowledge discovery systems have been developed employing various search strategies, heuristics, language pattern limitations and hypothesis evaluation criteria, in order to cope with intractably large search space and to be able to generate high-quality patterns. In this work, we introduce an ILP-based c...
Using object-oriented materialized views to answer selection-based complex queries Alhajj, R; Polat, Faruk (1999-09-01) Presented in this paper is a model that utilizes existing materialized views to handle a wide range of complex selection-based queries, including linear recursive queries. Such queries are complex because it is almost impossible for naive users to predict the formulation of their predicate expressions. Object variables bound to objects in the result of a query are allowed to appear in the predicate of that query. Also, the predicate definition is extended to make it possible to have in the output only a sub...

Citation Formats

R. Alhajj and F. Polat, “Rule-based schema evolution in object-oriented databases,” KNOWLEDGE-BASED SYSTEMS, pp. 47–57, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34392.