Filters








1,562 Hits in 4.6 sec

Hash-Based Paging and Location Update Using Bloom Filters

Pars Mutaf, Claude Castelluccia
2004 Journal on spesial topics in mobile networks and applications  
We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems.  ...  By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently.  ...  In this paper, we propose a hash-based paging and location update procedure (or, hash-based paging) using Bloom filters [1] .  ... 
doi:10.1023/b:mone.0000042501.94708.b2 fatcat:6mxnslo42fgr3phgpjw74yy7mm

Location Updates In Cellular Networks Using Bloom Filters

Kamala Subramaniam, Alan Tharp, Arne Nilsson
2006 30th Annual International Computer Software and Applications Conference (COMPSAC'06)  
This paper analyzes the existing schemes of hash based paging in LU procedures using Bloom Filters (BF) and introduces two new schemes to improve performance: Optimization of Bloom Filters (OBF) and Cumulative  ...  An identifier field in the paging message is coded by applying hashing functions to create a BF and this is used to page a number of mobiles concurrently.  ...  In [13] , the authors discuss how hash paged paging is used in location updates.  ... 
doi:10.1109/compsac.2006.138 dblp:conf/compsac/SubramaniamTN06 fatcat:6sa5vsreczaqbakv4fznkq6voq

BloomFlash: Bloom Filter on Flash-Based Storage

Biplob Debnath, Sudipta Sengupta, Jin Li, David J. Lilja, David H.C. Du
2011 2011 31st International Conference on Distributed Computing Systems  
, and (ii) a hierarchical bloom filter design consisting of component bloom filters, stored one per flash page, that helps to localize reads and writes on flash.  ...  We use two real-world data traces taken from representative bloom filter applications to drive and evaluate our design.  ...  The single flat BF design uses = 6 different hash functions for the bloom filter operations and these hash functions mostly perform random I/Os in the six different flash locations.  ... 
doi:10.1109/icdcs.2011.44 dblp:conf/icdcs/DebnathSLLD11 fatcat:5znigo2c6fblnmurqtx7zdyp7i

Reducing energy of virtual cache synonym lookup using bloom filters

Dong Hyuk Woo, Mrinmoy Ghosh, Emre Özer, Stuart Biles, Hsien-Hsin S. Lee
2006 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems - CASES '06  
In this paper, we study the synonym issue using Windows applications workload and propose a technique based on Bloom filters to reduce synonym lookup energy.  ...  Bloom filters have a very small area overhead making our implementation a feasible and attractive solution for synonym detection.  ...  With the loosely-coupled counting Bloom filter design, the counter array and bit vector can be located in separate physical locations.  ... 
doi:10.1145/1176760.1176783 dblp:conf/cases/WooGOBL06 fatcat:yx2f7pwvvvaonobdon23263s6q

Cheap and Large CAMs for High Performance Data-Intensive Networked Systems

Ashok Anand, Chitra Muthukrishnan, Steven Kappes, Aditya Akella, Suman Nath
2010 Symposium on Networked Systems Design and Implementation  
Our design leverages an efficient flash-oriented data-structure called BufferHash that significantly lowers the amortized cost of random hash insertions and updates on flash.  ...  These are targeted at emerging data-intensive networked systems that require massive hash tables running into a hundred GB or more, with items being inserted, updated and looked up at a rapid rate.  ...  This work is supported in part by an NSF FIND grant (CNS-0626889), an NSF CAREER Award (CNS-0746531), an NSF NetSE grant (CNS-0905134), and by grants from the UW-Madison Graduate School and Cisco.  ... 
dblp:conf/nsdi/AnandMKAN10 fatcat:x5fmehybbjb4feesd64wb2yshu

Muninn

Yangwook Kang, Rekha Pitchumani, Thomas Marlette, Ethan L. Miller
2014 Proceedings of International Conference on Systems and Storage - SYSTOR 2014  
As a flash key-value store, it achieves better life-time and low read/write amplification by eliminating internal data movements and per-object metadata updates using Bloom filters and hash functions.  ...  By doing so, it achieves as few as 1.5 flash page reads per look up and 0.26 flash page writes per insert on average with 50 million 1 KB key-value pairs without incurring data re-organization.  ...  This research was supported in part by the National Science Foundation under award IIP-1266400 and industrial members of the Center for Research in Storage Systems(CRSS).  ... 
doi:10.1145/2611354.2611364 dblp:conf/systor/KangPMM14 fatcat:aeuefdqrgrfgdb2fwliee2u2li

PinK: High-speed In-storage Key-value Store with Bounded Tails

Junsu Im, Jinwook Bae, Chanwoo Chung, Arvind, Sungjin Lee
2020 USENIX Annual Technical Conference  
The key idea in improving the performance of an LSM-tree in a resource constrained environment is to avoid the use of Bloom filters and instead, use a small amount of DRAM to keep/pin the top levels of  ...  However, LSM-tree is difficult to implement in the resource constrained environment of a key-value SSD (KV-SSD) and consequently, KV-SSDs typically use hash-based schemes.  ...  Arvind and Chanwoo Chung was partially funded by NSF (CCF-1725303) and Samsung Semiconductor (GRO grants). PinK source code can be found at [1] and [2] .  ... 
dblp:conf/usenix/ImBCAL20 fatcat:kjejx2t3ofceja63nk64ngxlw4

Buffered Bloom Filters on Solid State Storage

Mustafa Canim, George A. Mihaila, Bishwaranjan Bhattacharjee, Christian A. Lang, Kenneth A. Ross
2010 Very Large Data Bases Conference  
Bloom Filters are widely used in many applications including database management systems.  ...  In our experiments we show that with significantly less memory requirement and fewer hash functions the proposed technique reduces the false positive rate effectively.  ...  To update the filter, k independent hash functions h1, h2, ..., h k all with range {1, ..., β} are used. For each element R ∈ S, the bit locations hi(R), i ∈ {1, 2, ..., k}, are set to 1.  ... 
dblp:conf/vldb/CanimMBLR10 fatcat:sv4xtvywdbev5abirl4wmf5yny

SkimpyStash

Biplob Debnath, Sudipta Sengupta, Jin Li
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
Two further techniques are used to improve performance: (iii) two-choice based load balancing to reduce wide variation in bucket sizes (hence, chain lengths and associated lookup times), and a bloom filter  ...  in each hash table directory slot in RAM to disambiguate the choice during lookup, and (iv) compaction procedure to pack bucket chain records contiguously onto flash pages so as to reduce flash reads  ...  Thus, a key uses as many bytes in RAM (across all bloom filters) as the number of times it is updated.  ... 
doi:10.1145/1989323.1989327 dblp:conf/sigmod/DebnathSL11 fatcat:n2qbbowmlbfnjjkziyfaxdq2dm

PBFilter: A flash-based indexing scheme for embedded systems

Shaoyi Yin, Philippe Pucheral
2012 Information Systems  
We instantiate these principles with data structures and algorithms based on Bloom Filters and show the effectiveness of this approach through a comprehensive analytical performance study.  ...  Previous work adapted traditional indexing methods to cope with Flash constraints by deferring index updates using a log and batching them to decrease the number of rewrite operations in Flash memory.  ...  Acknowledgments The authors wish to thank Nicolas Anciaux, Luc Bouganim and Björn Þó r Jó nsson for fruitful discussions on this work and Jean-Jacques Vandewalle and Patrick Enjolras for their technical  ... 
doi:10.1016/j.is.2012.02.002 fatcat:75nu6dr7ebamnn2aglmoygtyie

Write Amplification Reduction in Flash-Based SSDs Through Extent-Based Temperature Identification

Mansour Shafaei, Peter Desnoyers, Jim Fitzpatrick
2016 USENIX Workshop on Hot Topics in Storage and File Systems  
We compare it with two recently proposed hot data identification algorithms, Multiple Hash Functions and Multiple Bloom Filters, keeping the remainder of the FTL / cleaning algorithm unchanged.  ...  We implement and evaluate this technology in simulation, using a page-mapped FTL with Greedy cleaning and separate hot and cold write frontiers.  ...  Acknowledgments This work has been supported by the National Science Foundation under grant CNS-1149232, and by a NetApp Faculty Fellowship.  ... 
dblp:conf/hotstorage/ShafaeiDF16 fatcat:kalxumwzbjakbhi4u4b7wzuxyi

Q-gram Based Encrypted Codeword Dictionary for Fast Searches Over a Large Collection of Encrypted Unstructured Documents

Mohammed Afzal Khan, Shoab Ahmad Khan
2015 Malaysian Journal of Computer Science  
using separate Bloom filter for a set of bytes.  ...  document using multiple Bloom filters and construct a dictionary over a large collection of encrypted unstructured documents.  ...  Goh algorithm [15] was chosen because it is based on Hash function and Bloom filter.  ... 
doi:10.22452/mjcs.vol28no4.1 fatcat:fbbtu5gd55h6faufcxx3t2ll54

Network Applications of Bloom Filters: A Survey

Andrei Broder, Michael Mitzenmacher
2004 Internet Mathematics  
The aim of this paper is to survey the ways in which Bloom filters have been used and modified in a variety of network problems, with the aim of providing a unified mathematical and practical framework  ...  for understanding them and stimulating their use in future applications.  ...  The authors would like to thank our many colleagues and the anonymous referees that pointed us to related work and helped us improve the presentation of the material.  ... 
doi:10.1080/15427951.2004.10129096 fatcat:ks7d2dy34nahtobvcla6twij7a

Design patterns for tunable and efficient SSD-based indexes

Ashok Anand, Aaron Gember-Jacobson, Collin Engstrom, Aditya Akella
2014 Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems - ANCS '14  
A number of data-intensive systems require using random hashbased indexes of various forms, e.g., hash tables, Bloom filters, and locality sensitive hash tables.  ...  We leverage two key SSD innovations: a) rearranging the data layout on the SSD to combine multiple read requests into one page read, and b) intelligently reordering requests to exploit inherent parallelism  ...  This work is supported in part by National Science Foundation grants CNS-1302041, CNS-1314363, CNS-1330308, CNS-1040757, and CNS-1065134. Aaron Gember-Jacobson is supported by an IBM PhD Fellowship.  ... 
doi:10.1145/2658260.2658270 dblp:conf/ancs/AnandGEA14 fatcat:lsx6tve2qfh4zayf7yzhpphu7m

A sequential indexing scheme for flash-based embedded systems

Shaoyi Yin, Philippe Pucheral, Xiaofeng Meng
2009 Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09  
We instantiate these principles with data structures and algorithms based on Bloom Filters and show the effectiveness of this approach through a comprehensive performance study.  ...  Previous work adapted traditional indexing methods to cope with Flash constraints by deferring index updates using a log and batching them to decrease the number of rewrite operations in Flash memory.  ...  ACKNOWLEDGMENTS The authors wish to thank Luc Bouganim, Dennis Shasha and Björn Þór Jónsson for fruitful discussions on this paper and Jean-Jacques Vandewalle and Laurent Castillo from Gemalto for their  ... 
doi:10.1145/1516360.1516429 dblp:conf/edbt/YinPM09 fatcat:ktx6mxbqf5a7ldpr2cirpsmm2e
« Previous Showing results 1 — 15 out of 1,562 results