Database Storage for Element-Based Document Descriptions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database systems face challenges in effectively storing and retrieving element-based document descriptions, particularly in maintaining the sequential and nesting relationships between elements, which are crucial for accurate representation and reconstruction of documents like XML.
Innovation Solution
A database system that uses nodes with multiple CPUs and virtual processes to manage data in a way that each element-based document description is stored with an order identifier and a range identifier, allowing for efficient storage and reconstruction of the document structure, even with sparse order identifiers and non-sequential element arrangements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If element-based document descriptions are stored in a database, then the document structure and relationships can be preserved, but the complexity of storing and managing nested elements with their sequential and nesting relationships increases
Solution Approach 1:
The patent segments the document structure into discrete elements, each represented as a separate row in the database table. Each element is characterized by an order identifier and a range identifier, breaking down the complex nested document structure into manageable, independently storable units that can be efficiently managed in a relational database.
Solution Approach 2:
The patent implements nesting by allowing elements to contain references to other elements through their order identifier and range identifier. Parent elements can specify the range of order identifiers that belong to their child elements, creating a nested hierarchical structure within the flat database table, similar to nested dolls where smaller structures are contained within larger ones.
2Quantity of substance
If sparse order identifiers are used to represent non-sequential elements, then the storage efficiency improves, but the complexity of maintaining order relationships increases
Solution Approach 1:
The patent changes the parameter representation from sequential integers to sparse order identifiers with associated range identifiers. This parameter transformation allows efficient storage by only recording the minimum and maximum order identifiers for each element's child elements, rather than storing every individual child element's identifier, thus improving storage efficiency while maintaining the ability to retrieve order relationships.
3Measurement precision
If all element relationships are stored explicitly, then the accuracy of document reconstruction is improved, but the database size and retrieval complexity increase
Solution Approach 1:
The patent applies partial action by storing only the essential boundary information (minimum and maximum order identifiers) needed to define element relationships, rather than explicitly storing every individual relationship. This partial representation is sufficient to reconstruct the complete document structure, achieving accurate reconstruction without the overhead of storing all possible relationship details.
Data Source
AI summary
A method, computer program, and database system are disclosed for storing element-based descriptions of documents in a database. The database system includes one or more nodes. Each of the one or more nodes provides access to one or more of a plurality of CPUs. Each of the one or more CPUs provides access to one or more of a plurality of virtual processes. Each virtual process is configured to manage data stored in one of a plurality of data-storage facilities. The data stored in the plurality of data-storage facilities includes data representing a database table. A row of the table corresponds to an element of the element-based document description and includes: data describing the element, an order identifier corresponding to the element, and a range identifier corresponding to the element.