Query Networks Evaluation System and Method

Abstract

A query network is disclosed, comprising sets of nodes and edges connecting pairs of nodes. The nodes of the query network are associated with edge-defining queries. A method is taught for fully evaluating such a query network. A language is further disclosed for constructing queries. The query network may be used to model a social network, a professional network or the like.

1 . A database apparatus storing a query-network comprising a set of nodes and a set of edges, said edges connecting pairs of said nodes wherein at least a subset of said nodes are each associated with at least one edge-defining query. 
     
     
         2 . The database apparatus of  claim 1  wherein said edge-defining query defines a set of generated-edges to be added to said set of edges. 
     
     
         3 . The database apparatus of  claim 2  wherein said set of generated-edges connect the node associated with said query with another node selected from said set of nodes. 
     
     
         4 . The database apparatus of  claim 2  wherein at least a subset of said nodes are associated with at least one edge-accepting query. 
     
     
         5 . The database apparatus of  claim 4  wherein said edge-accepting query defines a subset of generated-edges to be added to said set of edges. 
     
     
         6 . The database apparatus of  claim 1  wherein said query comprises a datalog rule. 
     
     
         7 . The database apparatus of  claim 1  comprising a plurality of storage units connected to a network. 
     
     
         8 . The database apparatus of  claim 1  wherein said database network contains data pertaining to at least one of a group consisting of: a social network, a professional network, an academic network and an item network. 
     
     
         9 . A method for fully evaluating a query network stored on a database apparatus of  claim 1 , such that all edges defined by said edge-defining queries are members of said set of edges. 
     
     
         10 . The method of  claim 9  comprising the steps:
 step (a)—selecting a node from said subset of said nodes; 
 step (b)—evaluating the selected node according to the edge-defining query associated with said selected node; 
 step (c)—selecting another node from said subset of said nodes and repeating step (b); and 
 step (d)—if all members of said subset of said nodes have been evaluated since a generated-edge was added to said set of edges then terminating said method. 
 
     
     
         11 . The method of  claim 10  wherein said step (b) of evaluating the selected node according to the edge-defining query associated with said selected node, comprises the substeps:
 step (b1)—adding to said set of edges the members of a set of generated-edges defined by the edge-defining query associated with said selected node; 
 step (b2)—if said set of generated-edges of step (b1) is not an empty set, then repeating step (b1); and 
 step (b3)—if said set of generated-edges of step (b1) is an empty set, then selecting another node from said subset of said nodes and repeating step (b). 
 
     
     
         12 . The method of  claim 11  wherein said step (b1) of adding to said set of edges the members of a set of generated-edges defined by the edge-defining query associated with said selected node further comprises validating that the edges are accepted by edge-accepting queries associated with target nodes. 
     
     
         13 . The method of  claim 10  wherein said step (c) of selecting another node from said subset of said nodes and repeating step (b), comprises the substeps:
 step (c1)—generating a subset of nodes which are connected to the previously selected node via a path containing less edges than the maximal radius of the query network; and 
 step (c2)—selecting a member of said subset. 
 
     
     
         14 . The method of  claim 9  comprising:
 step (I)—partitioning said query network into a plurality of query sub-networks; 
 step (II)—fully evaluating each said query sub-network; and 
 step (III)—merging said query sub-networks. 
 
     
     
         15 . A method for selecting a group from said query network stored on a database apparatus of  claim 1 , said group comprising a set of nodes which are evaluated according to an edge-defining query associated with a selected node. 
     
     
         16 . A method for selecting a path from said query network stored on a database apparatus of  claim 1 , said path comprising a set of edges which are used in an evaluation of an edge-defining query associated with a selected node. 
     
     
         17 . A method for creating connections between nodes on a network stored on a database apparatus of  claim 1 , wherein said connections are formed between nodes that comprise a selected path or a selected group evaluated according to an edge-defining query associated with a selected node.