Geohashed Data Store Query With Time-Based Partitioning
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems face challenges in efficiently performing geographical searches of subscriber interactions with multiple network providers due to the large volume of data collected from mobile devices, which includes irrelevant information and requires significant processing to filter and locate specific transactions within a designated geographical region and time frame.
Innovation Solution
The method converts interaction information into transaction records with geohash values for precise location encoding and partitions the storage based on time and subscriber ID, enabling faster searches by limiting the search to specific geohash partitions within a designated location and radius, using geohash prefix values to quickly determine relevant records.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all provider records are stored in a single large collection, then complete data is available for searching, but search time and processing complexity increase significantly
Solution Approach 1:
The patent divides the large collection of provider records into multiple time period partitions (e.g., daily, weekly, monthly). Each partition contains a subset of records within a specific time range. This segmentation allows the search system to only access relevant time period partitions instead of scanning all records, dramatically reducing search time while maintaining data completeness across all partitions.
2Reliability
If geographical search covers a large radius area, then more relevant transactions are found, but search complexity and processing time increase
Solution Approach 1:
The patent applies geohash encoding to convert geographical coordinates into hierarchical string codes. The search system uses geohash prefix matching to quickly identify and filter records within the search radius. By processing geohash values in hierarchical order (from coarse to fine granularity), the system efficiently determines which records fall within the search area without complex geometric calculations, reducing search complexity while maintaining accuracy.
3Loss of information
If all interaction information is retained for analysis, then comprehensive insights are obtained, but data storage and processing requirements become unmanageable
Solution Approach 1:
The patent extracts and stores only the essential elements of provider records in a standardized unified format: geohash value, timestamp, and subscriber ID. Non-essential or redundant information is excluded from the partitioned storage structure. This extraction approach maintains the completeness of critical information needed for geographical and temporal analysis while dramatically reducing the volume of data that must be stored and processed.
Data Source
AI summary
A method is disclosed for providing a database of subscriber interactions with a network. The database is configured for geographical searching. A provider record relating to a transaction between a network node and a subscriber is received. A first period provider records collection including provider records from a first predetermined time period is stored. The first period provider records collection is converted into a first period unified records collection. A second period unified records collection is stored having unified records from a second predetermined time period. The second predetermined time period is longer than the first predetermined time period. The second period unified records collection includes sub-period partitions with unified records having timestamps in a first time sub-period. Each sub-period partition includes geohash partitions with unified records having geohash values in a range of values, and each geohash partition includes subscriber partitions with unified records having a common subscriber ID.