Author:
Ostadzadeh S. Arash,Moulavi M. Amir,Zeinalpour Zeinab
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Batory, D.S.: B + -trees and indexed sequential files: A performance comparison. ACM SIGMOD, 30–39 (1981)
2. Bayer, R., Unterauer, K.: Prefix B-trees. ACM Trans. on Database System 2(1), 11–26 (1977)
3. Bayer, R., McCreight, E.: Organization and maintenance of large ordered indexes. Acta Inform. 1(3), 173–189 (1972)
4. Berliner, H.: The B*-tree search algorithm: a best first proof procedure, Tech. Rep. CMU-CA-78-112 Computer Sci. Depart. Carnegie-Mellon Univ., Pittsburg (1978)
5. Comer, D.: The ubiquitous B-tree. ACM Comput. Surveys 11(2) (June 1979)