Comparison of Advance Tree Data Structures

@article{Patel2012ComparisonOA,
  title={Comparison of Advance Tree Data Structures},
  author={Parth Patel and Deepak Garg},
  journal={CoRR},
  year={2012},
  volume={abs/1209.6495}
}
B-tree and R-tree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization. In this paper different variants of B-tree and R-tree are discussed and compared. Index structures are different in terms of structure, query support, data type support and application. Index structure's structures are discussed first. B-tree and its variants are discussed and them R-tree and its… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 6 times over the past 90 days. VIEW TWEETS

From This Paper

Topics from this paper.
5 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

quot;Implementation and Performance Analysis of Exponential Tree Sorting" International Journal of Computer Applications ISBN: 978-93-80752-86-3

  • Ajit Singh, Dr. Deepak Garg
  • Volume 24–
  • 2011

quot;Inside Win2K NTFS, Part 1", Microsoft Developer Network, Retrieved 2008-04-18

  • Mark Russinovich
  • 2008

quot;Database Management Systems", McGraw-Hill Higher Education, edi

  • Ramakrishnan Raghu, Gehrke Johannes
  • 2000

quot;Sorting and Searching, The Art of Computer Programming", Addison-Wesley, ISBN 0-201-89685-0

  • Knuth, Donald
  • Multiway Trees,
  • 1998

Similar Papers

Loading similar papers…