Relational query of a hierarchical database

Abstract

Relational queries to a hierarchical database having data tables are rapidly processed. A bridging table is created to transform a many to many relationship into a plurality of one to many relationships. The bridging table is stored on a custom semiconductor chip which parses the query and determines by use of the bridging table which records in the data tables match the query using a custom data algorithm stored on the semiconductor chip. For each match, a pointer to a target record in the hierarchical database is stored. Instructions executed on the custom chip read the pointers or the target records and transfer these to the query requester.

Description

technical field [0001] The present invention relates to methods and systems for accessing hierarchical databases, and in particular to accessing these databases using relational queries. Even more particularly, the present invention relates to a mechanism for rapidly accessing a hierarchical database upon receipt of a relational query from a requester and rapidly returning to the requester those target records identified by the relational query. Background technique [0002] Hierarchical databases are used by many corporations and governments to acquire and retrieve data associated with transactions, particularly commercial transactions conducted by corporations or government entities. Hierarchical databases use a hierarchical schema to store information known as parent / child models. A hierarchical schema can be represented as a tree structure, where each parent node can have multiple child nodes, and each child node can have only one parent node. [0003] Another commonly...

AI Technical Summary

Problems solved by technology

[0007] While the approach described by Hoth provides the desired capability, it is often slow in terms of response time due to the overhead required in forming the bridge table and in passing the query response to the client

Images