Results 101 to 110 of about 165 (120)
, 2012 The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of finding the predecessor in a key set and present an efficient data structure called hashed Predecessor Patricia trie.
Sebastian Kniesburges +1 more
core +3 more sources
A key search algorithm using the compact Patricia trie
1997 IEEE International Conference on Intelligent Processing Systems (Cat. No.97TH8335), 2002 In several key strategies, the Patricia trie has the shallowest trie by eliminating all nodes which have only one arc, and these nodes are called single descendant nodes. For this reason, this trie can retrieve the key faster than any other trie strategies.
M. Shishibori +3 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Accelerating Merkle Patricia Trie with GPU
Proceedings of the VLDB EndowmentMerkle Patricia Trie (MPT) is a type of trie structure that offers efficient lookup and insert operators for immutable data systems that require multi-version access and tamper-evident controls, such as blockchains and verifiable databases. The performance of these systems is critically dependent on the throughput of the underlying index structure MPT.
Yangshen Deng
exaly +2 more sources
A Holonic Homoiconic Agent-Oriented Patricia Trie
Lecture Notes in Networks and Systems, 2023Michéle Cullinan, Duncan Coulter
exaly +2 more sources
TinyTricia – A Space-Optimized Patricia Trie For Transparent Access to Edge Computing Services
2022 IEEE/ACM 15th International Conference on Utility and Cloud Computing (UCC), 2022Hermann Hellwagner
exaly +2 more sources
tMPT: Reconfiguration across Blockchain Shards via Trimmed Merkle Patricia Trie
2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS), 2023Huawei Huang, Zibin Zheng
exaly +2 more sources
Automatic Control and Computer Sciences, 2021
Named data networking (NDN) has emerged as a new architecture derived from the strength and limitations of current Internet architecture to cope with today’s Internet usage. Several NDN features bring potential advantages in routing method over any Content Delivery Network (CDN).
Tanusree Chatterjee +2 more
openaire +1 more source
Named data networking (NDN) has emerged as a new architecture derived from the strength and limitations of current Internet architecture to cope with today’s Internet usage. Several NDN features bring potential advantages in routing method over any Content Delivery Network (CDN).
Tanusree Chatterjee +2 more
openaire +1 more source
Efficient and scalable trie-based algorithms for computing set containment relations
, 2015 Computing containment relations between massive collections of sets is a fundamental operation in data management, for example in graph analytics and data mining applications.
George H L Fletcher +2 more
exaly +2 more sources
The study of Patricia trie data structure for novel path decomposition
TARU Journal of Sustainable Technologies and Computing, 2019Anjali Verma, Linesh Raja, Vinay Verma
openaire +1 more source