Hashing-Based Memory Index for RFID Duplicate Scan Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing computing systems for RFID-based inventory scanning face inefficiencies when multiple scanning devices are used simultaneously, leading to duplicate scans and increased computational overhead due to database interactions in large-scale retail systems.
Innovation Solution
A computer-implemented method that combines RFID values with task identifiers using a hashing function to generate a memory index, allowing for efficient storage and detection of duplicate scans across multiple devices without the need for database comparisons, using a common memory structure distributed across multiple servers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple scanning devices are used simultaneously for inventory counting, then the productivity of inventory scanning is improved, but duplicate scans occur and computational overhead increases
Solution Approach 1:
The patent introduces a common memory structure as an intermediary between multiple scanning devices and the central processing system. This shared memory space allows all scanning devices to write RFID values simultaneously without conflict, while enabling efficient duplicate detection through direct memory comparison rather than database queries. The memory structure acts as a buffer that decouples the high-speed scanning operation from the slower duplicate detection and counting processes.
Solution Approach 2:
The system segments the inventory management functionality into distinct components: RFID value collection by multiple scanning devices, duplicate detection through hashing and memory comparison, and final counting. By separating the scanning function from the duplicate detection function and using a shared memory structure, the system allows parallel operation of multiple scanners without requiring them to coordinate or wait for each other, thus maintaining high productivity while ensuring accuracy.
2Reliability
If database comparisons are used to detect duplicate scans, then scan accuracy is maintained, but computational overhead and processing time increase
Solution Approach 1:
The patent employs hashing functions to transform RFID values into compact memory indices, creating a simplified representation that is much smaller and faster to process than full database records. The hashing approach trades some computational complexity in the hashing step for dramatically faster memory access and comparison operations, effectively using a 'cheap' hashing operation to replace expensive database queries.
Solution Approach 2:
Instead of querying the central database to check for duplicates, the system creates local copies of RFID values in a common memory structure accessible to all scanning devices. This allows duplicate detection to occur in-memory using simple comparison operations rather than requiring communication with and queries to the central database, significantly reducing processing time while maintaining accuracy.
3Reliability
If separate memory structures are used for each scanning task, then data isolation is improved, but device complexity and memory usage increase
Solution Approach 1:
The patent merges the memory structures of multiple scanning tasks into a single common memory space that is shared by all scanning devices. This unified memory structure eliminates the need for separate memory allocations for each task, reducing overall complexity and memory usage. The common memory structure maintains data isolation through the use of hashing functions that map different RFID values to distinct memory locations, preventing cross-contamination between tasks while simplifying the overall architecture.
Data Source
AI summary
A computer-implemented method includes receiving data comprising an RFID value transmitted by an RFID tag during a scanning task and an identifier for the scanning task. The RFID value and the identifier for the scanning task are combined to form a key and the key is applied to a hashing function to generate a memory index. The received data is stored at a memory location indicated by the memory index.