Dynamic Vector Class Object for Efficient Data Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing environments struggle with efficiently managing and storing vertex and feature properties in dynamic vector class objects, particularly in object-oriented programming, where multiple property values are indexed using a single index value, leading to complexity in data organization and retrieval.
Innovation Solution
The implementation of a dynamic vector class object that stores vertex property values in a vertex array and feature property values in a feature array, using a single index value to associate multiple vertex values with each feature value, and synchronizing the length of arrays to maintain data integrity and simplify operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If multiple property values are indexed using a single index value in dynamic vector class objects, then data storage efficiency is improved, but data organization complexity increases
Solution Approach 1:
The patent segments property data into two distinct arrays: vertex property values stored in a vertex array and feature property values stored in a feature array. Each array has its own indexing system, which simplifies the organization and retrieval of different types of properties while maintaining efficient storage through separate management of vertex and feature data structures.
Solution Approach 2:
The patent introduces an intermediary indexing mechanism where a single index value serves as a mediator to access multiple vertex values through the vertex array while maintaining separate indexing for feature values. This intermediary approach enables efficient storage without requiring complex multi-dimensional indexing structures.
2Speed
If vertex and feature properties are stored in separate arrays, then data retrieval efficiency is improved, but data structure complexity increases
Solution Approach 1:
The patent divides the property storage structure into segmented arrays: vertex properties in one array and feature properties in another. This segmentation enables direct access to specific property types through simple array indexing, improving retrieval efficiency while the modular structure keeps complexity manageable through clear separation of concerns.
Solution Approach 2:
The patent creates a universal dynamic vector class structure that can handle both vertex and feature properties through a common framework. The separate arrays serve multiple functions: efficient storage, rapid retrieval, and flexible manipulation of different property types, thereby improving performance without proportionally increasing complexity.
3Quantity of substance
If a single index value associates multiple vertex values with each feature value, then memory usage is reduced, but operation complexity increases
Solution Approach 1:
The patent extracts the indexing complexity by separating vertex and feature property management. Instead of using a single complex index to manage both types of properties, the system extracts vertex properties into their own array with dedicated indexing, simplifying operations on each property type while reducing overall memory requirements through efficient separate storage.
Data Source
AI summary
A device may store a data structure including information identifying a geometric relationship between first and second coordinate values of a first data type. The data structure may also include a first array of a first length that includes the first coordinate value located at a position identifiable by a reference value. The data structure may also include a second array of a second length that includes the second coordinate value located at a position identifiable by the reference value. The data structure may also include a third array of a third length that includes an attribute value of a second data type, located at a position identifiable by the reference value. The device may receive an indication that one of the lengths is to be modified, and may modify the data structure so that the first length, the second length, and the third length are equivalent.