Network database access system to which builds a table tree in response to a relational query

• US 5,581,756 A
• Filed: 03/28/1995
• Issued: 12/03/1996
• Est. Priority Date: 03/27/1991
• Status: Expired due to Fees

• Current Assignee: NEC Corporation
• Original Assignee: NEC Corporation
• Inventors: Nakabayashi, Kazunori
• Primary Examiner(s): AMSBURY, WAYNE P
• Application Number:
  US08/411,923
• Time in Patent Office: 616 Days
• Field of Search: 395/600
• US Class Current: 1/1
• CPC Class Codes: G06F 16/284 Relational databases
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing

Abstract

The database access system of the present invention accesses a hierarchical network type database, treating it as a relational type database. The system analyzes queries in data manipulation language for a relational database which define instructions for retrieval, update, addition and deletion conditions using query analyzing means. According to the analysis result, a record relation tree of the relation among records having the individual fields related to the operation conditions is generated by record relation combining means and stored in storing means. Further, operation conditions are resolved into sets of binary operations using retrieval, update, addition or deletion condition analyzing means so as to generate a condition tree having the operators used in the binary operations as nodes. The access module generating means generates access modules for access to a hierarchical database file based on the record relation tree and condition tree and the access executing means executes accessing based on these access modules.

Claims

1. A database access system which treats a network type database file as a relational type database file, comprising:

input means for inputting a query in a data manipulation language for a relational database;

query analyzing means for analyzing said query input at said input means;

relation record combining means for generating a record relation tree prescribing relations among records when said query is for table definition;

data operation condition analyzing means for resolving specified data operation conditions into sets of binary operations and generating condition trees having binary operators constituting the binary operations as nodes when said query is a data operation request;

access module generating means for generating access modules prescribing conditions and access procedures for access to said hierarchical network type database file by adding said condition trees to said record relation tree according to predetermined rules;

access module executing means for analyzing said access modules one by one and executing the access procedures; and

output means for outputting the execution result of the access module executing means.

2. A database access system of claim 1 provided with a record relation tree storing means to store the record relation trees generated by said relation record combining means.

3. A database system of claim 1 wherein said data operation condition analyzing means is a retrieval condition analyzing means which generates a condition tree based on a retrieval request query.

4. A database system of claim 1 wherein said data operation condition analyzing means is an update condition analyzing means which generates a condition tree based on an update request query.

5. A database system of claim 1 wherein said data operation condition analyzing means is an addition condition analyzing means which generates a condition tree based on an addition request query.

6. A database system of claim 1 wherein said data operation condition analyzing means is a deletion condition analyzing means which generates a condition tree based on a deletion request query.

7. A database system as recited in claim 1, wherein said data operation condition analyzing means generates a condition tree including binary operators AND and OR in said data operation conditions, and adds a partial tree of binary operators other than AND and OR under a node of said condition tree.

11. A database access system as recited in claim 7, wherein, when said query is for table definition, said relation record combining means generates the record relation tree according to said query for table definition including a basic record serving as a reference of table definition and relations among records and a data structure defined in said network type database, said record relation tree having the basic record as a root and other records as nodes or leaves.

8. A database access system which treats a network type database file as a relational type database file, comprising:

input means for inputting a query in a data manipulation language for a relational database;

query analyzing means for analyzing said query input at said input means;

relation record combining means for generating a record relation tree prescribing relations among records when said query is for table definition;

record relation tree storing means for storing the generated record relation tree;

data operation condition analyzing means which, when said query is a retrieval, update, addition or deletion request, resolves specified retrieval, update, addition or deletion conditions into sets of binary operations and generates condition trees having binary operators constituting the binary operations as nodes;

access module generating means for generating access modules prescribing conditions and access procedures for access to said network type database file by adding said condition trees to said record relation tree according to predetermined rules;

access module executing means for analyzing said access modules one by one and executing the access procedures; and

output means for outputting the execution result of the access module executing means.

9. A database system of claim 8 wherein said data operation condition analyzing means comprises retrieval condition analyzing means, update condition analyzing means, addition condition analyzing means and deletion condition analyzing means.

10. A database system as recited in claim 8, wherein said data operation condition analyzing means generates a condition tree including binary operators AND and OR, and adds a partial tree of binary operators other than AND and OR under a node of said condition tree.

12. A database access system which treats a network type database file as a relational type database file, comprising:

input means for inputting a query in a data manipulation language for a relational database;

query analyzing means for analyzing said query input at said input means;

relation record combining means for generating a record relation tree prescribing relations among records according to said query for table definition including a basic record serving as a reference of table definition and relations among records and a data structure defined in said network type database when said query is for table definition, said record relation tree having the basic record as a root and other records as nodes or leaves;

data operation condition analyzing means for resolving specified data operation conditions into sets of binary operations and generating condition trees having binary operators constituting the binary operations as nodes when said query is a data operation request;

access module generating means for generating access modules prescribing conditions and procedures for access to said network type database file by adding said condition trees to said record relation tree according to predetermined rules;

access module executing means for analyzing said access modules one by one and executing the access procedures; and

output means for outputting the execution result of the access module executing means.