Radix tree

Known as: PATRICIA, Radixtree, Crit-bit tree 
In computer science, a radix tree (also radix trie or compact prefix tree) is a data structure that represents a space-optimized trie in which each… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Recent interest in persistent memory (PM) has stirred development of index structures that are efficient in PM. Recent such… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2015
2015
Efficient main-memory index structures are crucial to main-memory database systems. Adaptive Radix Tree (ART) is the most recent… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Main memory capacities have grown up to a point where most databases fit into RAM. For main-memory database systems, index… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Finding frequent patterns in a continuous stream of transactions is critical for many applications such as retail market data… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Abstract We cast the ranking problem as (1) multiple classification (“Mc”) (2) multiple ordinal classification, which lead to… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Jorma Paavonen, David Jenkins, F Xavier Bosch, Paulo Naud, Jorge Salmerón, Cosette M Wheeler, Song-Nan Chow, Dan L Apter, Henry C… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
How much do cultural biases affect economic exchange? We try to answer this question by using the relative trust European… (More)
  • table 3
  • table 5
  • table 6
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present algorithms for efficient searching of regular expressions on preprocessed text, using a Patricia tree as a logical… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper presents a new perspective on the traditional AI task of problem solving and the techniques of abstraction and… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Packet forwarding for OSI poses strong challenges for routing lookups: the algorithm must be able to efficiently accommodate… (More)
  • figure 1
Is this relevant?