On the Selection of Optimal Index Configuration in OO Databases

An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. The authors present an algorithm which is able to select an optimal index configuration for a given path. The authors consider a limited number of existing indexing techniques (simple index, inherited index, nested inherited index, multi-index, and multi-inherited index) but the principles of the algorithm remain the same adding more indexing technique

On a Graph-Based Semantics for UML Class and Object Diagrams

In this paper we propose a formal extension of type graphs with notions that are commonplace in the UML and have long proven their worth in that context: namely, inheritance, multiplicity, containment and the like. We believe the absence of a comprehensive and commonly agreed upon formalisation of these notions to be an important and, unfortunately, often ignored omission. Since our eventual aim (shared by many researchers) is to give unambiguous, formal semantics to the UML using the theory of graphs and graph transformation, in this paper we propose a set of definitions to repair this omission. With respect to previous work in this direction, our aim is to arrive at more comprehensive and at the same time simpler definitions.\u

An integrated ranking algorithm for efficient information computing in social networks

Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.Comment: 14 pages, International Journal on Web Service Computing (IJWSC), Vol.3, No.1, March 201

Visual exploration and retrieval of XML document collections with the generic system X2

This article reports on the XML retrieval system X2 which has been developed at the University of Munich over the last five years. In a typical session with X2, the user first browses a structural summary of the XML database in order to select interesting elements and keywords occurring in documents. Using this intermediate result, queries combining structure and textual references are composed semiautomatically. After query evaluation, the full set of answers is presented in a visual and structured way. X2 largely exploits the structure found in documents, queries and answers to enable new interactive visualization and exploration techniques that support mixed IR and database-oriented querying, thus bridging the gap between these three views on the data to be retrieved. Another salient characteristic of X2 which distinguishes it from other visual query systems for XML is that it supports various degrees of detailedness in the presentation of answers, as well as techniques for dynamically reordering and grouping retrieved elements once the complete answer set has been computed

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