Share Your Research, Maximize Your Social Impacts
Furnish an Index Using the Works of Tree Structures
Journal: International Journal of Computational Engineering Research(IJCER) (Vol.4, No. 10)Publication Date: 2014-11-18
Authors : Chiranjib Mukherjee; Dr.Gyan Mukherjee;
Page : 01-11
Keywords : Indexing Schemes; Primary key; Secondary key; B-tree; B+-tree.;
Source : Download
Find it from : Google Scholar
Abstract
We consider two tree-based indexing schemes that are widely used in practical systems as the basis for both primary and secondary key indexing. We define B-tree and its features, advantages, disadvantages of B-tree. The difference between B+-tree and B-tree has also been discussed. We show the algorithm, examples and figures in the context of B+-tree.
Other Latest Articles
- An Endowed Takagi-Sugeno-type Fuzzy Model for Classification Problems?
- Reversible Records Whacking in Encrypted Images by Reserving Possibility before Encryption?
- Borehole Robot for Rescue of a Child?
- Data Categorization for Detecting Posts in Social Network Using Sequential Tracking
- Best Partition Searching In Public Cloud?
Last modified: 2014-11-18 20:29:14