Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,670,835 papers from all fields of science
Search
Sign In
Create Free Account
X-fast trie
In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Amortized analysis
Binary tree
Computer science
Cuckoo hashing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
A Set Intersection Algorithm Via x-Fast Trie
Bang-Yu Ye
Journal of Computers
2016
Corpus ID: 11185218
This paper proposes a simple intersection algorithm for two sorted integer sequences . Our algorithm is designed based on x-fast…
Expand
2012
2012
Brief Announcment : Hashed Predecessor Patricia Trie-A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems
Sebastian Kniesburges
,
C. Scheideler
2012
Corpus ID: 16066559
The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this…
Expand