# US 2026/0093693 A1 · Generating, accessing, and displaying lineage metadata

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0093693 A1
- Document ID: US20260093693A1
- Status: Published application
- Kind: A1
- Application number: 19/314,968
- Filed: 2025-08-29
- Published: 2026-04-02
- Earliest claimed: 2016-12-01
- Assignees: Ab Initio Technology LLC
- Applicants: Ab Initio Technology LLC
- Inventors: David Clemens; Dusan Radivojevic; Neil Galarneau
- Web page: https://patentgrep.com/patent/US20260093693A1

## CPC

- G06F 16/245: Query processing
- G06F 16/22: Indexing; Data structures therefor; Storage structures
- G06F 16/248: Presentation of query results
- G06F 16/83: Querying
- G06F 40/117: Tagging; Marking up (details of markup languages G06F40/143); Designating a block; Setting of attributes (style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Among other things, we describe a method of receiving a portion of metadata from a data source, the portion of metadata describing nodes and edges; generating instances of a data structure representing the portion of metadata, at least one instance of the data structure including an identification value that identifies a corresponding node, one or more property values representing respective properties of the corresponding node, and one or more pointers to respective identification values, each pointer representing an edge associated with a node identified by the corresponding respective identification value; storing the instances of the data structure in random access memory; receiving a query that includes an identification of at least one particular element of data; and using at least one instance of the data structure to cause a display of a computer system to display a representation of lineage of the particular element of data.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method performed by a data processing apparatus for identifying a walk plan for efficiently traversing nodes that store metadata about elements of data and, based on the efficient traversal, obtaining lineage for a given element of data, the method including:
receiving a request for lineage of an element of data;
accessing a walk plan for traversing nodes stored in a database, wherein relationships among the nodes are specified as edges, and wherein the walk plan includes instructions for traversing nodes and edges based on node types and edge types by specifying, for a node type,
1) an indication of a plurality of edge types,
2) an indication of a direction of traversal for each of the plurality of edge types, and
3) for each of the plurality of edge types, an indication of at least one action to be performed when traversing the edge type, wherein the at least one action includes at least one of:
a first action to collect metadata associated with an edge of the edge type, or
a second action to collect metadata associated with a node reached by traversing the edge type;
transmitting a request to traverse at least some of the nodes in accordance with the walk plan, wherein the request includes an indication of the element of data;
receiving one or more results of the traversal; and
based on the one or more results, generating a response including lineage of the element of data.

### Claim 22 (depends on 21)

The method of claim 21, wherein the walk plan is stored before receipt of the request for the element of data.

### Claim 23 (depends on 21)

The method of claim 21, further including:
receiving an identification of a type of lineage; and
accessing the walk plan from a plurality of walk plans, wherein the walk plan indicates the node types and the edge types that are relevant to the identified type of lineage.

### Claim 24 (depends on 21)

The method of claim 21, wherein the walk plan is accessed based on a data type of the element of data.

### Claim 25 (depends on 21)

The method of claim 21, wherein the walk plan includes a structured document.

### Claim 26 (depends on 21)

The method of claim 21, wherein the walk plan includes conditions for following or collecting an edge based at least in part on one or more property values representing respective properties of a node.

### Claim 27 (depends on 21)

The method of claim 21, wherein the walk plan includes, for at least one edge type of the plurality of edge types:
an indication of at least one action to be performed when traversing the edge type in a forward direction; and
an indication of at least one action to be performed when traversing the edge type in a backward direction.

### Claim 28 (depends on 21)

The method of claim 21, wherein the at least one action includes both of the first action to collect metadata associated with an edge of the edge type and the second action to collect metadata associated with a node reached by traversing the edge type.

### Claim 29 (depends on 21)

The method of claim 21, wherein the response includes metadata describing a sequence of nodes and edges, wherein one of the nodes of the sequence represents the element of data.

### Claim 30 (depends on 21)

The method of claim 21, further including,
based on the one or more results, causing display of a representation of the lineage of the element of data.

### Claim 31 (depends on 21)

The method of claim 21, further including:
traversing at least some of the nodes in accordance with the walk plan.

### Claim 32 (depends on 31)

The method of claim 31, wherein traversing at least some of the nodes in accordance with the walk plan includes:
accessing a first node corresponding to the element of data;
accessing a reference associated with the first node;
accessing a second node corresponding to the reference associated with the first node; and
collecting metadata associated with the second node.

### Claim 33 (depends on 32)

The method of claim 32, wherein the reference associated with the first node includes a pointer to a memory location corresponding to the second node.

### Claim 34 (depends on 21)

The method of claim 21, wherein the nodes correspond to respective instances of a data structure, and the edges correspond to respective pointers to a respective instance of the data structure.

### Claim 35 (depends on 21)

The method of claim 21, wherein traversing the nodes is performed without accessing the element of data.

### Claim 36 (depends on 21)

The method of claim 21, wherein the walk plan specifies whether to follow an edge for each of the plurality of edge types.

### Claim 37 (depends on 21)

The method of claim 21, wherein the walk plan includes one or more flags indicating the at least one action to be performed when traversing the edge type.

### Claim 38 (depends on 21)

The method of claim 21, wherein the element of data comprises at least one of: a transformation, a data element, a dataset, a container, or an application.

### Claim 39

A system including:
one or more processors; and
at least one non-transitory computer-readable storing medium storing instructions executable by the one or more processors to perform operations including:
receiving a request for lineage of an element of data;
accessing a walk plan for traversing nodes stored in a database, wherein relationships among the nodes are specified as edges, and wherein the walk plan includes instructions for traversing nodes and edges based on node types and edge types by specifying, for a node type,
1) an indication of a plurality of edge types,
2) an indication of a direction of traversal for each of the plurality of edge types, and
3) for each of the plurality of edge types, an indication of at least one action to be performed when traversing the edge type, wherein the at least one action includes at least one of:
a first action to collect metadata associated with an edge of the edge type, or
a second action to collect metadata associated with a node reached by traversing the edge type;
transmitting a request to traverse at least some of the nodes in accordance with the walk plan, wherein the request includes an indication of the element of data;
receiving one or more results of the traversal; and
based on the one or more results, generating a response including lineage of the element of data.

### Claim 40

At least one non-transitory computer-readable storing medium storing instructions executable by one or more processors to perform operations including:
receiving a request for lineage of an element of data;
accessing a walk plan for traversing nodes stored in a database, wherein relationships among the nodes are specified as edges, and wherein the walk plan includes instructions for traversing nodes and edges based on node types and edge types by specifying, for a node type,
1) an indication of a plurality of edge types,
2) an indication of a direction of traversal for each of the plurality of edge types, and
3) for each of the plurality of edge types, an indication of at least one action to be performed when traversing the edge type, wherein the at least one action includes at least one of:
a first action to collect metadata associated with an edge of the edge type, or
a second action to collect metadata associated with a node reached by traversing the edge type;
transmitting a request to traverse at least some of the nodes in accordance with the walk plan, wherein the request includes an indication of the element of data;
receiving one or more results of the traversal; and
based on the one or more results, generating a response including lineage of the element of data.
