Hierarchical Database Ordering Identifiers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Large enterprise databases, such as those used for project management and R&D, face inefficiencies when adding new entries, as existing entries often need to be reordered, leading to time-consuming and costly reprocessing, especially in databases with thousands of entries.
Innovation Solution
A system and method for database maintenance that assigns unique ordering identifiers to new entries as strings with sub-strings and delimiters, allowing new entries to be added without reordering existing entries, and generates data files sorted by these identifiers, minimizing reprocessing by maintaining the sequence of existing entries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If new entries are added to a database using traditional sequential numbering, then the database maintains simple ordering, but existing entries must be reordered and reprocessed, causing time loss and increased complexity
Solution Approach 1:
The ordering identifier is segmented into multiple components: a prefix indicating the parent entry, a delimiter, and a sequential number. This segmentation allows new entries to be inserted between existing entries without renumbering them, as the sequential number within each parent's namespace can increment independently
Solution Approach 2:
The ordering system transitions from a single-dimensional sequential number to a multi-dimensional hierarchical structure. By adding the prefix dimension (parent entry identifier) to the traditional sequential number, the system creates a tree-like ordering structure that eliminates the need to renumber entries when inserting new ones
2Device complexity
If traditional sequential ordering is used, then the database structure is simple, but adding entries requires reprocessing all subsequent entries
Solution Approach 1:
The system performs preliminary organization by grouping entries under parent identifiers before final sorting is needed. By pre-structuring the ordering identifier with parent prefixes, the database is prepared in advance to accommodate new entries without requiring reprocessing of existing data
3Manufacturing precision
If entries are reordered to maintain sequence, then the database remains accurately ordered, but reprocessing increases computational cost
Solution Approach 1:
Instead of physically reordering existing entries when adding new ones, the system creates a virtual ordering structure through the hierarchical identifier format. The parent prefix acts as a copy or reference point that automatically positions new entries in the correct sequence without moving existing data
Data Source
AI summary
Systems and methods discussed herein are associated with database maintenance and querying, in particular updating a database where entries in the database may be associated with an order indicated by at least one field associated with each entry. Entries added to the database may comprise ordering identifiers that are strings and that may comprise sub-strings, these ordering identifiers are automatically assigned by an application and when the database is queried, the data file returned comprises at least some of the entries ordered based upon the ordering identifiers.