Mining Multiple Related Tables Using Object-Oriented Model

An object-oriented database is represented by a set of classes connected by their class inheritance hierarchy through superclass and subclass relationships. An object-oriented database is suitable for capturing more details and complexity for real world data. Existing algorithms for mining multiple databases are either Apriori-based or machine learning techniques, but are not suitable for mining multiple object-oriented databases. This thesis proposes an object-oriented class model and database schema, and a series of class methods including that for object-oriented join ( OOJoin) which joins superclass and subclass tables by matching their type and super type relationships, mining Hierarchical Frequent Patterns ( MineHFPs) from multiple integrated databases by applying an extended TidFP technique which specifies the class hierarchy by traversing the multiple database inheritance hierarchy. This thesis also extends map-gen join method used in TidFP algorithm to oomap-gen join for generating k-itemset candidate pattern to reduce the candidate itemset generation by indexing the (k-1)-itemset candidate pattern using two position codes of start position and end position codes tied to inheritance hierarchy level. Experiments show that the proposed MineHFPs algorithm for mining hierarchical frequent patterns is more effective and efficient for complex queries

Object-oriented database management system case study for declarative query language

Object-Oriented database management systems (OODBMS) combine the abstraction power of objects with the query and performance capabilities of database management systems. Existing query notations were missing many object related features until recently. The introduction of a new query notation, known by Object Comprehensions, allows queries to be expressed clearly and processed efficiently. Our work is to establish a testbed for the processing of Object Comprehension Language (OCL) queries using an experimented object-oriented database, Ode. This thesis overviews object-oriented databases evolution, and object query processing, then introduces an object-oriented database system, Ode, whose programming language O\sp{++} is based on C\sp{++}. A university data model is built using O\sp{++}, stored into the Ode database, and utilities, such as bag, list and set, are written to support the processing of OCL queries. The translation of OCL queries into O\sp{++} is not part of this thesis, but is part of a related project

Query Modification in Object-oriented Database Federation

We discuss the modification of queries against an integrated view in a federation of object-oriented databases. We present a generalisation of existing algorithms for simple global query processing that works for arbitrarily defined integration classes. We then extend this algorithm to deal with object-oriented features such as queries involving path expressions and nesting. We show how properties of the OO-style of modelling relationships through object references can be exploited to reduce the number of subqueries necessary to evaluate such querie

Towards Intelligent Databases

This article is a presentation of the objectives and techniques of deductive databases. The deductive approach to databases aims at extending with intensional definitions other database paradigms that describe applications extensionaUy. We first show how constructive specifications can be expressed with deduction rules, and how normative conditions can be defined using integrity constraints. We outline the principles of bottom-up and top-down query answering procedures and present the techniques used for integrity checking. We then argue that it is often desirable to manage with a database system not only database applications, but also specifications of system components. We present such meta-level specifications and discuss their advantages over conventional approaches