Embodiments use a graphical tree to illustrate hierarchical records including a child record having parent field(s) identifying a first parent record and a second parent record of the child record. The graphical tree is generated by determining a first position for the child record and a second position for the first parent record without considering the second parent record. Subsequently, a third position for the second parent record is determined at a same level as the second position. Once the positions are determined, a first shape, a second shape and a third shape are rendered at the first position, the second position and the third position, respectively. The graphical tree is then generated by visually connecting the first shape with the second shape and the third shape, thereby graphically illustrating the plurality of hierarchical records on a target output medium.
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 1, wherein the second shape is rendered at a sibling level of the third shape such that the first parent record is represented as a sibling of the second parent record.
This invention relates to data visualization techniques for hierarchical data structures, specifically improving the representation of relationships between parent and child records in graphical displays. The problem addressed is the lack of clarity in visualizing how parent records are interconnected when multiple levels of hierarchy exist, making it difficult to understand the overall structure and relationships. The method involves rendering shapes to represent records in a hierarchical data structure. A first shape represents a first parent record, and a second shape represents a child record linked to the first parent record. A third shape represents a second parent record, which is also linked to the child record. The second shape is rendered at a sibling level of the third shape, meaning the first parent record is visually represented as a sibling of the second parent record. This arrangement clarifies the hierarchical relationships by showing that both parent records share the same child record, improving the understanding of the data structure. The method ensures that the visual representation accurately reflects the logical relationships in the data, making it easier to navigate and interpret complex hierarchies. The technique is particularly useful in applications like organizational charts, file systems, or database schemas where multiple parent-child relationships exist.
5. The method of claim 4, wherein the child record is a descendant of the first parent record and the second parent record according to the hierarchical relationship among the list of records.
This invention relates to hierarchical data structures and methods for managing relationships between records in such structures. The problem addressed is efficiently tracking and determining the hierarchical relationships between records, particularly when a record has multiple parent records. The method involves analyzing a hierarchical data structure containing a list of records, where each record can have one or more parent records. The method determines whether a child record is a descendant of two specified parent records based on the hierarchical relationships defined within the list. This ensures that the child record is connected to both parent records through a valid hierarchical path, maintaining data integrity and consistency in the structure. The method first identifies the hierarchical relationships among the records, then verifies that the child record is a descendant of both the first and second parent records. This verification process ensures that the child record is properly positioned within the hierarchy relative to the specified parent records. The method is particularly useful in systems where records must inherit properties or permissions from multiple parent records, such as in organizational charts, file systems, or database schemas. By confirming the hierarchical relationship, the method prevents inconsistencies and ensures accurate data retrieval and processing.
6. The method of claim 1, wherein the plurality of hierarchical records are graphically illustrated using a graphical tree.
A system and method for visualizing hierarchical data structures involves organizing data into a plurality of hierarchical records, where each record is linked to one or more related records through parent-child relationships. The hierarchical records are graphically illustrated using a graphical tree, where nodes represent individual records and edges represent the relationships between them. The graphical tree allows users to navigate and interact with the hierarchical data, enabling efficient exploration of complex relationships. The system may include features such as expanding and collapsing branches of the tree, filtering records based on specific criteria, and dynamically updating the tree in response to user input or data changes. The method ensures that the graphical representation remains intuitive and scalable, even for large datasets, by optimizing the layout and rendering of the tree structure. This approach is particularly useful in applications requiring structured data visualization, such as organizational charts, file system navigation, or database management. The system may also support additional functionalities like drag-and-drop operations, context menus, and tooltips to enhance user interaction with the hierarchical data.
9. The system of claim 7, wherein the second shape is rendered at a sibling level of the third shape such that the first parent record is represented as a sibling of the second parent record.
This invention relates to data visualization systems for hierarchical data structures, specifically addressing the challenge of representing complex relationships between nested records in a clear and intuitive manner. The system renders shapes to visually depict records and their hierarchical relationships, where each shape corresponds to a record in a database. The shapes are organized in a tree-like structure, with parent records displayed above their child records to indicate hierarchical relationships. The system includes a first shape representing a first parent record, a second shape representing a second parent record, and a third shape representing a child record of the first parent record. The second shape is rendered at the same hierarchical level (sibling level) as the third shape, visually indicating that the first parent record is a sibling of the second parent record. This approach simplifies the visualization of complex nested relationships by flattening certain hierarchical levels, making it easier for users to understand the structure and connections between records. The system dynamically adjusts the rendering based on user interactions, such as zooming or panning, to maintain clarity and usability. The invention improves upon prior art by providing a more flexible and intuitive way to display hierarchical data, particularly in scenarios where multiple levels of nesting would otherwise clutter the visualization.
11. The system of claim 10, wherein the child record is a descendant of the first parent record and the second parent record according to the hierarchical relationship among the list of records.
This invention relates to hierarchical data management systems, specifically addressing the challenge of efficiently tracking and managing relationships between records in a hierarchical structure. The system organizes records into a hierarchy where each record can have multiple parent records, forming a directed acyclic graph (DAG) structure. This allows for flexible and dynamic relationships between records, enabling complex data modeling beyond traditional tree-based hierarchies. The system includes a data storage component that stores a list of records, each with a unique identifier and metadata. A relationship mapping component defines hierarchical relationships between records, where a child record can be linked to multiple parent records. A query processing component retrieves records based on their hierarchical relationships, supporting operations such as traversing parent-child links, identifying common ancestors, and determining descendant relationships. In one embodiment, the system ensures that a child record is a descendant of two or more parent records according to the defined hierarchical relationships. This means the child record is reachable from each parent record through a path of intermediate records, maintaining consistency in the hierarchy. The system may also include validation mechanisms to enforce these relationships, preventing cycles or invalid links that could disrupt the hierarchical structure. This approach is particularly useful in applications like organizational charts, version control systems, or knowledge graphs where records must maintain multiple parent relationships while preserving logical consistency.
12. The system of claim 7, wherein the plurality of hierarchical records are graphically illustrated using a graphical tree.
A system for visualizing hierarchical data structures uses a graphical tree to represent a plurality of hierarchical records. The hierarchical records are organized in a parent-child relationship, where each parent record can have one or more child records, forming a branching structure. The graphical tree displays these relationships visually, allowing users to navigate and interact with the hierarchical data. The system may include a user interface that enables users to expand or collapse branches of the tree, select individual records, or perform actions on specific records. The graphical tree may also include visual indicators, such as icons or color coding, to represent additional attributes or metadata associated with the records. This visualization helps users quickly understand the structure and relationships within the hierarchical data, improving usability and efficiency in data management tasks. The system may be applied in various domains, including file systems, organizational charts, or database structures, where hierarchical relationships are important. The graphical tree provides an intuitive way to explore and manipulate hierarchical data, reducing the complexity of navigating large or deeply nested structures.
15. The computer-readable medium of claim 13, wherein the second shape is rendered at a sibling level of the third shape such that the first parent record is represented as a sibling of the second parent record.
This invention relates to data visualization techniques for hierarchical data structures, specifically improving the representation of relationships between parent and child records in graphical displays. The problem addressed is the lack of clarity in visualizing how parent records are interconnected, particularly when multiple parent records share a common ancestor or when parent-child relationships need to be emphasized without obscuring the hierarchical structure. The invention involves rendering shapes representing data records in a graphical interface, where the shapes are positioned based on their hierarchical relationships. A first parent record and a second parent record are displayed as siblings when they share a common ancestor, ensuring their relationship is visually apparent. A third shape, representing a child record, is rendered as a descendant of the first parent record, while a second shape, representing another child record, is rendered at the same sibling level as the third shape. This positioning indicates that the first parent record is a sibling of the second parent record, clarifying their hierarchical relationship. The visualization may include additional shapes representing other records, with their positions determined by their hierarchical relationships to maintain a coherent and intuitive display. The technique ensures that parent-child relationships are clearly depicted while preserving the overall structure of the hierarchy.
17. The computer-readable medium of claim 13, wherein the plurality of hierarchical records are graphically illustrated using a graphical tree.
A system and method for visualizing hierarchical data structures involves storing a plurality of hierarchical records in a database, where each record is linked to one or more other records to form a hierarchical relationship. The hierarchical records are graphically illustrated using a graphical tree, where nodes represent the records and edges represent the hierarchical relationships between them. The graphical tree may include expandable and collapsible branches to allow users to navigate and explore the hierarchical structure. The system may also support interactive features such as selecting, filtering, and annotating nodes within the graphical tree. The hierarchical records may be stored in a database table with fields that define the parent-child relationships, and the graphical tree is dynamically generated based on the stored records. The system may also include a user interface for displaying the graphical tree and receiving user input to manipulate the visualization. The hierarchical data may represent organizational structures, file systems, or other nested relationships. The graphical tree provides an intuitive way to visualize and interact with complex hierarchical data, improving usability and efficiency in data analysis and management tasks.
18. The method of claim 1, wherein a first relationship between the first parent record and the child record is equivalent to a second relationship between the second parent record and the child record.
This invention relates to data management systems, specifically methods for establishing and managing relationships between records in a database. The problem addressed is ensuring consistency and accuracy in hierarchical or relational data structures where multiple parent records may share a common child record. The invention provides a method to verify and enforce equivalence between relationships involving a shared child record and different parent records, preventing data inconsistencies. The method involves identifying a first parent record and a second parent record, each having a relationship with a shared child record. The system then determines a first relationship between the first parent record and the child record, and a second relationship between the second parent record and the child record. The method compares these relationships to ensure they are equivalent, meaning they share the same attributes, properties, or logical connections. If the relationships are not equivalent, the system may adjust one or both relationships to enforce equivalence, ensuring data integrity across the database. This approach is particularly useful in systems where shared child records must maintain consistent relationships with multiple parent records, such as in hierarchical databases, organizational structures, or dependency graphs. The method may also include validating the relationships against predefined rules or constraints to further ensure accuracy. By enforcing equivalence, the invention prevents conflicts and maintains reliable data structures.
19. The system of claim 7, wherein a first relationship between the first parent record and the child record is equivalent to a second relationship between the second parent record and the child record.
This invention relates to a data management system that organizes records in a hierarchical structure, where records are linked as parent-child relationships. The problem addressed is ensuring consistency in how child records are associated with multiple parent records, preventing conflicts or ambiguities in data relationships. The system includes a database storing parent and child records, where each child record can be linked to multiple parent records. The key innovation is enforcing equivalence between the relationships of a child record to different parent records. For example, if a child record is linked to a first parent record in a specific way (e.g., with certain attributes or permissions), the same relationship must also apply when the child record is linked to a second parent record. This ensures uniformity in how the child record is accessed, modified, or referenced across the hierarchy. The system may include mechanisms to validate or enforce these equivalent relationships, such as rules engines, relationship mappings, or automated checks during record creation or updates. This prevents inconsistencies that could arise if a child record had different relationships with different parents, which could lead to data integrity issues or operational errors. The solution is particularly useful in applications like organizational hierarchies, file systems, or database schemas where maintaining consistent relationships is critical.
20. The computer-readable medium of claim 13, wherein a first relationship between the first parent record and the child record is equivalent to a second relationship between the second parent record and the child record.
This invention relates to data management systems, specifically methods for organizing and querying hierarchical data structures. The problem addressed is the inefficiency and complexity of managing relationships between records in hierarchical databases, particularly when multiple parent records share a common child record. Traditional systems struggle to maintain consistency and query performance when such relationships exist. The invention provides a computer-readable medium containing instructions for a data processing system to manage hierarchical data. The system stores a first parent record, a second parent record, and a child record, where the child record is linked to both parent records. The key innovation is that the relationship between the first parent and the child is equivalent to the relationship between the second parent and the child. This equivalence ensures that operations performed on one parent-child relationship automatically apply to the other, maintaining data consistency without redundant processing. The system further includes mechanisms to define and enforce these equivalent relationships, allowing queries to traverse the hierarchy efficiently. For example, if a user updates a property of the child record, the system ensures the change is reflected consistently across both parent-child relationships. The invention also supports querying the hierarchy to identify all parent records sharing a common child record, improving data retrieval performance. This approach simplifies data management in hierarchical structures, particularly in applications like organizational charts, file systems, or database schemas where multiple parent-child relationships are common. The system ensures that equivalent relationships are maintained automatically, red
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
December 1, 2021
April 16, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.