AUTOMATED QUERY PATH REPORTING IN DISTRIBUTED DATABASES
First Claim
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.
1 Assignment
0 Petitions
Accused Products
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.
-
Citations
20 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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
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; andstore the processed distributed route tracing information to the memory. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19)
-
-
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.
-
Specification