Embodiments include systems and methods for managing a network of nodes with delta processing. A network with a plurality of connected nodes can be stored, the nodes representing entities of the network. One or more deltas to the network that indicate updates to the connections among the plurality of nodes can be received. The deltas can be added to a queue. The connections between the nodes of the network can be updated using a delta from the queue. The network can be processed after updating the connections between the nodes to generate a vector for a given node. One or more paths for the given node can be identified based on the generated vector.
Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
3. The method of claim 2, wherein the security parameters used to augment the relational data query comprise one or more keys such that secured records within the data tables requested by the relational data query are retrieved when the one or more keys include a key that corresponds to the secured records, and the one or more keys used to augment the relational data query are based on at least permissions for the first node relative to the second node.
This invention relates to secure data retrieval in distributed systems, specifically addressing the challenge of accessing secured records in relational databases while enforcing access control based on node permissions. The method involves augmenting a relational data query with security parameters to ensure that only authorized records are retrieved. These security parameters include one or more cryptographic keys that correspond to the secured records in the requested data tables. The keys used are determined based on the permissions of a first node (the requesting entity) relative to a second node (the data source or another entity in the system). When the provided keys match those protecting the secured records, the query retrieves the corresponding data. This approach ensures that access is granted only when the requesting node has the necessary permissions, thereby enforcing security policies at the query level. The method integrates access control directly into the query process, preventing unauthorized access to sensitive data while maintaining the efficiency of relational database operations. The solution is particularly useful in distributed environments where multiple nodes interact with shared data, requiring fine-grained access control to maintain data integrity and confidentiality.
4. The method of claim 1, wherein the data tables of the secure database maintain a pre-computed version of the network that is configured to return the plurality of paths for the first node based on the relational data query.
This invention relates to network path analysis within a secure database system. The problem addressed is efficiently retrieving multiple paths between nodes in a network while maintaining data security and query performance. The solution involves pre-computing network paths and storing them in secure data tables, allowing rapid retrieval via relational data queries without exposing raw network topology data. The system includes a secure database containing network topology data and pre-computed path information. When a query requests paths between a first node and other nodes, the system accesses the pre-computed paths stored in the data tables rather than dynamically calculating them. This approach improves query response times and reduces computational overhead while maintaining data security by preventing direct access to the underlying network structure. The pre-computed paths are stored in a format that allows efficient querying based on relational data operations, such as SQL queries. The system can return multiple paths between nodes, including alternative routes, without exposing the complete network topology. This method is particularly useful in scenarios where network path information must be provided securely, such as in telecommunications, cybersecurity, or enterprise network management systems. The invention enhances both performance and security by decoupling path retrieval from real-time network analysis.
5. The method of claim 4, wherein the pre-computed version of the network is maintained by queuing deltas that represent changes to the plurality of connected nodes and updating the data tables of the secure database by processing a queued delta.
This invention relates to maintaining a pre-computed version of a network, particularly in systems where the network consists of a plurality of connected nodes. The problem addressed is efficiently updating a secure database that stores data tables representing the network while ensuring data integrity and security. The solution involves queuing deltas, which are representations of changes to the network nodes, and processing these deltas to update the data tables in the secure database. The queuing mechanism allows for controlled and secure updates, ensuring that changes are applied in a systematic manner. The secure database is designed to store the network's data tables, and the deltas are processed to reflect the latest state of the network in these tables. This approach minimizes disruptions and maintains consistency in the network representation stored in the database. The method ensures that updates are applied securely and efficiently, reducing the risk of data corruption or unauthorized access. The queuing of deltas allows for batch processing or prioritized updates, depending on system requirements. The secure database may include access controls and encryption to protect the integrity and confidentiality of the network data. This invention is particularly useful in systems where network topology changes frequently, such as in telecommunications, cloud computing, or distributed systems, where maintaining an accurate and secure representation of the network is critical.
6. The method of claim 4, wherein the network with the plurality of connected nodes comprises a social graph, and the pre-computed version of the network comprises the social graph mapped onto the data tables of the secure database.
This invention relates to social network analysis and database optimization. The problem addressed is the computational inefficiency of querying social graphs stored in secure databases, where direct traversal of relationships between nodes is slow due to security constraints. The solution involves pre-computing a version of the social graph and mapping it onto the database's data tables, allowing faster queries without compromising security. The method involves a network of connected nodes representing a social graph, where each node corresponds to a user or entity and edges represent relationships. The pre-computed version of the network is generated by analyzing the social graph and storing its structure in a format optimized for the database's data tables. This pre-computed structure includes relationship mappings that allow queries to access social graph data without repeatedly traversing the graph during each query. The pre-computed version is stored in the secure database alongside the original data, enabling efficient querying while maintaining data security. The method ensures that the social graph's relationships are preserved in the pre-computed version, allowing accurate and fast retrieval of social network information. This approach reduces query latency and computational overhead compared to traditional methods that require real-time graph traversal. The solution is particularly useful in applications requiring frequent social graph queries, such as recommendation systems, fraud detection, and user analytics.
7. The method of claim 4, wherein one or more parts and one or more plans that comprise a plurality of parts are defined for the plurality of connected nodes, and wherein a connection between two nodes of the network is based on a correspondence between a plan defined for a first of the two nodes that matches a part defined for a second of the two nodes.
This invention relates to network systems and methods for defining and managing connections between nodes in a network. The problem addressed is the need for a structured approach to establishing connections between nodes based on predefined parts and plans, ensuring compatibility and logical organization within the network. The method involves defining one or more parts and one or more plans for a plurality of connected nodes. Each plan comprises multiple parts, and the connections between nodes are established based on a correspondence between a plan defined for one node and a part defined for another node. Specifically, a connection is formed when a plan associated with a first node matches a part associated with a second node. This ensures that nodes are only connected if their respective definitions are compatible, preventing mismatches and maintaining network integrity. The method may also include defining additional constraints or rules for node connections, such as hierarchical relationships or dependency requirements. The structured approach allows for scalable and modular network configurations, where nodes can be dynamically added or removed while maintaining consistent connectivity based on predefined definitions. This is particularly useful in systems where nodes must adhere to specific compatibility criteria, such as in distributed computing, IoT networks, or modular software architectures. The invention provides a systematic way to manage node interactions, improving efficiency and reliability in network operations.
8. The method of claim 7, wherein the pre-computed version of the network is maintained by determining a transitive closure for the network, and the transitive closure is determined using connections among the plurality of connected nodes based on a correspondence between plans and parts for the plurality of connected nodes.
This invention relates to network analysis, specifically optimizing the representation of a network for efficient querying and analysis. The problem addressed is the computational inefficiency of repeatedly traversing and analyzing large, interconnected networks, such as those representing supply chains, dependency graphs, or other relational data structures. The solution involves maintaining a pre-computed version of the network to accelerate queries and analyses. The method involves determining a transitive closure for the network, which captures all possible connections between nodes without requiring repeated traversal. The transitive closure is computed based on connections among nodes, where these connections are derived from a correspondence between plans and parts associated with each node. This correspondence ensures that the transitive closure accurately reflects the underlying relationships in the network. By pre-computing this closure, subsequent queries or analyses can leverage the pre-computed data, reducing computational overhead and improving performance. The approach is particularly useful in scenarios where the network structure is static or changes infrequently, allowing the pre-computed version to remain valid for extended periods. This method enhances efficiency in applications requiring frequent network traversal, such as dependency resolution, pathfinding, or impact analysis.
9. The method of claim 1, wherein the supply chain information about the first product comprises a trade or product certification and an expiration status of the trade or product certification.
The invention relates to supply chain management systems that track and verify product information, particularly focusing on trade or product certifications and their expiration status. The system collects and stores detailed supply chain data for products, including certifications that confirm compliance with industry standards, regulations, or quality benchmarks. A key aspect is monitoring the expiration status of these certifications to ensure ongoing validity. This helps businesses and regulators verify product authenticity, compliance, and quality throughout the supply chain. The system may integrate with databases or blockchain networks to maintain transparency and traceability. By tracking certification expiration, the system prevents the use of outdated or invalid certifications, reducing risks such as regulatory violations or fraud. The invention improves supply chain integrity by ensuring that only products with valid certifications are processed or sold, enhancing trust and compliance in global trade.
12. The non-transitory computer readable medium of claim 11, wherein the security parameters used to augment the relational data query comprise one or more keys such that secured records within the data tables requested by the relational data query are retrieved when the one or more keys include a key that corresponds to the secured records, and the one or more keys used to augment the relational data query are based on permissions for the first node relative to the second node.
This invention relates to secure data retrieval in distributed systems, specifically addressing the challenge of accessing secured records in relational databases while enforcing access control based on node permissions. The system involves a non-transitory computer-readable medium storing instructions that, when executed, enable a first node to generate a relational data query for a second node. The query is augmented with security parameters, such as one or more cryptographic keys, to control access to secured records within the requested data tables. The keys determine whether the secured records are retrieved, ensuring that only records corresponding to the provided keys are accessed. The keys used in the query are derived from predefined permissions that define the access rights of the first node relative to the second node. This approach ensures that data retrieval adheres to security policies, preventing unauthorized access while allowing legitimate queries to retrieve the necessary secured records. The system enhances data security in distributed environments by integrating access control directly into the query process, reducing the risk of unauthorized data exposure.
13. The non-transitory computer readable medium of claim 10, wherein the data tables of the secure database maintain a pre-computed version of the network that is configured to return the plurality of paths for the first node based on the relational data query.
The invention relates to a system for efficiently querying and retrieving network path data from a secure database. The problem addressed is the computational inefficiency of dynamically calculating network paths in response to queries, which can be resource-intensive and time-consuming, especially for large or complex networks. The solution involves pre-computing and storing network path data in a secure database, allowing for faster retrieval when queried. The database contains data tables that store relational data representing the network structure. When a query is made for paths associated with a specific node, the pre-computed data is used to return the requested paths without the need for real-time pathfinding calculations. This approach improves query response times and reduces computational overhead, making it particularly useful in applications requiring real-time or near-real-time network analysis. The secure database ensures that the pre-computed network data is protected and accessible only to authorized users or systems. The invention may be implemented in various network management, routing, or cybersecurity applications where efficient path retrieval is critical.
14. The non-transitory computer readable medium of claim 13, wherein the pre-computed version of the network is maintained by queuing deltas that represent changes to the plurality of connected nodes and updating the data tables of the secure database by processing a queued delta.
This invention relates to a system for managing and updating a network represented as a graph structure in a secure database. The problem addressed is efficiently maintaining an up-to-date version of a network while ensuring data integrity and security. The network consists of a plurality of connected nodes, where each node represents an entity and connections represent relationships between entities. The system pre-computes a version of the network to optimize query performance and reduce computational overhead during runtime. To handle dynamic changes, the system queues deltas, which are incremental changes to the network, such as additions, deletions, or modifications of nodes or connections. These deltas are processed sequentially to update the data tables in the secure database, ensuring that the network remains consistent and accurate. The queuing mechanism allows for batch processing of changes, reducing the frequency of direct database updates and improving system efficiency. The secure database enforces access controls and encryption to protect sensitive network data. This approach balances performance and security by decoupling the computation of network versions from real-time updates, allowing for efficient querying while maintaining data integrity.
15. The non-transitory computer readable medium of claim 13, wherein the network with the plurality of connected nodes comprises a social graph, and the pre-computed version of the network comprises the social graph mapped onto the data tables of the secure database.
A system and method for efficiently querying and analyzing a social graph stored in a secure database. The technology addresses the challenge of performing fast and secure queries on large-scale social networks, where the graph structure is represented as a collection of interconnected nodes. The system pre-computes a version of the social graph and maps it onto the data tables of a secure database, enabling optimized query processing. The pre-computed version includes relationships between nodes, such as friendships or connections, stored in a structured format that allows for efficient traversal and analysis. The secure database ensures that sensitive user data remains protected while still allowing authorized queries to retrieve relevant information. The system may also include mechanisms for updating the pre-computed graph as new connections or changes occur in the social network. This approach improves query performance by reducing the need for real-time graph traversal, while maintaining data security and integrity. The solution is particularly useful for applications requiring real-time social network analysis, such as recommendation systems, fraud detection, or user behavior tracking.
16. The non-transitory computer readable medium of claim 13, wherein one or more parts and one or more plans that comprise a plurality of parts are defined for the plurality of connected nodes, and wherein a connection between two nodes of the network is based on a correspondence between a plan defined for a first of the two nodes that matches a part defined for a second of the two nodes.
This invention relates to a system for managing and connecting nodes in a network, particularly in the context of modular or component-based systems where nodes represent parts or plans. The problem addressed is efficiently establishing connections between nodes based on predefined relationships between their components or plans, ensuring compatibility and proper integration within the network. The system involves defining a plurality of connected nodes, where each node can represent either a part or a plan. A plan is a structured set of parts, while a part is a basic unit within the system. The invention specifies that connections between two nodes are established based on a correspondence between a plan defined for one node and a part defined for another node. Specifically, a connection is formed when a plan associated with a first node matches a part associated with a second node, ensuring that the nodes are compatible and can interact correctly. This approach allows for dynamic and scalable network configurations, where nodes are linked based on their inherent structures rather than arbitrary or manual assignments. The system ensures that only compatible nodes are connected, reducing errors and improving system reliability. The use of plans and parts as defining elements enables flexible and modular network architectures, suitable for applications in software systems, hardware configurations, or other modular environments where component compatibility is critical.
17. The non-transitory computer readable medium of claim 16, wherein the pre-computed version of the network is maintained by determining a transitive closure for the network, and the transitive closure is determined using connections among the plurality of connected nodes based on a correspondence between plans and parts for the plurality of connected nodes.
This invention relates to a system for managing and analyzing networked data structures, particularly in the context of interconnected nodes representing plans and parts. The problem addressed is the efficient representation and querying of complex relationships within such networks, where direct connections between nodes may not fully capture indirect or transitive relationships. The invention involves a non-transitory computer-readable medium storing instructions for maintaining a pre-computed version of a network. This pre-computed version is generated by determining a transitive closure of the network, which identifies all possible indirect connections between nodes. The transitive closure is computed based on the relationships between plans and parts across the connected nodes. By pre-computing this closure, the system enables faster querying and analysis of the network, as it eliminates the need to dynamically compute transitive relationships during runtime. The approach leverages the correspondence between plans and parts to define the connections among nodes, ensuring that the transitive closure accurately reflects the underlying structure of the network. This method is particularly useful in applications where network traversal and relationship analysis are frequent, such as in supply chain management, dependency tracking, or configuration management systems.
18. The non-transitory computer readable medium of claim 10, wherein the supply chain information about the first product comprises a trade or product certification and an expiration status of the trade or product certification.
A system and method for managing supply chain information involves tracking and verifying product data to ensure compliance and authenticity. The invention addresses challenges in supply chain transparency, particularly in verifying product certifications and their validity. The system stores and retrieves supply chain information for products, including trade or product certifications and their expiration status. This allows users to confirm whether a product meets regulatory or industry standards and whether its certification is still valid. The system may also include additional supply chain data, such as origin, manufacturing details, and distribution records, to provide a comprehensive view of a product's lifecycle. By integrating certification status checks, the system helps prevent the distribution of non-compliant or expired products, enhancing trust and regulatory adherence in supply chains. The invention is particularly useful in industries where certification validity is critical, such as food, pharmaceuticals, and electronics. The system may be implemented as a software application or database accessible to stakeholders across the supply chain, ensuring real-time verification of product credentials.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
September 8, 2021
March 19, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.