Abstract
Ludo Hashing is a key-value lookup design for networked and distributed systems such as packet forwarding and distributed storage. Ludo costs the least space (3.76 + 1.05l bits per key-value item for l -bit values) among known compact lookup solutions and supports fast lookups, fast updates, and concurrent writing/reading. The experimental results show that Ludo Hashing saves 40% to 80%+ memory cost compared to existing dynamic solutions. It costs only a few GB memory for 1 billion key-value items and achieves over 65 million queries per second on a single node with multiple threads.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.