Multiset Membership Lookup in Large Datasets


The multiset membership lookup function takes an item as input and returns a binary answer indicating whether or not the item belongs to the dataset S and, if it does, the identifier of the subset to which the item belongs if it is determined that the item does belong to one of the g subsets in the dataset. The multiset membership lookup emerges as a pivotal functionality in many different computing and NetWorking paradigms. This lookup is an overlay on the canonical membership lookup, and it is more sophisticated than the canonical membership lookup. The design of a lookup algorithm is a challenging task, and it is made even more difficult when the data items arrive in the form of a stream because of the goal of achieving high-speed, high-accuracy lookup with limited memory cost. In this article, we develop compact data structures and lookup algorithms that are amenable for hardware implementation. These algorithms and data structures guarantee a high level of lookup accuracy and support interactive query processing. We begin by presenting multi-hash color table, a modification of Bloom filter, with the goal of efficiently encoding subset IDs and mapping the ID of an item to its respective subset ID. We further construct a data structure that is more balanced by calling it a balanced multi-hash color table in order to improve the compactness by integrating a load balancing technique that is considered to be state-of-the-art. We finish our work by addressing the case of batch arrivals and designing a batched recording algorithm with the goal of optimizing the efficiency of memory use. In order to characterize and evaluate the performance of the proposed algorithms in terms of lookup accuracy, memory efficiency, and access efficiency, we provide both theoretical and empirical analysis.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here

PROJECT TITLE :MetaFlow: A Scalable Metadata Lookup Service for Distributed File Systems in Data Centers - 2018ABSTRACT:In massive-scale distributed file systems, efficient metadata operations are vital since most file operations
PROJECT TITLE : Low-Power Variation-Tolerant Nonvolatile Lookup Table Design - 2016 ABSTRACT: Emerging nonvolatile recollections (NVMs), such as MRAM, PRAM, and RRAM, are widely investigated to replace SRAM because the configuration
PROJECT TITLE: Quaternary Logic Lookup Table in Standard CMOS - 2015 ABSTRACT: Interconnections are increasingly the dominant contributor to delay, area and energy consumption in CMOS digital circuits. Multiple-valued logic
PROJECT TITLE :Diagnostic Method Combining the Lookup Tables and Fault Models Applied on a Hybrid Electric VehicleABSTRACT:A common scenario in business is to store measurements for various operating points within the lookup tables,
PROJECT TITLE :New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based AlgorithmsABSTRACT:IP address lookup operation determines the longest prefix matching every incoming destination address. As a fundamental

Ready to Complete Your Academic MTech Project Work In Affordable Price ?

Project Enquiry