Database query system and method

• US 20030074352A1
• Filed: 04/26/2002
• Published: 04/17/2003
• Est. Priority Date: 09/27/2001
• Status: Abandoned Application

• Current Assignee: Northrop Grumman Systems Corporation (Northrop Grumman Corporation)
• Original Assignee: Northrop Grumman Systems Corporation (Northrop Grumman Corporation)
• Inventors: Gearon, Paul A., Raboczi, Simon D., Hyland-Wood, David P.
• Application Number:
  US10/134,069
• Publication Number:
  US 20030074352A1
• Time in Patent Office: Days
• US Class Current: 707/4
• CPC Class Codes: G06F 16/2471 Distributed queries

Abstract

A secure distributed database management query system is disclosed. One or more knowledge stores hold data in the form of statements that represent relationships between nodes in a directed graph data structure. The statements in the database may include security information in the form of statements specifying which users are allowed access at a statement level. A query may include a FROM clause that denotes a multiplicity of knowledge stores that can be queried simultaneously.

Claims

1. A distributed database management query method for processing a query, comprising the steps of:

receiving a query, the query including a designation of a plurality of databases to be queried, each of the databases holding data in the form of statements that represent relationships between nodes in a directed graph data structure;

splitting the query into subqueries;

providing each subquery to one of the plurality of databases;

at each database, processing the subquery to produce an intermediate result that satisfies the subquery; and

combining the set of intermediate results to produce a result for the query.

2. The method of claim 1 wherein each query is a query against a set of statements and the query is composed of set operations and labelled sets of statements.

3. A distributed database management query method for processing a query, comprising the steps of:

providing a plurality of databases, each of the databases holding data in the form of statements that represent relationships between nodes in a directed graph data structure;

receiving a query, the query including a designation of which of the plurality of databases are to be queried;

splitting the query into subqueries;

providing each subquery to one of the plurality of databases as specified in the query;

at each database that receives a subquery, processing the subquery to produce an intermediate results that satisfies the subquery; and

combining the set of intermediate results to produce a result for the query.

4. A distributed database management query system for processing a query, comprising:

a plurality of database servers, each of the database servers including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure;

means for receiving a query, the query including a designation of which of the plurality of database servers are to be queried; and

a query engine communicatively coupled to each of the plurality of database servers, the query engine splitting the query into subqueries and providing each subquery to one of the plurality of database servers in accordance with the query;

wherein, each database server that receives a subquery processes the subquery to produce an intermediate result that satisfies the subquery and provides the intermediate result to the query engine, and the query engine combines the set of intermediate results to produce a result for the query.

5. The system of claim 4 wherein each query is a query against a set of statements and the query is composed of set operations and labelled sets of statements.

6. The system of claim 4, wherein each database further comprises statements that comprise security information.

7. A secure, distributed database management query method for processing a query, comprising the steps of:

receiving a query, the query including a designation of a plurality of database servers to be queried, each of the database servers including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure, the data including security information in the form of statements specifying which users are allowed access at a statement level;

splitting the query into subqueries;

providing each subquery to one of the plurality of database servers;

at each database server, processing the subquery to produce an intermediate result that satisfies the subquery and complies with the security information; and

combining the set of intermediate results to produce a result for the query.

8. A secure distributed database management query system for processing a query, comprising:

a plurality of database servers, each of the database servers including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure, the data including security information in the form of statements specifying which users are allowed access at a statement level;

means for receiving a query, the query including a designation of which of the plurality of database servers are to be queried; and

a query engine communicatively coupled to each of the plurality of database servers, the query engine splitting the query into subqueries and providing each subquery to one of the plurality of database servers;

wherein, each database server that receives a subquery processes the subquery to produce an intermediate result that satisfies the subquery and complies with the security information, and provides the intermediate results to the query engine, and the query engine combines the set of intermediate results to produce a result for the query.

11. The method of claim 8, wherein the step of processing the query to produce a result that satisfies the query and complies with the security condition further comprises the steps of:

ascertaining a first set of statements in the database that satisfies the query formulated by the user;

ascertaining a second set of statements in the database that satisfies the security condition in accordance with the security information in the database; and

intersecting the first set of statements and the second set of statements to produce the result.

9. A secure database management query method for processing a query, comprising the steps of:

providing a knowledge store including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure, the data including security information in the form of statements specifying which users are allowed access at a statement level;

receiving a query;

at the knowledge store, processing the query to produce a result that satisfies the query and complies with the security information; and

outputting the result for the query.

10. A secure database management query method for processing a query, comprising the steps of:

providing a knowledge store including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure, the data including security information in the form of statements specifying which users are allowed access at a statement level;

receiving a query from a user requesting information in the database;

modifying the query to include a security condition associated with the user;

at the knowledge store, processing the query to produce a result that satisfies the query and complies with the security condition; and

outputting the result for the query.

12. A secure database management query system for processing a query, comprising:

a knowledge store including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure, the data including security information in the form of statements specifying which users are allowed access to statements at a statement level; and

means for processing the query to produce a set of statements that satisfy the query and comply with the security information.

13. The system of claim 12 wherein each query is a query against a set of statements in a knowledge store and the query is composed of set operations and labelled sets of statement.

14. The system of claim 12 wherein the database comprises a database of metadata.

15. The system of claim 14 further comprising:

one or more data sources; and

a metadata extractor communicatively coupled to the one or more data sources and the knowledge store, wherein the metadata extractor extracts metadata from the data in the one or more data sources and provides the extracted metadata to the knowledge store.

16. The system of claim 15 further comprising a full text engine communicatively intercoupling the one or more data sources and the knowledge store.

17. A database management query system for processing a query, comprising:

a knowledge store including a database holding data in the form of statements that represent relationships between nodes in a directed graph data structure; and

means for processing the query to produce a set of statements that satisfy the query,

wherein each query is a query against the set of statements in a knowledge store and the query is composed of set operations and labelled sets of statement.