Timeline for What is the difference between radix trees and Patricia tries?
Current License: CC BY-SA 3.0
22 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2020 at 21:41 | comment | added | Mario Cervera | The radix establishes the maximum number of children per node. My answer does not say otherwise. If you consider keys as sequences of characters (as in your example), then the radix of an uncompacted trie would be 26 (in the case of the English alphabet). However, when you consider the binary representation of the keys and key comparison is bitwise (as in a typical radix tree) then the radix will be a power of 2. | |
| Mar 6, 2020 at 16:02 | comment | added | Amelio Vazquez-Reina |
Hmm, are you sure that the radix is defined as radix = log2(n) where n is the # of bits you consume from the input and can lookup at a time? I read elsewhere that the radix is the maximum # of children per node, and these two things may not be the same thing, right? E.g. what do you think is the radix for this tree?
|
|
| May 23, 2017 at 12:37 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| Sep 27, 2016 at 22:21 | history | edited | Mario Cervera | CC BY-SA 3.0 |
edited body
|
| Sep 27, 2016 at 22:13 | history | edited | Mario Cervera | CC BY-SA 3.0 |
edited body
|
| Sep 27, 2016 at 22:02 | history | edited | Mario Cervera | CC BY-SA 3.0 |
edited body
|
| Sep 27, 2016 at 13:35 | history | edited | Mario Cervera | CC BY-SA 3.0 |
deleted 140 characters in body
|
| Sep 2, 2016 at 22:32 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 16 characters in body
|
| Sep 2, 2016 at 10:59 | vote | accept | w128 | ||
| Sep 1, 2016 at 22:03 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 7 characters in body
|
| Sep 1, 2016 at 21:49 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 7 characters in body
|
| Sep 1, 2016 at 19:32 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 1569 characters in body
|
| Sep 1, 2016 at 18:42 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 31 characters in body
|
| Sep 1, 2016 at 12:59 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 8 characters in body
|
| Sep 1, 2016 at 12:52 | history | edited | Mario Cervera | CC BY-SA 3.0 |
deleted 18 characters in body
|
| Sep 1, 2016 at 12:47 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 142 characters in body
|
| Sep 1, 2016 at 7:05 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 2 characters in body
|
| Sep 1, 2016 at 0:12 | history | edited | Mario Cervera | CC BY-SA 3.0 |
deleted 16 characters in body
|
| Sep 1, 2016 at 0:07 | history | edited | Mario Cervera | CC BY-SA 3.0 |
added 75 characters in body
|
| Aug 31, 2016 at 23:52 | history | edited | Mario Cervera | CC BY-SA 3.0 |
deleted 25 characters in body
|
| Aug 31, 2016 at 23:47 | review | First posts | |||
| Sep 1, 2016 at 7:20 | |||||
| Aug 31, 2016 at 23:43 | history | answered | Mario Cervera | CC BY-SA 3.0 |
