Browse Prior Art Database

A Data Base Indexed by Multiple Aliases per Data Base Entry

IP.com Disclosure Number: IPCOM000040956D
Original Publication Date: 1987-Apr-01
Included in the Prior Art Database: 2005-Feb-02
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Moldover, AD: AUTHOR

Abstract

This system is designed for efficient accessing of data using criteria that are independent of the data base organization. It can be used to create a schedule display that properly maps appointments which span multiple days or cross a date boundary.

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

Page 1 of 1

A Data Base Indexed by Multiple Aliases per Data Base Entry

This system is designed for efficient accessing of data using criteria that are independent of the data base organization. It can be used to create a schedule display that properly maps appointments which span multiple days or cross a date boundary.

In many data base systems the user can retrieve items that match a key field in the data. This is frequently done by making a list (index) of values found in the key field and assigning a record number or retrieval identifier as a function value for each key in the index.

The multiple-alias system is different in that the retrieval index contains values that are not found in the key field of a data base record. Instead, the index contains aliases for the value of the key that are more appropriate to the data base application. Each alias in the index serves as an argument for a retrieval function that returns an actual value for the key field of a specific data base record. As records are added to the data base, each one is analyzed by an algorithm to determine the values that should be added to the alias index for future retrieval.

A simple example is a calendar data base. The key field for each calendar entry would be its creation time-stamp. This is a unique identifier for each record. The retrieval index would consist of a series of arguments, each of which would return the time-stamp value as its function. The arguments would be date/time values. Each entry to be indexed wou...