Browse Prior Art Database

Method for Modifying Database Queries

IP.com Disclosure Number: IPCOM000045533D
Original Publication Date: 1983-Apr-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 2 page(s) / 13K

Publishing Venue

IBM

Related People

Pullin, DJ: AUTHOR [+2]

Abstract

This article describes a method for modifying any query defined over a binary relational database. The mechanism gives a user the capability to specify arbitrary query operations without knowledge of a query language.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 54% of the total text.

Page 1 of 2

Method for Modifying Database Queries

This article describes a method for modifying any query defined over a binary relational database. The mechanism gives a user the capability to specify arbitrary query operations without knowledge of a query language.

A binary relational database contains sets of simple data items and named binary relationships between these sets. It may he represented by a directed graph in which each node represents a set of items stored in the database and each arc represents a relationship between two sets, or between a set and itself
. Thus, each arc has a source node and a target node, which may he named, and has a defined mapping which is one of the following; many to many. many to one, one to one.

A query may be defined as a regular, structured collection of data items which has been extracted from such a database. A query is therefore analogous to a file of data records, and may have one of the following forms: normalized tabular, unnormalized tabular, hierarchical.

Any query may be extracted from a database by a process which is described in terms of operations on the graph representing the database structure:
A. Choose some node, n, from the graph as the starting point of a

database search.
B. Choose an arbitrary connected subgraph, containing n, which

defines the required search path through the database.
C. Taking each data item in the set corresponding to n in turn,

search the entire subgraph to find related data items.
D. Apply selection criteria to the resultant collection of data

items.

Thus, each node in the subgraph corresponds to column in the resulting query; each collection o...