Implementation techniques for main memory database systems

作者: David J DeWitt , Randy H Katz , Frank Olken , Leonard D Shapiro , Michael R Stonebraker

DOI: 10.1145/602259.602261

关键词:

摘要: With the availability of very large, relatively inexpensive main memories, it is becoming possible keep large databases resident in memory In this paper we consider changes necessary to permit a relational database system take advantage amounts We evaluate AVL vs B+-tree access methods for databases, hash-based query processing strategies sort-merge, and study recovery issues when most or all fits As expected, B+-trees are preferred storage mechanism unless more than 80--90% A somewhat surprising result that hash based advantageous situations

参考文章(11)
James Richard Goodman, An investigation of multiprocessor structures and algorithms for data base management University of California, Berkeley. ,(1980)
E. Babb, Implementing a relational database by means of specialzed hardware ACM Transactions on Database Systems. ,vol. 4, pp. 1- 29 ,(1979) , 10.1145/320064.320065
F. Cesarini, G. Soda, Binary trees paging Information Systems. ,vol. 7, pp. 337- 344 ,(1982) , 10.1016/0306-4379(82)90032-1
Masaru Kitsuregawa, Hidehiko Tanaka, Tohru Moto-Oka, Application of hash to data base machine and its architecture New Generation Computing. ,vol. 1, pp. 63- 74 ,(1983) , 10.1007/BF03037022
M. W. Blasgen, K. P. Eswaran, Storage and access in relational data bases IBM Systems Journal. ,vol. 16, pp. 363- 377 ,(1977) , 10.1147/SJ.164.0363
S. Bing Yao, David DeJong, Evaluation of database access paths Proceedings of the 1978 ACM SIGMOD international conference on management of data - SIGMOD '78. pp. 66- 77 ,(1978) , 10.1145/509252.509273
David P. Reed, Implementing atomic actions on decentralized data ACM Transactions on Computer Systems. ,vol. 1, pp. 3- 23 ,(1983) , 10.1145/357353.357355
P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, T. G. Price, Access path selection in a relational database management system Proceedings of the 1979 ACM SIGMOD international conference on Management of data - SIGMOD '79. pp. 23- 34 ,(1979) , 10.1145/582095.582099
Douglas Comer, None, Ubiquitous B-Tree ACM Computing Surveys. ,vol. 11, pp. 121- 137 ,(1979) , 10.1145/356770.356776