Visitor-Indexed File Sets for Interaction Data Query Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional logging methods for user interactions in computing systems are computationally expensive and data-intensive due to the sequential organization of log files by time, leading to slower search times and inefficient data retrieval, as user interactions are often spread across numerous large files.
Innovation Solution
Storing user interaction data in visitor-indexed file sets, where data objects from the same user are grouped together based on a unique user identifier, allowing for efficient retrieval by sorting and routing interactions within a specific file set, reducing the need to search multiple files.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If log files are organized sequentially by time with multiple files, then the system can handle large volumes of interaction data, but search times increase significantly and data retrieval becomes inefficient
Solution Approach 1:
The patent segments the large interaction dataset by creating a hierarchical file structure. Interaction data is divided into multiple files organized in directories based on time ranges (e.g., year/month/day), and a separate index file is created that contains references to all interaction data files. This segmentation allows the system to handle large volumes of data while enabling efficient retrieval by only accessing relevant files through the index, rather than scanning all files sequentially.
2Quantity of substance
If log files are split into multiple files to manage data volume, then storage capacity increases, but the system requires additional computing resources to search across multiple files
Solution Approach 1:
The patent introduces an index file as an intermediary between the query system and the interaction data files. The index file contains organized references (paths, timestamps, user identifiers) to all interaction data files, allowing the system to quickly locate and access only the specific files needed for a given query. This intermediary structure eliminates the need to search across all files, significantly reducing computing resources while maintaining high storage capacity.
3Stability of the object's composition
If interaction data is stored in sequential order by timestamp, then data is organized chronologically, but user-specific queries require scanning entire files since user interactions are scattered
Solution Approach 1:
The patent adds another dimension to the data organization by creating a multi-indexed file structure. While interaction data within files remains chronologically ordered (preserving the time dimension), the index file introduces additional organizational dimensions such as user identifiers, date ranges, and file paths. This multi-dimensional indexing allows user-specific queries to efficiently locate all interactions for a particular user across multiple files without scanning entire files, while maintaining chronological integrity within each file.
Data Source
AI summary
Disclosed systems and methods store interaction data by user and date. A computing device receives a unique visitor interaction data representing a first interaction between an entity and a visitor. The computing device accesses a list of file set identifiers. Each file set identifier corresponds to a respective set of users grouped together into a file set. The computing device computes a target file set identifier and matches the target file set identifier to a file set identifier from the list that identifies a file set that stores user interaction data for the entity. The computing device routes the first visitor interaction data to the identified file set. The computing device stores the first visitor interaction data and the second visitor interaction data sorted according to the first timestamp and the second timestamp.