Results 61 to 70 of about 119,966 (182)
IET Communications, 2023 The system wide information management (SWIM) system infrastructure layer uses information‐centric networking (ICN) to implement the cache routing and sharing of air traffic information data.
Lizhe Zhang +3 more
doaj +1 more source
A Shifting Bloom Filter Framework for Set Queries
, 2016 Set queries are fundamental operations in computer systems and applications.This paper addresses the fundamental problem of designing a probabilistic data structure that can quickly process set queries using a small amount of memory.
Fu, Qiaobin +7 more
core +1 more source
Partitioned Learned Bloom Filter
, 2020 Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives. Recently, variations referred to as learned Bloom filters were developed that can provide improved performance in terms of the rate of false positives, by using a learned model for the ...
Vaidya, Kapil +3 more
openaire +2 more sources
Duplicate elimination algorithm for data streams with SKIP Bloom filter
Tongxin xuebao, 2012 According to the dynamic characteristics of data streams,a duplicate elimination algorithm was proposed with low time complexity and high accuracy based on SKIP Bloom filter.A moving cursor and double Bloom filter were used to differentiate history data ...
Hai-na TANG, Xiao-la LIN, Chun-jing HAN
doaj +2 more sources
A Cache Architecture for Counting Bloom Filters: Theory and Application
Journal of Electrical and Computer Engineering, 2011 Within packet processing systems, lengthy memory accesses greatly reduce performance. To overcome this limitation, network processors utilize many different techniques, for example, utilizing multilevel memory hierarchies, special hardware architectures,
Mahmood Ahmadi, Stephan Wong
doaj +1 more source
The Case for Learned Index Structures
, 2018 Indexes are models: a B-Tree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a BitMap-Index as a model to indicate ...
Abadi M. +12 more
core +1 more source
A New Bloom Filter Architecture for FIB Lookup in Named Data Networking
Applied Sciences, 2019 Network traffic has increased rapidly in recent years, mainly associated with the massive growth of various applications on mobile devices. Named data networking (NDN) technology has been proposed as a future Internet architecture for effectively ...
Hayoung Byun, Hyesook Lim
doaj +1 more source
Distributed Collaborative Monitoring in Software Defined Networks
, 2014 We propose a Distributed and Collaborative Monitoring system, DCM, with the following properties. First, DCM allow switches to collaboratively achieve flow monitoring tasks and balance measurement load. Second, DCM is able to perform per-flow monitoring,
Chen, Qian, Li, Xin, Yu, Ye
core +1 more source
Privacy preserving linkage using multiple dynamic match keys
International Journal of Population Data Science, 2019 Introduction Available and practical methods for privacy preserving linkage have shortcomings: methods utilising anonymous linkage codes provide limited accuracy while methods based on Bloom filters have proven vulnerable to frequency-based attacks ...
Sean Randall +3 more
doaj +1 more source
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries. [PDF]
Genome Biol, 2023 Mehringer S +6 more
europepmc +1 more source