Douglas Comer
- AHO74 AHO, A., HOPCROFT, J., AND ULLMAN, j. The design and analysts of computer algorithms, Addison Wesley, Publ. Co., Reading, Mass., 1974. Google Scholar
- AUER76 AuER, R. Schlusselkompress~onen ~n B*-baumen, Diplomarbeit, Tech. Umversitat, Munich, 1976.Google Scholar
- BAYE72 BAYER, R, AND MCCREmHT, C "Organization and maintenance of large ordered indexes," Acta inf. 1, 3 (1972), 173- 189.Google ScholarDigital Library
- BAYE72a BAYER, R. "Binary B-trees for virtual memory," in Proc 1971 ACM SIGFIDET Workshop, ACM, New York, 219-235.Google Scholar
- BAYE73 BAYER, R. "Symmetric binary B-trees. data structure and maintenance algorithms," Acta Inf. 1, 4 (1972), 290-306Google ScholarDigital Library
- BAYE76 BAYER, R., AND METZGER, J. "On encipherment of search trees and random access files," A CM Trans. Database Syst. 1, 1 (March 1976), 37-52. Google Scholar
- BAYE77 BAYER, R, AND UNTERAUER, K. "PrefLx B-trees," A CM Trans. Database Syst. 2, 1 (March 1977), 11-26. Google Scholar
- BAYE77a BAYER, R., AND SCHKOLNICK, M. "Concurrency of operations on B-trees," Acta Inf. 9, 1 (1977), 1-21.Google ScholarDigital Library
- BERL78 BERLINER, H. The B*-tree search algorithm: a best-fwst proof procedure, Tech. Rep. CMU-CA-78-112, Computer Scmnce Dept, Carnegie-Mellon Univ., Pittsburgh, 1978.Google Scholar
- BROW78 BROWN, M "A storage scheme for height-balanced trees," Inf. Process. Lett. 7, 5 (Aug. 1978), 231-232.Google ScholarCross Ref
- BROW78a BROWN, M. "A partial analysis of height-balanced trees," SIAM J. Comput., to appear.Google Scholar
- CLAM64 CLAMPETT, H. "Randomized binary searching with tree structures," Commun. ACM 7, 3 (March 1964), 163-165. Google ScholarDigital Library
- FOST65 FOSTER, C. "Information storage and retrieval using AVL trees," m Proc. A CM 20th Natmnal Conf., ACM, New York, 1965, 192-205. Google Scholar
- GHOS69 GHOSH, S, AND SENKO, M. "File organization: on the selection of random access index points for sequential files," J ACM 16, 4 (Oct. 1969), 569-579. Google ScholarDigital Library
- GUIB77 GUIBUS, L., MCCREIGHT, E., PLASS, M., AND ROBERTS, J. "A new representation for linear lists," m Proc. 9th A CM Symp. Theory of Computing, ACM, New York, 1977, 49-60. Google Scholar
- GUIB78 GUIBAS, L., AND SEDGEWICK, R. "A dichromatic framework for balanced trees," m Proc 19th Syrup. Foundatmns of Computer Science, 1978, 8-21.Google Scholar
- HELD78 HELD, G., AND STONEBRAKER, M. "B- trees reexamined," Commun. A CM 21, 2 (Feb. 1978), 139-143. Google Scholar
- HORO76 HOROWITZ, E., AND SAHNI, S. Fundamentals of data structures, Computer Science Press, Inc., Woodland Hills, Calif., 1976.Google Scholar
- IBM1 OS/VS Virtual Storage Access Method (VSAM) planning gutde, Order No. GC26-3799, IBM, Armonk, N.Y.Google Scholar
- IBM2 OS/VS Vwtual Storage Access Method (VSAM) logw, Order No. SY26-3841, IBM, Armonk, N.Y.Google Scholar
- KARL76 KARLTON, P., FULLER, S., SCROGGS, R., AND KACHLER, E. "Performance of height balanced trees," Commun. A CM 19, 1 (Jan. 1976), 23-28. Google Scholar
- KEEH74 KEEHN, D., AND LACY, J. "VSAM data set design parameters," IBM Syst. J. 3, (1974), 186-212.Google ScholarDigital Library
- KNUT68 KNUTH, D. The art of computer programmmg, Vol. 1. fundamental algorithms, Addison-Wesley Publ. Co., Reading, Mass, 1968. Google Scholar
- KNUT73 Kr~UTH, D. The art of computer programmmg, Vol. 3: sorting and searching, Addison-Wesley Publ. Co, Reading, Mass., 1973. Google Scholar
- MARU77 MARUYAMA, K, AND SMITH, S. "Analysis of design alternatives for virtual memory indexes," Commun. A CM 20, 4 (April 1977), 245-254. Google Scholar
- MAUE75 MAUER, W., AND LEWIS, T. "Hash table methods," Comput. Surv. 7, 1 (March 1975), 5-19. Google Scholar
- MCCR77 MCCREIGHT, E. "Pagination of B*-trees with variable-length records," Commun. ACM 20, 9 (Sept. 1977), 670-674 Google ScholarDigital Library
- MILL77 MILLER, R., PIPPENGER, N., ROSENBERG, A., AND SNYDER, L. Optimal 2-3 trees, IBM Research Rep. RC 6505, IBM Research Lab, Yorktown Heights, N.Y., 1977.Google Scholar
- NIEV74 NIEVERGELT, J. "Binary search trees and file orgamzatmn," Comput. Surv. 6, 3 (Sept. 1973), 195-207. Google Scholar
- ORGA72 ORGANICK, E. The Multics system: an exammatmn of tts structure, MIT Press, Cambridge, Mass., 1972. Google Scholar
- ROSE78 ROSENBERG, A, AND SNYDER, L. "Minimal comparison 2-3 trees," SIAM J. Comput 7, 4 (Nov. 1978), 465-480.Google ScholarCross Ref
- RUBI76 RUBIN, F "Experiments in text file compressmn," Commun. ACM 19, 11 (Nov 1976), 617-623. Google ScholarDigital Library
- SAMA76 SAMADI, B. "B-trees m a system w~th multiple vmws," Inf. Process. Lett. 5, 4 (Oct. 1976), 107-112Google ScholarCross Ref
- SEVE74 SEVERENCE, D. "Identifier search mechnisms, a survey and generahzed model," Comput. Surv 6, 3 (Sept. 1974), 175-194. Google Scholar
- WAGN73 WAGNER, R. "Indexing demgn considerations," IBM Syst. J. 4, (1973), 351-367.Google ScholarDigital Library
- WEDE74 WEDEKIND, H. "On the selection of access paths in a database system," in Data base management (Proc. IFIP Working Conf. Data Base Management) J Klimbie and K. Koffeman (Eds.), Elsevier/ North-Holland Pubhshmg Co., New York, 1974, 385-397.Google Scholar
- WIRT76 WIRTH, N. Algorithms + data structures --programs, Prentlce-HaU Inc., Englewood Cliffs, N J., 1976. Google Scholar
- YAO78 YAO, A. "On random 2-3 trees," Acta Inf. 9, 2 (1978), 159-170.Google ScholarDigital Library
Index Terms
- Ubiquitous B-Tree
Recommendations
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
ADC '00: Proceedings of the Australasian Database ConferenceWhile the B-tree (or the B+-tree) is the most popular index structure in disk-based relational database systems, the T-tree has been widely accepted as a promising index structure for main memory databases where the entire database (or most of them) ...
Ubiquitous Computing: Are We There Yet?
The widespread deployment of technologies like mobile phones continues to drive new applications and to open research opportunities.
Special track on Ubiquitous Computing: Ubiquitous and Pervasive eCommerce and eBusiness: editorial message
SAC '08: Proceedings of the 2008 ACM symposium on Applied computingUbiquitous computing has emerged as one of the principal information and communication technologies that could lead to the achievement of the Ambient Intelligence (AmI) vision. Ambient Intelligence places human beings at the centre of the future ...
Comments