DAG Path Addressing for Efficient Graph Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current technologies face inefficiencies in referencing and processing directed acyclic graphs (DAGs) and related structures like data-flow diagrams (DFDs) and conceptual graphs, due to the need for numerous variable names, which limits storage and processing efficiency.
Innovation Solution
DAG path addressing provides a method to factor out names by assigning unique address ranges to each node, allowing for simpler representation and processing independent of names or values, using techniques such as leaf addressing, subgraph addressing, and binding addressing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If variable names are used to describe DFDs and CGs, then the diagrams can be fully described, but storage and processing efficiency are limited
Solution Approach 1:
The patent extracts variable names from the DFD and CG representations by introducing a separate binding list structure. Names are factored out and stored independently from the diagram elements, allowing the diagrams to reference names by index rather than containing the full name strings. This separation reduces the complexity within the diagram structure while maintaining complete descriptive capability.
Solution Approach 2:
The patent introduces a binding list as an intermediary structure that mediates between the diagram elements and the variable names. The binding list stores pairs of (name, index) and acts as a lookup table, allowing efficient translation between human-readable names and machine-processable indices without requiring the names to be embedded in the diagram structure itself.
2Loss of information
If many variable names are used in DFDs and CGs, then complete description is achieved, but storage efficiency decreases
Solution Approach 1:
The patent creates a separate binding list that copies and stores the variable names independently from the diagram elements. Instead of embedding full name strings in multiple places within the DFD and CG structures, the system stores each unique name once in the binding list and references it by index throughout the diagrams, significantly reducing redundant storage while preserving complete descriptive information.
3Productivity
If variable names are embedded in DFDs and CGs, then processing can be done, but processing efficiency is limited
Solution Approach 1:
The patent changes the parameter representation from human-readable variable names to compact integer indices. By transforming names into numerical indices that reference entries in the binding list, the system enables more efficient processing operations such as comparison, sorting, and manipulation, while maintaining the ability to retrieve and display the original names when needed.
Data Source
AI summary
A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes (a covering node and a covered node). Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Nodes present in the subgraph that do not cover any other nodes are leaves of the subgraph. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path.