AUTOMATED QUERY PATH REPORTING IN DISTRIBUTED DATABASES

• US 20100094862A1
• Filed: 10/09/2008
• Published: 04/15/2010
• Est. Priority Date: 10/09/2008
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Dantressangle, Patrick, Vyvyan, David R., Bent, Graham A.
• Granted Patent: US 8,285,710 B2
• Time in Patent Office: Days
• US Class Current: 707/716
• CPC Class Codes: G06F 16/2471 Distributed queries

Abstract

A database query comprising a logical table definition and at least one route tracing indicator is forwarded to at least one distributed database node within a distributed network of databases. At least one query response is received including distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response. The received distributed route tracing information is processed to characterize query route propagation within the distributed network of databases. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Claims

1. A method, comprising:

forwarding a database query comprising a logical table definition and at least one route tracing indicator to at least one distributed database node within a distributed network of databases;

receiving at least one query response comprising distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response; and

processing the received distributed route tracing information to characterize query route propagation within the distributed network of databases.

2. The method of claim 1, further comprising identifying local route tracing information based upon the at least one route tracing identifier, combining the identified local route tracing information with the distributed route tracing information of the at least one query response, and returning the at least one query response to at least one of a distributed database node and an application-level module.

3. The method of claim 2, where identifying the local route tracing information based upon the at least one route tracing indicator further comprises mapping the database query into a database count query and executing the database count query against a local database.

4. The method of claim 1, where the received distributed route tracing information further comprises at least one of a query depth, a row count, and a path precedence indicator associated with each distributed database node that processed the database query.

5. The method of claim 1, where forwarding the database query is performed in response to receiving the database query from a first distributed database node and further comprising:

assigning local first arrival precedence information associated with the first distributed database node to the local route tracing information; and

assigning a first query path depth associated with receipt of the database query from the first distributed database node as a shortest query path depth.

6. The method of claim 5, further comprising:

receiving the database query from a second distributed database node different from the first distributed database node; and

determining a second query path depth associated with receipt of the database query from the second distributed database node.

7. The method of claim 6, further comprising determining whether the second query path depth is different from the shortest query path depth.

8. The method of claim 7, further comprising:

assigning local second arrival precedence information to the local route tracing information based upon whether the second query path depth is different from the shortest query path depth; and

assigning the second query path depth as the shortest query path depth upon a determination that the second query path depth is smaller than the shortest query path depth.

9. The method of claim 1, where the received distributed route tracing information further comprises distributed arrival precedence information indicating that the database query was received by the at least one distributed database node from more than one distributed database path and a query path depth indication associated with each of the more than one distributed database path.

10. The method of claim 1, where processing the received distributed route tracing information to characterize query route propagation within the distributed network of databases further comprises aggregating the received distributed route tracing information associated with each distributed database node that processed the database query and translating the aggregated distributed route tracing information into a graphical route tracing representation.

11. A system, comprising:

a memory adapted to store data path query reporting information; and

a processor programmed to;

forward a database query comprising a logical table definition and at least one route tracing indicator to at least one distributed database node within a distributed network of databases;

receive at least one query response comprising distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response;

process the received distributed route tracing information to characterize query route propagation within the distributed network of databases; and

store the processed distributed route tracing information to the memory.

12. The system of claim 11, where the processor is further programmed to identify local route tracing information based upon the at least one route tracing identifier, combine the identified local route tracing information with the distributed route tracing information of the at least one query response, and return the at least one query response to at least one of a distributed database node and an application-level module.

13. The system of claim 12, where the processor is further programmed to map the database query into a database count query and executing the database count query against a local database.

14. The system of claim 11, where the processor is further programmed to receive, in association with the received distributed route tracing information, at least one of a query depth, a row count, and a path precedence indicator associated with each distributed database node that processed the database query.

15. The system of claim 11, where the processor is further programmed to receive the database query from a first distributed database node and to:

assign local first arrival precedence information associated with the first distributed database node to the local route tracing information; and

assign a first query path depth associated with receipt of the database query from the first distributed database node as a shortest query path depth.

16. The system of claim 15, where the processor is further programmed to:

receive the database query from a second distributed database node different from the first distributed database node; and

determine a second path depth associated with receipt of the database query from the second distributed database node.

17. The system of claim 16, where the processor is further programmed to:

determine whether the second query path depth is different from the shortest query path depth;

assign local second arrival precedence information to the local route tracing information based upon whether the second query path depth is different from the shortest query path depth; and

assign the second query path depth as the shortest query path depth upon a determination that the second query path depth is smaller than the shortest query path depth.

18. The system of claim 11, where the processor is further programmed to:

receive, in association with the received distributed route tracing information, distributed arrival precedence information indicating that the database query was received by the at least one distributed database node from more than one distributed database path and a query path depth indication associated with each of the more than one distributed database path.

19. The system of claim 11, in association with the received distributed route tracing information aggregate the received distributed route tracing information associated with each distributed database node that processed the database query and translate the aggregated distributed route tracing information into a graphical route tracing representation.

20. A system, comprising:

a memory adapted to store data path query reporting information; and

a processor programmed to;

forward a database query comprising a logical table definition and at least one route tracing indicator to at least one distributed database node within a distributed network of databases;

receive at least one query response comprising distributed route tracing information associated with each distributed database node that processed the database query along a path associated with the at least one query response;

process the received distributed route tracing information to characterize query route propagation within the distributed network of databases;

map the database query into a database count query and executing the database count query against a local database;

identify local route tracing information based upon the at least one route tracing identifier;

receive the database query from a first distributed database node and assign local first arrival precedence information associated with the first distributed database node to the local route tracing information;

assign a first query path depth associated with receipt of the database query from the first distributed database node as a shortest query path depth;

receive the database query from a second distributed database node different from the first distributed database node;

determine a second query path depth associated with receipt of the database query from the second distributed database node;

determine whether the second query path depth is different from the shortest query path depth;

assign local second arrival precedence information to the local route tracing information based upon whether the second query path depth is different from the shortest query path depth;

assign the second query path depth as the shortest query path depth upon a determination that the second query path depth is smaller than the shortest query path depth;

combine the identified local route tracing information with the distributed route tracing information of the at least one query response;

store the combined route tracing information to the memory; and

return the at least one query response to at least one of a distributed database node and an application-level module.