Near-Optimal Data Structure for Approximate Range Emptiness Problem in Information-Centric Internet of Things

The approximate range emptiness problem requires a memory-efficient data structure D to approximately represent a set S of n distinct elements chosen from a large universe U= {0,1,⋯,N-1} and answer an emptiness query of the form “S∩[a;b]=0?” for an interva...

Full description

Bibliographic Details
Main Authors: Xiujun Wang, Zhi Liu, Yan Gao, Xiao Zheng, Xianfu Chen, Celimuge Wu
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8633895/

Similar Items