Storage structure for pattern mining
AssigneeIntuit Inc.
InventorsLalla Mouatadid, Jay Jie-Bing Yu
Life of this patent
Estimating the term…
Abstract
A computer implemented method includes obtaining an original graph data structure including multiple stored nodes connected by multiple edges. The stored nodes include multiple operation stored nodes and multiple data stored nodes. The method further includes generating an auxiliary graph data structure from the original graph data structure. The auxiliary graph data structure includes the operation stored nodes. The method further includes executing a pattern mining tool on the auxiliary graph data structure to obtain a pattern list, traversing the auxiliary graph data structure to identify multiple instances of identified patterns in the pattern list, and presenting the instances.
Claims20
A computer implemented method comprising:
- obtaining an original graph data structure comprising a plurality of stored nodes connected by a plurality of edges, the plurality of stored nodes comprising a plurality of operation stored nodes and a plurality of data stored nodes;
- generating an auxiliary graph data structure from the original graph data structure, wherein generating the auxiliary graph data structure comprises:
- adding, from the original graph data structure, the plurality of operation stored nodes to the auxiliary graph data structure while traversing the original graph data structure, and
- replacing, when adding the plurality of operation stored nodes, a data stored node and at least two edges connecting the data stored node to at least two operation stored nodes with at least one new edge;
- executing a pattern mining tool on the auxiliary graph data structure to obtain a pattern list;
- traversing the auxiliary graph data structure to identify a plurality of instances of identified patterns in the pattern list;
- and
- presenting the plurality of instances.
A system comprising:
- a storage device storing:
- an original graph data structure comprising a plurality of stored nodes connected by a plurality of original graph edges, the plurality of stored nodes comprising a plurality of operation stored nodes and a plurality of data stored nodes, and
- an auxiliary graph data structure comprising:
- the plurality of operation stored nodes labeled with an operation type and connected by a plurality of auxiliary graph edges,
- the plurality of auxiliary graph edges each labeled with a datatype identifier of corresponding data stored node of the plurality of data stored nodes;
- and
- at least one computer processor executing a code optimization application, the code optimization application comprising:
- a graph transformation tool configured to generate the auxiliary graph data structure from the original graph data structure.
A computer implemented method comprising:
- generating an auxiliary graph data structure from an original graph data structure,
- the original graph data structure comprising a plurality of stored nodes connected by a plurality of original graph edges, the plurality of stored nodes comprising a plurality of operation stored nodes and a plurality of data stored nodes, and
- the auxiliary graph data structure comprising:
- the plurality of operation stored nodes labeled with an operation type and connected by a plurality of auxiliary graph edges,
- the plurality of auxiliary graph edges each labeled with a datatype identifier of corresponding data stored node of the plurality of data stored nodes;
- and
- executing a pattern mining tool on the auxiliary graph data structure to obtain a pattern list;
- identifying a plurality of instances of identified patterns in the pattern list;
- and
- presenting the plurality of instances.
Dependencies are inferred from the claim text.