A Shifting Framework for Set Queries

Set queries are fundamental operations in computer networks. This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory. We propose a shifting bloom filter (ShBF) framework for representing and querying...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE/ACM transactions on networking 2017-10, Vol.25 (5), p.3116-3131
Hauptverfasser:	Tong Yang, Liu, Alex X., Shahzad, Muhammad, Dongsheng Yang, Qiaobin Fu, Gaogang Xie, Xiaoming Li
Format:	Artikel
Sprache:	eng
Schlagworte:	algorithms Bloom filters Computer networks Computer science Data structures IEEE transactions Memory management Probabilistic logic Query processing Radiation detectors Servers Set queries State of the art
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!