I want to store multiple keys(String) of million length with their objects associated with it. Such that I have to insert in the data structure(rbtree or radix tree) very frequently and have to search quite a low number of time as compared to insert. Any reccommendations will be appreciated. Thank you.
To store million keys of million length which will be better red black tree or radix tree?
287 Views Asked by Anurag Singla At
1
There are 1 best solutions below
Related Questions in JAVA
- I need the BIRT.war that is compatible with Java 17 and Tomcat 10
- Creating global Class holder
- No method found for class java.lang.String in Kafka
- Issue edit a jtable with a pictures
- getting error when trying to launch kotlin jar file that use supabase "java.lang.NoClassDefFoundError"
- Does the && (logical AND) operator have a higher precedence than || (logical OR) operator in Java?
- Mixed color rendering in a JTable
- HTTPS configuration in Spring Boot, server returning timeout
- How to use Layout to create textfields which dont increase in size?
- Function for making the code wait in javafx
- How to create beans of the same class for multiple template parameters in Spring
- How could you print a specific String from an array with the values of an array from a double array on the same line, using iteration to print all?
- org.telegram.telegrambots.meta.exceptions.TelegramApiException: Bot token and username can't be empty
- Accessing Secret Variables in Classic Pipelines through Java app in Azure DevOps
- Postgres && statement Error in Mybatis Mapper?
Related Questions in RED-BLACK-TREE
- What is the maximum degree of imbalance in a red black tree ? Is it height/2?
- Why does Java HashMap treeify() compare hash values of nodes in the same bucket?
- Why are the worst-case number of Rotations constant for the Red Black tree Delete function, but the Color Flips are not?
- (*p)->left->prev means *p
- When to choose a Red-Black tree over an AVL tree?
- How do I fix my Red Black Tree from rotating unnecessarily?
- How to prove the time complexity of query in interval tree
- Radix Tree vs. Red-black Tree
- Pointer of a Pointer in C: How to use them in RB Trees?
- How does gcc std::set use stl_tree.h to store node keys?
- Doubts about the decrement function of the RB-Tree iterator
- Creating red and black tree from two BSTs
- The implementation of red-black trees gives problems inserting a duplicate number
- Delete large number of nodes from RedBlack Tree Causes Infinite Loop
- Red Black Tree Node Insertion Overwrites Previously Added Node
Related Questions in RADIX-TREE
- Radix tree vs Hashtable
- Radix Tree vs. Red-black Tree
- Is this Patricia tree implementation wrong?
- NodeJS: Creating a tree from a string for http routing
- does `radix_tree_insert` need `spin_lock` to protect it
- Difference between a patricia trie (radix tree with r = 2) and a binary trie?
- In a relaxed radix balanced (RRB) tree, how is the height determined in practice?
- why does this give a StringIndexOutOfBoundsException?
- How is a Patricia tree node deleted?
- Golang Serialize go-radix Tree to file?
- To store million keys of million length which will be better red black tree or radix tree?
- How to create, update and read a radix tree that won't fit into memory?
- Dart Implementation for Patricia/Radix-Tree
- How to access Apache PatriciaTrie TrieEntry key?
- Longest Prefix Lookup from Disk
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Popular # Hahtags
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Since insertion is your primary concern, then you should use a red-black tree because its insertion time complexity is logarithmically in the input size, that is
O(k*log n)withlogbeing base 2 logarithm,kis the size or length of each input andnis the amount of inputs. The radix tree's insert is linear in the sizekof each input and in the amountnof inputs , that isO(k*n), which is worse than for red-black trees, unless many of the string keys share sufficiently long prefixes in order to transformnin a sub-logarithmic expression ofn.