Abstract:
Multiset membership lookup takes an item e as input and outputs a binary answer whether e is in S and, if so, the subset ID. Multiset membership lookup, more advanced than canonical membership lookup, is crucial in many computing and networking paradigms.
When data arrives as a stream, lookup algorithm design is difficult due to the need for high-speed, high-accuracy, low-memory lookup. This paper presents compact data structures and lookup algorithms that are hardware-implementable, accurate, and support interactive query processing.
First, we propose multi-hash color table, a Bloom filter variant, to compactly encode subset IDs and map item IDs to them. We use state-of-the-art load balancing to create a balanced multi-hash color table to improve compactness.
We finish by designing a memory-efficient batched recording algorithm for batch arrivals. We analyze lookup accuracy, memory, and access efficiency of the proposed algorithms using theoretical and empirical methods.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
