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?
284 Views Asked by Anurag Singla At
1
There are 1 best solutions below
Related Questions in JAVA
- Add image to JCheckBoxMenuItem
- How to access invisible Unordered List element with Selenium WebDriver using Java
- Inheritance in Java, apparent type vs actual type
- Java catch the ball Game
- Access objects variable & method by name
- GridBagLayout is displaying JTextField and JTextArea as short, vertical lines
- Perform a task each interval
- Compound classes stored in an array are not accessible in selenium java
- How to avoid concurrent access to a resource?
- Why does processing goes slower on implementing try catch block in java?
- Redirect inside java interceptor
- Push toolbar content below statusbar
- Animation in Java on top of JPanel
- JPA - How to query with a LIKE operator in combination with an AttributeConverter
- Java Assign a Value to an array cell
Related Questions in RED-BLACK-TREE
- Why the leaf node in red black tree is NIL?
- Error in inserting nodes in red black trees
- Understanding Red-Black Tree Traversal of STL multiset in GDB
- Implementing Tree Structure in disk memory
- Binary heap data structure - Application
- Red Black Tree Insertion Not Working
- Difficulty in writing Red Black Tree in F#
- Treemap - Binary Search Tree - Java
- geometric search in red black binary search tree
- Red Black Trees complexities
- insert_rebalance in red-black tree
- STL-like Java Red-black tree / TreeSet/Map and linked lists with non fail-fast/safe iterators
- Looking for efficient way to index files
- How to implement a Multiset with a RedBlack Tree?
- red black tree - element removal without dummys
Related Questions in RADIX-TREE
- What's the space complexity of a radix tree?
- Why in linux kernel radix_tree_preload returns with preemption disabled
- In a relaxed radix balanced (RRB) tree, how is the height determined in practice?
- ordering children of a node in a trie / radix tree
- why does this give a StringIndexOutOfBoundsException?
- How to find if a child node of a binary radix tree is an internal node or leaf node?
- Merge two binary trie
- does `radix_tree_insert` need `spin_lock` to protect it
- Data Structure to do lookup on large number
- To store million keys of million length which will be better red black tree or radix tree?
- Golang: benchmark Radix Tree Lookup
- Reversing (or simplifying) a Cartesian product?
- I want to add my variable in linux page cache
- Is this Patricia tree implementation wrong?
- Patricia Trie for fast retrieval of IPv4 address and satellite data
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 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.