Webgraph Compression of Impression Records for Faster Data Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for storing and accessing large amounts of impression data are inefficient, leading to insufficient storage capacity and slow data access due to the size of the data records.
Innovation Solution
The implementation of webgraph-based compression techniques to compress impression data records, which involves generating a directed link graph representing consumer behavior instances and using properties like locality and similarity to create a compressed list of records, allowing for more efficient storage and faster data access.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If current methods are used to store and access large amounts of impression data, then data can be stored, but storage capacity is insufficient and data access is slow due to the size of the data records
Solution Approach 1:
The patent segments the impression data into multiple components (e.g., user identifier, advertiser identifier, impression data, etc.) and organizes them into a graph structure where nodes represent entities and edges represent relationships. This segmentation allows for more efficient storage and access by only retrieving relevant portions of the data rather than processing entire large records.
Solution Approach 2:
The patent transforms the traditional flat tabular data structure into a multi-dimensional graph structure with nodes and edges representing different entities and their relationships. This dimensional transformation enables more efficient querying and access patterns by traversing the graph structure rather than scanning through large flat files, thereby improving data access speed while managing data size effectively.
2Quantity of substance
If data records are compressed using webgraph-based techniques, then storage efficiency is enhanced and data size is reduced, but the complexity of the compression process increases
Solution Approach 1:
The patent applies preliminary action by pre-processing the impression data into a graph structure during data ingestion, organizing entities and relationships in advance. This preliminary organization enables more efficient compression and faster query execution later, as the data is already structured in an optimized format rather than requiring complex real-time processing during compression operations.
Data Source
AI summary
In general, embodiments of the present invention provide systems, methods and computer readable media for data record compression using graph-based techniques.