20240037105. Predicting Record Hierarchies and Record Groups for Records Bulk Loaded into a Data Management System simplified abstract (INTERNATIONAL BUSINESS MACHINES CORPORATION)

From WikiPatents
Jump to navigation Jump to search

Predicting Record Hierarchies and Record Groups for Records Bulk Loaded into a Data Management System

Organization Name

INTERNATIONAL BUSINESS MACHINES CORPORATION

Inventor(s)

Abhishek Seth of Deoband (IN)

Megha Oulkar of Bengaluru (IN)

Matheen Ahmed Pasha of Bengaluru (IN)

Shettigar Parkala Srinivas of Bengaluru (IN)

Predicting Record Hierarchies and Record Groups for Records Bulk Loaded into a Data Management System - A simplified explanation of the abstract

This abstract first appeared for US patent application 20240037105 titled 'Predicting Record Hierarchies and Record Groups for Records Bulk Loaded into a Data Management System

Simplified Explanation

The patent application describes a method for managing record hierarchies and record groups in a data management system. Here is a simplified explanation of the abstract:

  • A root record node is identified for a record hierarchy.
  • A probabilistic search is performed on the record hierarchy graph to find record nodes related to the root record node based on record relationships data.
  • The identified record nodes related to the root record node are positioned as a level under the root record node in the record hierarchy.
  • Any record nodes that are not related to the root record node but match the definition of the record hierarchy are identified.
  • It is determined whether a set of record nodes unrelated to the root record node was identified.
  • If no set of record nodes unrelated to the root record node was identified, records matching the definition of the record hierarchy are positioned in the record hierarchy.

Potential applications of this technology:

  • Data management systems: This method can be applied in various data management systems to efficiently organize and manage record hierarchies and record groups.
  • Database systems: The technology can be used to improve the organization and structure of databases, making it easier to navigate and manage large amounts of data.

Problems solved by this technology:

  • Efficient organization: The method solves the problem of efficiently organizing record hierarchies and record groups in a data management system, making it easier to access and manage related records.
  • Accurate positioning: The technology ensures that record nodes are correctly positioned in the hierarchy based on their relationships with the root record node, improving the accuracy of data organization.

Benefits of this technology:

  • Improved data management: The method provides a more efficient and accurate way to manage record hierarchies and record groups, leading to improved data organization and accessibility.
  • Time and cost savings: By automating the process of identifying and positioning record nodes, the technology saves time and reduces the need for manual intervention in data management systems.


Original Abstract Submitted

managing record hierarchies and record groups in a data management system is provided. a root record node is identified for a record hierarchy. a probabilistic search of a graph of the record hierarchy is performed to identify record nodes related to the root record node based on record relationships data. identified record nodes related to the root record node are positioned as a level under the root record node in the record hierarchy. any record nodes that are not related to the root record node but match a definition of the record hierarchy are identified. it is determined whether a set of record nodes unrelated to the root record node was identified. in response to determining that a set of record nodes unrelated to the root record node was not identified, it is determined that records matching the definition of the record hierarchy are positioned in the record hierarchy.