2P Array Data Structure for Privacy-Preserving Unique Resource Counting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for representing users or resources for counting unique instances expose privacy risks as user identifiers can be traced back, necessitating a solution that maintains anonymity while efficiently counting unique users or resources.
Innovation Solution
The implementation of a 2P array data structure that maps hash representations of resource IDs to buckets, allowing for the estimation of unique resources without storing original IDs, ensuring privacy by using a subset of hash bits that cannot be used to reconstruct the original ID.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If user identifiers or hashes of user identifiers are used to represent users for counting unique instances, then the counting accuracy is improved, but user privacy is compromised as identifiers can be traced back to specific users
Solution Approach 1:
The patent extracts only the necessary portion of the hash (specific bits) that are required for counting unique instances while discarding the rest. This extracted subset of hash bits is stored in the 2P array structure, enabling accurate counting without storing or processing the full identifier that could be traced back to users, thus resolving the privacy concern while maintaining counting accuracy.
Solution Approach 2:
Instead of storing original user identifiers or complete hashes, the patent creates a simplified copy - a 2P array structure containing only specific bits from hashed identifiers. This copy preserves the essential information needed for counting unique instances while eliminating the traceability to individual users, effectively decoupling counting accuracy from privacy risk.
2Measurement precision
If complete hash representations are stored to ensure accurate counting of unique resources, then measurement precision is improved, but data structure size and computational complexity increase
Solution Approach 1:
The patent segments the hash representation into specific bits that are necessary for counting purposes. Instead of storing complete hash values, only selected portions (specific bits) are extracted and stored in the 2P array structure. This segmentation reduces the data structure size and computational complexity while preserving the ability to accurately count unique resources.
Solution Approach 2:
The patent transforms the problem from storing one-dimensional complete hash values to using a two-dimensional approach: a 2P array structure where P is a tunable parameter. This dimensional change allows for efficient storage and computation by organizing the specific hash bits in a structured format that balances precision requirements with computational efficiency.
3Device complexity
If a fixed data structure size is used for counting unique instances, then device complexity is reduced, but adaptability to different precision requirements is limited
Solution Approach 1:
The patent introduces a dynamic parameter P that can be adjusted to change the size and characteristics of the 2P array structure. This dynamic approach allows the system to adapt to different precision requirements and resource constraints by simply modifying the value of P, providing versatility without increasing fundamental device complexity. The structure remains simple in form but flexible in configuration.
Data Source
AI summary
Efficient evaluation of sets of resources is disclosed, including: determining a first plurality of representations from identifying information associated with a first set of resources; updating a first data structure corresponding to the first set of resources using portions of respective ones of the first plurality of representations; determining a second plurality of representations from identifying information associated with a second set of resources; updating a second data structure corresponding to the second set of resources using portions of respective ones of the second plurality of representations; and using the first data structure and the second data structure to compute a derived value associated with the first set of resources and the second set of resources.