Identifier vocabulary data access method and system
AssigneeSpeedTrack, Inc.
InventorsJerzy Lewak, Miles Kevin Yano
Life of this patent
Estimating the term…
Loading patent…
AssigneeSpeedTrack, Inc.
InventorsJerzy Lewak, Miles Kevin Yano
Estimating the term…
A method of organizing, managing, and providing interactive access to data in a database is disclosed, along with a program and a system for implementing the method. Associations between each data Item and at least one ItemSelector are established and stored. A predefined (but modifiable) Vocabulary of ItemSelectors sufficient to describe each Item of the database is created. Presently selected Items are described by a combination of associations defined by an appropriate Boolean combination of each ItemSelector in a presently selected set of ItemSelectors. A user controls the presently selected set by adding an ItemSelector from a presented group, or by removing a previously selected ItemSelector. The system ideally makes available to the user all relevant ItemSelectors—those which, if added to the presently selected set, would result in a set that describes at least one extant data Item. The system ideally makes all presently selected Items available to the user.
A method of creating a Boolean expression for identifying data Items in a database, comprising:
A method of interactively creating a Boolean expression for identifying data Items in a database, the method comprising:
A computer program for implementing interactive procedures to aid a user searching for predefined data Items, the data Items existing in a database and being preassociated with one or more of a predefined vocabulary of ItemSelectors, the program configured to direct a computer system to perform operations comprising:
Dependencies are inferred from the claim text.
From the US filing history. Foreign family members aren’t listed.
Backward citations are indexed for grants only.
Querying: query formulation
Querying: query formulation
Query formulation: iterative querying; Query formulation based on the results of a preceding query
Query processing, i.e. searching: query formulation, input preparation, or translation
Term end not estimated
Drawings are temporarily unavailable. Open the PDF at USPTO
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.
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.
FIG. 1 is a block diagram showing typical information flow in a TIE system.
FIG. 2 illustrates derivation of a Boolean expression from ItemSelectors in groups.
FIG. 3 illustrates Boolean derivation for ItemSelectors differing from those of FIG. 2.
Introduction
Extremely flexible databases can be achieved by employing a universal matrix structure (“UMS”). For background on such structures, see U.S. Pat. No. 5,544,360 (Lewak et al.) (“the '360 patent”).
In TIE (Technology for Information Engineering™) system databases described herein, each element of information is called an Item, and each Item has its own unique identifier (typically an ID number). Each Item may be described using a set of one or more descriptors (ItemSelectors), each of which represents an attribute of the Item. Some combination of meaningful ItemSelectors (which may be key words, phrases, or other descriptors, each uniquely identified within the system), will suffice to distinguish a particular Item within the constellation of Items available in a database. Such meaningful descriptive key words or phrases may therefore be used to select an Item. The meaningful descriptive key words or phrases will be referred to as “ItemSelectors.” (Note that in the Provisional Application upon which this application is based, these key words or phrases were referred to as “Categories.” The terminology is substantially arbitrary, and, though different, is internally consistent within each document.) As with any search, a set of ItemSelectors will typically describe a first set of Items consistent therewith. One or more additional ItemSelectors may be needed to uniquely describe a single Item from the first set of Items. Conversely, Items may be described as belonging to, or associated with, one or more ItemSelectors.