Bitmap Segmented Data Storage for Fast Querying
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database systems are inadequate for handling user data queries in real-time, particularly when dealing with large numbers of users, as they require iterating over extensive data records to identify user details such as location, usage patterns, and feature testing, leading to inefficiencies and increased computational strain.
Innovation Solution
The method involves creating bitmaps in computer memory to store segmented user data, where each bit represents an entity's membership in a segment based on binary characteristics like location or feature testing, allowing for rapid querying and storage of user segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional database structures (RDBMS or NOSQL) are used to store user data, then data can be stored in a structured format with multiple pieces of information per user, but data access speed deteriorates because the system must iterate over extensive data records to identify user details
Solution Approach 1:
The patent segments user data into distinct binary characteristics (e.g., location, device type, usage patterns) and creates separate bitmaps for each segment. This allows the system to query specific user attributes by checking only relevant bitmaps rather than scanning entire user records, dramatically improving query speed for specific data elements.
Solution Approach 2:
The patent extracts specific binary characteristics from complete user records and stores them as individual bitmap segments. By separating these attributes from the main user data structure, the system can quickly retrieve specific user attributes without accessing the entire user record, reducing query processing time.
2Quantity of substance
If user data is stored in a detailed database structure with multiple data fields per user, then comprehensive user information is preserved, but storage requirements and computational load increase
Solution Approach 1:
The patent transforms user data from a traditional relational structure into a bitmap representation where each user attribute is encoded as a binary value. This parameter transformation reduces the storage space required for each user attribute from multiple bytes to a single bit, while also simplifying computational operations to basic bit manipulation.
Solution Approach 2:
The patent creates simplified bitmap copies of specific user characteristics rather than storing complete user records. These bitmap representations capture essential binary attributes (present/absent, yes/no) without preserving the full complexity of original user data structures, reducing both storage requirements and processing complexity.
Data Source
AI summary
A device, system, and computer implemented method for storing segmented data in a computer memory, the segmented data indicating which of a plurality of entities belong to which of a plurality of segments, each segment accommodating entities sharing a single binary characteristic. A computer receives a list of entity identifiers selected from a sequence of entity identifiers, each entity identifier in the list representing an entity which belongs to a segment; the computer uses the list to create a bitmap in which each bit has a bit position in a bit sequence corresponding to the sequence of entity identifiers. The state of each bit indicates whether the entity identifier representing that position in the sequence identifies an entity belonging in the segment or not; and the bitmap is stored in a memory in association with a segment identifier, as the segmented data.