Indexing techniques for object-oriented databases.

by Frank Hing-Wah Luk.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.Includes bibliographical references (leaves 92-95).Abstract --- p.iiAcknowledgement --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Motivation --- p.1Chapter 1.2 --- The Problem in Object-Oriented Database Indexing --- p.2Chapter 1.3 --- Contributions --- p.3Chapter 1.4 --- Thesis Organization --- p.4Chapter 2 --- Object-oriented Data Model --- p.5Chapter 2.1 --- Object-oriented Data Model --- p.5Chapter 2.2 --- Object and Object Identifiers --- p.6Chapter 2.3 --- Complex Attributes and Methods --- p.6Chapter 2.4 --- Class --- p.8Chapter 2.4.1 --- Inheritance Hierarchy --- p.8Chapter 2.4.2 --- Aggregation Hierarchy --- p.8Chapter 2.5 --- Sample Object-Oriented Database Schema --- p.9Chapter 3 --- Indexing in Object-Oriented Databases --- p.10Chapter 3.1 --- Introduction --- p.10Chapter 3.2 --- Indexing on Inheritance Hierarchy --- p.10Chapter 3.3 --- Indexing on Aggregation Hierarchy --- p.13Chapter 3.4 --- Indexing on Integrated Support --- p.16Chapter 3.5 --- Indexing on Method Invocation --- p.18Chapter 3.6 --- Indexing on Overlapping Path Expressions --- p.19Chapter 4 --- Triple Node Hierarchy --- p.23Chapter 4.1 --- Introduction --- p.23Chapter 4.2 --- Triple Node --- p.25Chapter 4.3 --- Triple Node Hierarchy --- p.26Chapter 4.3.1 --- Construction of the Triple Node Hierarchy --- p.26Chapter 4.3.2 --- Updates in the Triple Node Hierarchy --- p.31Chapter 4.4 --- Cost Model --- p.33Chapter 4.4.1 --- Storage --- p.33Chapter 4.4.2 --- Query Cost --- p.35Chapter 4.4.3 --- Update Cost --- p.35Chapter 4.5 --- Evaluation --- p.37Chapter 4.6 --- Summary --- p.42Chapter 5 --- Triple Node Hierarchy in Both Aggregation and Inheritance Hierarchies --- p.43Chapter 5.1 --- Introduction --- p.43Chapter 5.2 --- Preliminaries --- p.44Chapter 5.3 --- Class-Hierarchy Tree --- p.45Chapter 5.4 --- The Nested CH-tree --- p.47Chapter 5.4.1 --- Construction --- p.47Chapter 5.4.2 --- Retrieval --- p.48Chapter 5.4.3 --- Update --- p.48Chapter 5.5 --- Cost Model --- p.49Chapter 5.5.1 --- Assumptions --- p.51Chapter 5.5.2 --- Storage --- p.52Chapter 5.5.3 --- Query Cost --- p.52Chapter 5.5.4 --- Update Cost --- p.53Chapter 5.6 --- Evaluation --- p.55Chapter 5.6.1 --- Storage Cost --- p.55Chapter 5.6.2 --- Query Cost --- p.57Chapter 5.6.3 --- Update Cost --- p.62Chapter 5.7 --- Summary --- p.63Chapter 6 --- Decomposition of Path Expressions --- p.65Chapter 6.1 --- Introduction --- p.65Chapter 6.2 --- Configuration on Path Expressions --- p.67Chapter 6.2.1 --- Single Path Expression --- p.67Chapter 6.2.2 --- Overlapping Path Expressions --- p.68Chapter 6.3 --- New Algorithm --- p.70Chapter 6.3.1 --- Example --- p.72Chapter 6.4 --- Evaluation --- p.75Chapter 6.5 --- Summary --- p.76Chapter 7 --- Conclusion and Future Research --- p.77Chapter 7.1 --- Conclusion --- p.77Chapter 7.2 --- Future Research --- p.78Chapter A --- Evaluation of some Parameters in Chapter5 --- p.79Chapter B --- Cost Model for Nested-Inherited Index --- p.82Chapter B.1 --- Storage --- p.82Chapter B.2 --- Query Cost --- p.84Chapter B.3 --- Update --- p.84Chapter C --- Algorithm constructing a minimum auxiliary set of J Is --- p.87Chapter D --- Estimation on the number of possible combinations --- p.89Bibliography --- p.9

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

Innovative Evaluation System – IESM: An Architecture for the Database Management System for Mobile Application

As the mobile applications are constantly facing a rapid development in the recent years especially in the academic environment such as student response system [1-8] used in universities and other educational institutions; there has not been reported an effective and scalable Database Management System to support fast and reliable data storage and retrieval. This paper presents Database Management Architecture for an Innovative Evaluation System based on Mobile Learning Applications. The need for a relatively stable, independent and extensible data model for faster data storage and retrieval is analyzed and investigated. It concludes by emphasizing further investigation for high throughput so as to support multimedia data such as video clips, images and documents

Digital Image Access & Retrieval

The 33th Annual Clinic on Library Applications of Data Processing, held at the University of Illinois at Urbana-Champaign in March of 1996, addressed the theme of "Digital Image Access & Retrieval." The papers from this conference cover a wide range of topics concerning digital imaging technology for visual resource collections. Papers covered three general areas: (1) systems, planning, and implementation; (2) automatic and semi-automatic indexing; and (3) preservation with the bulk of the conference focusing on indexing and retrieval.published or submitted for publicatio

Event Indexing Systems for Efficient Selection and Analysis of HERA Data

The design and implementation of two software systems introduced to improve the efficiency of offline analysis of event data taken with the ZEUS Detector at the HERA electron-proton collider at DESY are presented. Two different approaches were made, one using a set of event directories and the other using a tag database based on a commercial object-oriented database management system. These are described and compared. Both systems provide quick direct access to individual collision events in a sequential data store of several terabytes, and they both considerably improve the event analysis efficiency. In particular the tag database provides a very flexible selection mechanism and can dramatically reduce the computing time needed to extract small subsamples from the total event sample. Gains as large as a factor 20 have been obtained.Comment: Accepted for publication in Computer Physics Communication

Logic Programming Applications: What Are the Abstractions and Implementations?

This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations