发明名称 Method and system for processing data queries
摘要 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.
申请公布号 US9639575(B2) 申请公布日期 2017.05.02
申请号 US201213435747 申请日期 2012.03.30
申请人 Khalifa University of Science, Technology and Research;British Telecommunications plc;Emirates Telecommunications Corporation 发明人 Leida Marcello;Afzal Ali;Taylor Paul;Majeed Basim
分类号 G06F17/00;G06F17/30 主分类号 G06F17/00
代理机构 Calfee, Halter & Griswold, LLP 代理人 Calfee, Halter & Griswold, LLP
主权项 1. A method of processing a query on a graph 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 graph 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; wherein the calculation of th execution cost is carried out by determining for each atom, a weight which for an atom i(j,k,l)is W(jj,ki,li)=min{wgt(js),wgt(kp),wgt(lo)}where wgt(xpos) is the number of matching triples with value x in the subject, predicate or object position pos if x is a constant, or the total size of the graph data set if x is a variable, and s, p and o are the subject, predicate and object positions respectively.
地址 Abu Dhabi AE