Implementation techniques for main memory database systems

ACM SIGMOD Record

Volumn 14, Issue 2, 1984, Pages 1-8

  DeWitt, David J ^a   Katz, Randy H ^b   Olken, Frank ^c   Shapiro, Leonard D ^d   Stonebraker, Michael R ^b   Wood, David A ^b  

^a UNIVERSITY OF WISCONSIN   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^d NORTH DAKOTA STATE UNIVERSITY   (United States)

Author keywords

access methods; access planning; join algorithms; main memory databases; recovery mechanisms

Indexed keywords

ACCESS METHODS; JOINT ALGORITHMS; MAIN MEMORY DATABASES; RECOVERY MECHANISMS;

DATABASE SYSTEMS;

EID: 0021587237     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/971697.602261     Document Type: Article

References (13)

1. Babb, E. “Implementing a Relational Database by Means of Specialized Hardware,” ACM TODS, Vol. 4, No, 1, March 1979.
2. Blasgen, M-W. and K.P. Eswaran, “Storage and Access in Relational Databases,” IBM Systems Journal, Vol. 16, No. 4, 1977.
3. Cesarmi, F. and G. Soda, “Binary Trees Paging”, Information Systems, Vol. 7, No. 4, pp 337-344, 1982.
4. Comer, D., “The Ubiquitous B-tree,” ACM Computing Surveys, Vol. 11, No. 2, June 1979.
5. Date, C.J., “An Introduction to Database Systems,” Third Edition, Addison-Wesley, 1982.
6. Goodman, J. R., “An Investigation of Multiprocessor Structures and Algorithms for Data Base Management,” Electronics Research Laboratory Memorandum No. UCB/ERL M81/33, University of California, Berkeley, May 1981.
7. Gray, J., et. al., ‘The Recovery Manager of the System R Database Manager,” ACM Computing Surveys, Vol. 13, No. 2, June 1981.
8. Knuth, D., “The Art of Computer Programming: Sorting and Searching,” Volume III, Addison-Wesley, Reading, MA, 1973.
9. Kitsuregawa, M. et al, “Application of Hash to Data Base Machine and its Architecture”, New Generation Computing, No. 1, 1983, 62-74.
10. Muntz, R. and R. Uzgalis, “Dynamic Storage Allocation for Binary Search Trees in a Two-Level Memory,” Proceedings of the Princeton Conference on Information Sciences and Systems, No. 4, pp. 345-349, 1970.
11. Reed, D., “Implementing Atomic Actions on Decentralized Data,” ACM Transactions on Computer Systems, V 1, N 1, (March 1983).
12. Selinger, P.G., et. al., “Access Path Selection in a Relational DBMS,” Proceedings of the 1979 SIGMOD Conference on the Management of Data, June 1979.
13. Yao, S. B., and D. DeJong, “Evaluation of Database Access Paths,” Proceedings of the 1978 SIGMOD Conference on the Management of Data, May 1978.