Results 11 to 20 of about 165 (120)

Storage Replica: Accelerating the Storage Access of the Ethereum Virtual Machine

Applied Sciences
Ethereum’s smart contracts operate on directly addressable storage that is represented as tries. The performance of the Ethereum Virtual Machine (EVM) suffers from slow storage access due to trie encoding, which hampers transaction throughput and ...
Kamil Jezek, Seongho Jeong, Yeonsoo Kim, Bernhard Scholz, Bernd Burgstaller   +4 more
doaj   +1 more source

FC-LSR: Fog Computing-Based Lightweight Sybil Resistant Scheme in 5G-Enabled Vehicular Networks

IEEE Access
Vehicular networks with Fifth-Generation (5G) are a new form of wireless communication that could greatly benefit society by lowering the number of preventable car accidents and entertaining passengers in a variety of ways.
Abdulwahab Ali Almazroi, Monagi H. Alkinani, Mahmood A. Al-Shareeda, Mohammed A. Alqarni, Alaa Atallah Almazroey, Tarek Gaber   +5 more
doaj   +1 more source

Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems [PDF]

, 2014
. The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this paper we address the problem of longest prefix matching and present an efficient data structure called hashed Patricia trie ...
Christian Scheideler, Sebastian Kniesburges   +1 more
core  

Analysis of some trie parameters under probabilistic models [PDF]

, 1992
A word is a string of symbols, finite or infinite in length, from a finite alphabet. Many algorithms in computer science, such as pattern matching, data compression, searching, hashing, and conflict resolution algorithms, require that a set of words be ...
Rais, Bonita Marie
core  

LIMITING DISTRIBUTION FOR THE DEPTH IN PATRICIA TRIES [PDF]

, 2000
This paper establishes the limiting distribution for the depth of keys in a PATRICIA trie. A PATRICIA trie is a variation of the trie, a well-known tree structure, which is a frequently used data structure in many applications of computer science and ...

core  

Do We Really Need to Balance Patricia Tries? [PDF]

, 1987
In this paper, we give exact and asymptotic approximations for variance of the external path length in a symmetric Patricia trie. The problem was open up to now.
Wojciech Szpankowski, Kirschenhofer, Peter, Peter Kirschenhofer, Prodifger, Helmut, Szpankowski, Wojciech, Helmut Prodinger   +5 more
core   +1 more source

k-d range search with binary patricia tries [PDF]

, 2004
We use Patricia tries to represent textual and spatial data, and present a range search algorithm for reporting all k-d records from a set of size n intersecting a query rectangle. Data and queries include both textual and spatial data.
Qingxiu Shi, Bradford G. Nickerson
core  

On unary nodes in tries [PDF]

, 2010
The difference between ordinary tries and Patricia tries lies in the fact that all unary nodes are removed in the latter. Their average number is thus easily determined from earlier results on the size of tries/Patricia tries.
Wagner, Stephan
core   +1 more source

Do we really need to balance Patricia tries? (Extended Abstract) [PDF]

, 2008
In this paper, we give exact and asymptotic approximations for the variance of the external path length in a symmetric Patricia trie. The problem was open up to now. We prove that for the binary Patricia trie, the variance is asymptotically equal to 0.37.
Wojciech Szpankowski, Peter Kirschenhofer, Helmut Prodinger   +2 more
core  

Two-level massive string dictionaries [PDF]

We study the problem of engineering space-time efficient data structures that support membership and rank queries on very large static dictionaries of strings.
Ferragina P., Vinciguerra G., Rotundo M.
core   +3 more sources