Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2003-01-14
2004-11-30
Channavajjala, Srirama (Department: 2177)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C345S215000, C345S215000, C345S960000
Reexamination Certificate
active
06826566
ABSTRACT:
FIELD OF THE INVENTION
This invention relates to the field of computers, more particularly to computer information storage and retrieval, and particularly to information organizational structures such as databases.
BACKGROUND
Data access is becoming increasingly important, as the extent of information sources that are available to computers increases with the exponential growth of networks, such as the Internet. Unfortunately, current database designs are inflexible and impose severe demands on user and computing power effort during unplanned queries.
Inflexibilities and high processing demands result from the current structure of known databases. Such structures generally seek to achieve quick access to records within the database by calculating the precise location of the record within the whole database. Inconvenient structural limitations are often imposed to facilitate this common database goal. For example, each record may be required to be the same size. This limitation may be avoided by using pointers, but a pointer structure requires user foresight and decisions at the outset, if database restructuring is to be avoided.
A fixed record size requirement only assures quick access when the record number is known. To have quick access when searching on field values, indexing needs to be performed linking those values with the record ID. In a typical database many index tables are needed. Maintenance of such tables requires an update of all of them whenever anything requires a change in the record identifiers—which in practice happens too often.
Numerous legacy databases need to be integrated with newer database systems. Normally this is done by converting them all to a single, modern relational database. This is an extremely difficult and time-consuming task under present systems, requiring a great deal of work to reconcile the different legacy structures into one new structure. Such integrations often incur extremely large costs, taking a very long time, disrupt business, and yet produce only partly satisfactory outcomes.
Accordingly, there is a need for a method and system that facilitates queries for data from data sources. Because of the wide range of different organizational structures for the data sources that are available to many computers, it is desirable that improved data access be capable of operation across a range of computing platforms and organizational structures.
SUMMARY
In response to the needs identified above, a new approach is described herein that is based on a universal data structure, and is developed and applied to structured databases. Some foundations for this approach may be found in U.S. Pat. No. 5,544,360, (Lewak et al.). Using a generalized Vocabulary of Identifiers (called ItemSelectors) of each data fragment (called Items), this approach will be referred to as software Technology for Information Engineering™ or TIE, and is applicable to most or all information systems. TIE databases eliminate inflexibilities associated with current databases, and reduce processing demands. They allow virtually any number, and any organization, of fields for each record. Moreover, they significantly enhance the effective speed of query responses.
TIE databases typically provide an intuitive Guided Information Access (GIA) interface to the user that is based upon Vocabulary terms. As the user selects presented Vocabulary terms, the portion of the Vocabulary that is presented thereafter may be constrained, dynamically and in real time, by such previous selection, such that only ItemSelectors that will yield viable (non-null) results remain available to be selected. Such dynamic constraints are difficult or impossible to achieve in known technologies.
Associations resulting from choosing ItemSelectors are immediately apparent to the user, are easy to implement and edit, and facilitate search queries. Associations between the Identifiers and the individual data Items (which may be, for example, Records or Linked Records) are organized in a binary matrix that facilitates quick access. With such organization, substantial change in the relationship between fields (or Items), even disruptive changes, typically require a change of data within just one universal data structure, generally implemented in TIE systems as a Universal Matrix Structure (UMS).
The Items in a TIE database may be referenced through a path, URL, or any other suitable identifier. The references themselves may be hidden to avoid confusion. The actual data may be located anywhere that can be accessed by a computing system employing TIE, sometimes even across a Wide Area Network such as the Internet. Such flexible referencing techniques, particularly in combination with a universal structure described further below, facilitates an easy, non-invasive integration of disparate legacy databases. The TIE system permits conversion of legacy databases into a new database structure in an intuitive manner that need not disrupt the legacy system, which can continue to be used in parallel.
REFERENCES:
patent: 5175814 (1992-12-01), Anick et al.
patent: 5428737 (1995-06-01), Li et al.
patent: 5428776 (1995-06-01), Rothfield
patent: 5544360 (1996-08-01), Lewak et al.
patent: 5701456 (1997-12-01), Jacopi et al.
patent: 5721900 (1998-02-01), Banning et al.
patent: 5933145 (1999-08-01), Meek
patent: 5950190 (1999-09-01), Yeager et al.
patent: 5966126 (1999-10-01), Szabo
patent: 6003034 (1999-12-01), Tuli
patent: 6012055 (2000-01-01), Campbell et al.
patent: 6439783 (2002-08-01), Antoshenkov
patent: 2002/0129012 (2002-09-01), Green
Anick et al., “A Direct Manipulation Interface for Boolean Information Retrieval via Natural Language”, Proceeding of the 13th annual International ACM SIGIR conference on Research and Development in Information Retrieval, 1989, pp. 135-150.*
Anick et al., “Adapting a full-text Information Retrieval System to the Computer Troubleshooting Domain”, Proceeding of the 17 annual International ACM SIGIR conference on Research and Development in Information Retrieval, 1994, pp. 349-358.
Lewak Jerzy
Yano Miles Kevin
Boling William C.
Channavajjala Srirama
Jaquez Martin J.
Jaquez & Associates
Pham Khanh
LandOfFree
Identifier vocabulary data access method and system does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Identifier vocabulary data access method and system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Identifier vocabulary data access method and system will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3352444