METHOD AND SYSTEM FOR PROCESSING DATA QUERIES
First Claim
1. A method of processing a query on a data set stored on a plurality of nodes, the method including the steps of:
- dividing the query into one or more atoms which define individual queries on the data set;
calculating the execution cost of each atom in the query;
determining one or more query paths which set out an order in which one or more atoms are to be executed using said calculated execution costs and interdependence between said atoms;
determining a query execution plan which is a set of said query paths which can be executed in parallel;
executing said atoms on each of said nodes in accordance with said query execution plan; and
combining the results of each query path to produce a result set that is the answer to said query.
2 Assignments
0 Petitions
Accused Products
Abstract
The invention relates to a method and system that provide a high performance and extremely scalable triple store within the Resource Description Framework (or alternative data models), with optimized query execution. An embodiment of the invention provides a data storage and analysis system to support scalable monitoring and analysis of business processes along multiple configurable perspectives and levels of granularity. This embodiment analyses data from processes that have been already executed and from ongoing processes, as a continuous flow of information. This embodiment provides defining and monitoring processes based on no initial domain knowledge about the process and such that the process will be built only from the incoming flow of information. Another embodiment of the invention provides a grid infrastructure that allows storage of data across many grid nodes and distribution of the workload, avoiding the bottleneck represented by constantly querying a database.
173 Citations
25 Claims
-
1. A method of processing a query on a data set stored on a plurality of nodes, the method including the steps of:
-
dividing the query into one or more atoms which define individual queries on the data set; calculating the execution cost of each atom in the query; determining one or more query paths which set out an order in which one or more atoms are to be executed using said calculated execution costs and interdependence between said atoms; determining a query execution plan which is a set of said query paths which can be executed in parallel; executing said atoms on each of said nodes in accordance with said query execution plan; and combining the results of each query path to produce a result set that is the answer to said query. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A system for storing business process data, the system having a plurality of nodes which are connected to each other via a network, each node having a data storage and a data processing device, wherein:
-
the system stores business process data as a data set in a distributed fashion on the data storages of the plurality of nodes; and the data processing device of each node is arranged to processing a query on the data set by; dividing the query into one or more atoms which define individual queries on the data set; calculating the execution cost of each atom in the query; determining one or more query paths which set out an order in which one or more atoms are to be executed using said calculated execution costs and interdependence between said atoms; determining a query execution plan which is a set of said query paths which can be executed in parallel; executing said atoms on each of said nodes in accordance with said query execution plan; combining the results of each query path to produce a result set that is the answer to said query. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25)
-
Specification