I am writing some data to a text file(stored in disk) as output from my program. I want to organize the data in the text file in a search tree format so that it facilitates efficient search and replace(through the program itself). I would like to know how to implement the tree structure to be stored in a disk memory.
Related Questions in DATA-STRUCTURES
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
Related Questions in TREE
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
Related Questions in DISK
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
Related Questions in B-TREE
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
Related Questions in RED-BLACK-TREE
- SSAS Excluding a dimension from aggregation on a measure
- Checking Multiple condition in case statement using MDX query
- Approaching mixed granularity date dimensions for operational periods in cube design
- Jedox How to use it? Main ideas behind data points rules, data flows, ETL... Where to find that?
- What cube deployment changes will force a reprocess?
- How can I find out the datatype of measures in MDX?
- Investigate MDX DistinctCount discrepancy
- How to group record by range and put it on rows
- Errors in the OLAP storage engine: The attribute key cannot be found when processing
- How to install ssas AdventureWorks DW with SQL Server 2008 R2
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?
Popular Tags
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)
One of the main practical difficulties of using a tree data-structure on disk is that with naive binary trees data will be "far apart" and trying to access this data will likely cause thrashing as your hard drive attempts to continuously access different locations on disk.
The classic solution to this problem is to use B-trees. The basic idea behind B-trees is that reads from disk are expensive so you should use them as little as possible. This is accomplished by using large nodes; instead of storing only two children, B-trees can have m children. This greatly increases the entropy of each node meaning that it takes far fewer reads to access you data.
Some more reading on B-trees can be found here, the pictures are particularly helpful in my opinion, and several implementations on B-trees can be found here.