Method for aggregation of a graph using fourth generation structured query language (SQL)
First Claim
Patent Images
1. A method of aggregating scalars associated with nodes in a directed acyclic graph, at least some of the nodes having associated parent and descendant nodes, said method comprised of:
- i) compiling a list of nodes in said directed acyclic graph and scalar values associated with said nodes;
ii) compiling a list of edges in said directed acyclic graph;
iii) generating a transitive closure table using a fourth generation structured query language process;
iv) aggregating scalars associated from at least one node in said directed acyclic graph from said transitive closure table by;
a) identifying all entries in said table wherein said predetermined node is a parent;
b) compiling descendant nodes of parent nodes;
c) for each descendant node, aggregating scalar values associated with each descendant node.
7 Assignments
0 Petitions
Accused Products
Abstract
Fourth generation structured query languages can be used to aggregate scalars associated with the nodes of a directed acyclic graph. Node tables, edge tables, and a transitive closure table can be used to perform these aggregate operations. The invention provides a declarative methodolgy for calculating values associated with the node of a directed acyclic graph.
-
Citations
10 Claims
-
1. A method of aggregating scalars associated with nodes in a directed acyclic graph, at least some of the nodes having associated parent and descendant nodes, said method comprised of:
-
i) compiling a list of nodes in said directed acyclic graph and scalar values associated with said nodes; ii) compiling a list of edges in said directed acyclic graph; iii) generating a transitive closure table using a fourth generation structured query language process; iv) aggregating scalars associated from at least one node in said directed acyclic graph from said transitive closure table by; a) identifying all entries in said table wherein said predetermined node is a parent; b) compiling descendant nodes of parent nodes; c) for each descendant node, aggregating scalar values associated with each descendant node. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method of aggregating scalars associated with nodes in a tree graph, at least some of the nodes having associated parent and descendant nodes, said method comprised of:
-
i) compiling a list of nodes in said directed acyclical graph and scalar values associated with said nodes; ii) compiling a list of edges of said tree graph; iii) generating a transitive closure table using a fourth generation structured query language process; iv) aggregating scalars associated from at least one node in said tree graph from said transitive closure table by; a) identifying all entries in said table wherein said predetermined node is a parent; b) compiling descendant nodes of parent nodes; c) for each descendant node, aggregating scalar values associated with each descendant node. - View Dependent Claims (8, 9, 10)
-
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeWSOU Investments, LLC (WSOU Holdings, LLC)
-
Original AssigneeLucent Technologies, Inc. (Nokia Corporation)
-
InventorsSchultz, Thomas Alan
-
Primary Examiner(s)Lintz, Paul R.
-
Assistant Examiner(s)Alam, Shahid
-
Application NumberUS09/024,841Time in Patent Office672 DaysField of Search707/2, 707/3, 707/4, 707/103, 707/100, 707/101US Class Current1/1CPC Class CodesG06F 16/2246 Trees, e.g. B+treesG06F 16/24566 Recursive queriesY10S 707/99932 Access augmentation or opti...Y10S 707/99933 Query processing, i.e. sear...Y10S 707/99934 Query formulation, input pr...Y10S 707/99942 Manipulating data structure...
