Results 91 to 100 of about 165 (120)
On the Smoothed Heights of Trie and Patricia Index Trees
Lecture Notes in Computer Science, 2014 Two of the most popular data structures for storing strings are the Trie and the Patricia index trees. Let H n denote the height of the Trie (the Patricia, respectively) on a set of n strings. It is well known that under the uniform distribution model on the strings, for Trie H n /logn → 2 and for Patricia H n /logn → 1, when n approaches infinity ...
Weitian Tong +2 more
exaly +3 more sources
A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure
Information Processing and Management, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masami Shishibori, Jun-Ichi Aoe
exaly +4 more sources
LowSHeP: Low-overhead forwarding and update Solution in ndn with Hexadecimal Patricia trie
2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS), 2019 Named Data Networking (NDN) is designed to cope with today's internet usage by making data as the first class entity irrespective of its source. But, NDN suffers from certain overheads such as storage, data forwarding and update overheads. We address such issues primarily by proposing to keep the entire database in some of the selective special nodes ...
Tanusree Chatterjee +2 more
exaly +3 more sources
Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
Lecture Notes in Computer Science, 2011 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. Our hashed Patricia trie supports Prefixsearch(x) and Insert(x) in O(log |x|) hash table accesses and ...
Sebastian Kniesburges +2 more
exaly +3 more sources