Results 51 to 60 of about 1,756,456 (179)
A hashing technique using separate binary tree
Data Science Journal, 2006 It is always a major demand to provide efficient retrieving and storing of data and information in a large database system. For this purpose, many file organization techniques have already been developed, and much additional research is still going on ...
Md Mehedi Masud +3 more
doaj +1 more source
CHAP : Enabling efficient hardware-based multiple hash schemes for IP lookup [PDF]
, 2008 Building a high performance IP lookup engine remains a challenge due to increasingly stringent throughput requirements and the growing size of IP tables.
Cho, S +3 more
core +4 more sources
PARALLEL, SPACE-EFFICIENT HASH TABLE RESIZE [PDF]
, 2015 Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for parallel, space-efficient hash table resize. An aspect may include a hash table that may be resized by incrementally de-allocating buckets of an old ...
Lebar, Justin, Pike, Geoffrey
core +1 more source
Regular and almost universal hashing: an efficient implementation [PDF]
Software: Practice and Experience 47 (10), 2017, 2016 Random hashing can provide guarantees regarding the performance of data structures such as hash tables---even in an adversarial setting. Many existing families of hash functions are universal: given two data objects, the probability that they have the same hash value is low given that we pick hash functions at random.
arxiv +1 more source
On the insertion time of random walk cuckoo hashing
, 2017 Cuckoo Hashing is a hashing scheme invented by Pagh and Rodler. It uses $d\geq 2$ distinct hash functions to insert items into the hash table. It has been an open question for some time as to the expected time for Random Walk Insertion to add items.
Frieze, Alan, Johansson, Tony
core +1 more source
Finding succinct ordered minimal perfect hashing functions [PDF]
, 1992 An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused, and the data are placed in the table in order. A new method for creating ordered minimal perfect hashing functions is presented.
Hirschberg, Daniel S., Seiden, Steven S.
core
Tight Thresholds for Cuckoo Hashing via XORSAT
, 2010 We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key.
Dietzfelbinger, Martin +5 more
core +2 more sources
Multiple Code Hashing for Efficient Image Retrieval [PDF]
arXiv, 2020 Due to its low storage cost and fast query speed, hashing has been widely used in large-scale image retrieval tasks. Hash bucket search returns data points within a given Hamming radius to each query, which can enable search at a constant or sub-linear time cost.
arxiv
OpenFlow table lookup scheme integrating multiple-cell Hash table with TCAM
Tongxin xuebao, 2016 In OpenFlow networks,switches accept flow rules through standardized interfaces,and perform flow-based packet processing.To facilitate the lookup of flow tables,TCAM has been widely used in OpenFlow switches.However,TCAM is expensive and consumes a large
Chun-qiang LI +2 more
doaj +2 more sources
Analysis and Test of Storage Algorithm of Card Reader of Personnel Positioning System
Gong-kuang zidonghua, 2012 The paper analyzed three storage algorithms of chain storage algorithm, hash table storage algorithm and hash binary tree storage algorithm which are applicable to the card reader of personnel positioning system in term of search time and storage ...
ZHANG Feng, XU Zhao, ZHANG Kai-ting
doaj