Database List Element Query via Unique Operand Mapping
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional relational databases face inefficiencies in horizontal scaling and querying complex data structures, particularly when dealing with lists of elements, while NoSQL databases offer horizontal scaling but limit query options, making it cumbersome to determine membership within lists.
Innovation Solution
A look-up component is introduced that maps unique operands to list elements, allowing for efficient membership determination with a single operation, independent of list size, by using a membership function and complementary function applied to a membership value and operand, enabling constant-time complexity queries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional relational databases are used to support complex queries, then query capability is improved, but horizontal scaling capability deteriorates
Solution Approach 1:
The patent divides the database system into two distinct components: a relational database component for handling complex queries and a NoSQL database component for handling horizontal scaling. This segmentation allows each component to specialize in its strength without compromising the other, resolving the contradiction between query capability and horizontal scaling capability.
2Stability of the object's composition
If NoSQL databases are used to support horizontal scaling, then horizontal scaling capability is improved, but query option flexibility deteriorates
Solution Approach 1:
The patent segments the database system into specialized components, allowing the NoSQL component to focus on horizontal scaling while the relational component handles query flexibility. This division enables the system to maintain both horizontal scaling capability and query option flexibility simultaneously.
3Device complexity
If direct queries on list elements are not supported, then storage simplicity is maintained, but membership determination efficiency deteriorates
Solution Approach 1:
The patent introduces an intermediary index structure that maps list elements to their positions. This index acts as a mediator between the simple storage format and the efficiency requirement for membership determination, allowing constant-time lookups without compromising storage simplicity.
Solution Approach 2:
The patent performs preliminary action by pre-computing and storing the index mapping of list elements to their positions during data insertion. This preliminary organization enables efficient membership determination later without requiring complex query processing at query time.
Data Source
AI summary
A fast and efficient technique to query which records within a table include a list that includes a specified element, where the queried database does not directly support queries on list elements. To support an update, the technique maps individual elements in a list with unique operand values, such as prime numbers, and calculates a function value, such as multiplication, for the list using the unique operand values, where the function value is then associated with the list. To support a query, the technique uses a complementary function, such as a modulo operation, applied to a unique operand for a specified element and to a function value associated with a list to determine if the function value for the list was generated using the unique operand for the specified element.