This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Main Memory Database Systems: An Overview
December 1992 (vol. 4 no. 6)
pp. 509-516

Main memory database systems (MMDBs) store their data in main physical memory and provide very high-speed access. Conventional database systems are optimized for the particular characteristics of disk storage mechanisms. Memory resident systems, on the other hand, use different optimizations to structure and organize data, as well as to make it reliable. The authors survey the major memory residence optimizations and briefly discuss some of the MMDBs that have been designed or implemented.

[1] A. C. Ammann, M. B. Hanrahan, and R. Krishnamurthy, "Design of a memory resident DBMS," inProc. IEEE COMPCOM Conf., 1985.
[2] D. Bitton, M. Butrico Hanrahan, and C. Turbyfill, "Performance of complex queries in main memory database systems," inProc. Third Int. Conf. Database Eng., Los Angeles, CA, Feb. 1987, pp. 72-81.
[3] G. Copeland, T. Keller, R. Krishnamurthy, and M. Smith, "The case for safe RAM." inProc. 15th Conf. Very Large Data Bases, Am sterdam, Aug. 1989.
[4] G. Copeland, M. Franklin, and G. Weikum, "Uniform object management, " inProc. Int. Conf. Extending Database Tech., Venice, Mar. 1990.
[5] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[6] M. H. Eich, "A classification and comparison of main memory database recovery techniques," inProc. 1987 IEEE Database Engineering Conf., 1987.
[7] M. H. Eich, "MARS: The design of a main memory database machine," inProc. Int. Workshop on Database Machines, Oct. 1987.
[8] H. Garcia-Molina and K. Salem, "High performance transaction processing with memory resident data," inProc. Int. Workshop on High Performance Transaction Systems, Paris, Dec. 1987.
[9] D. Gawlick and D. Kinkade, "Varieties of concurrency control in IMS/VS Fast Path,"Data Eng. Bull., vol. 8, no. 2, pp. 3-10, June 1985.
[10] J. Gray and F. Putzolu, "The 5 minute rule for trading memory for disc accesses and the 10 byte rule for trading memory for CPU time," inProc. 1987 ACM SIGMOD Conf., San Francisco, CA, May 1987, pp. 395-398.
[11] J. N. Gray and A. Reuter, "Transaction Processing: Concepts and Techniques," Morgan Kaufman, San Mateo, Calif., Vol. 1,067, 1993.
[12] L. Gruenwald and M. H. Eich, "MMDB reload algorithms," inProc. ACM SIGMOD Conf., Denver, CO, May 1991, pp. 397-405.
[13] R. B. Hagmann, "A crash recovery scheme for a memory-resident database system,"IEEE Trans. Comput., vol. C-35, no. 9, pp. 839- 843, Sept. 1986.
[14] M. Y. Kim, "Synchronized disk interleaving," inProc. IEEE Trans. Comput., vol. C-35, no. 11, pp. 978-988, Nov. 1986.
[15] T. J. Lehman and M. J. Carey, "Query processing in main memory database management systems," inProc. ACM-SIGMOD Conf., Washington, DC, 1986, pp. 239-250.
[16] T. J. Lehman and M. J. Carey, "A study of index structures for main memory database management systems," inProc. 12th Conf. on Very Large Data Bases, Aug. 1986.
[17] T. J. Lehman and M. J. Carey, "A recovery algorithm for a high-performance memory-resident database system," inProc. ACM SIGMOD Conf., San Francisco, CA, May 1987, pp. 104-117.
[18] K. Li and J. Naughton, "Multiprocessor main memory transaction processong," inProc. Int. Symp. Databases Parallel Distributed Syst., ACM, IEEE-CS, Austin, TX, Dec. 1988, pp. 177-187: also, CS-TR-159-88, Comput. Science Dep., Princeton Univ., June 1988.
[19] D. A. Patterson, G. Gibson, and R. H. Katz, "A case for redundant arrays of inexpensive disks (RAID)," inProc. ACM SIGMOD, Chicago, IL, June 1-3, 1988, pp. 109-116.
[20] P. Pucheral, J.-M. Thevenin, and P. Valduriez, "Efficient main memory data management using the DBGraph storage model," inProc. 16th Conf. on Very Large Data BasesBrisbane, 1990, pp. 683-695.
[21] A. Reuter, "Performance analysis of recovery techniques,"ACM Trans. Database Syst., vol. 9, no. 4, pp. 526-559, Dec. 1984.
[22] K. Salem and H. Garcia-Molina, "Disk striping," inProc. IEEE Data Eng., pp. 336-342, Feb. 1986.
[23] K. Salem and H. Garcia-Molina, "Checkpointing memory-resident databases," inProc. 5th Data Eng. Conf., Feb. 1989, pp. 452-462.
[24] K. Salem and H. Garcia-Molina, "System M: A transaction processing testbed for memory resident data,"IEEE Trans. Knowl. Data Eng., vol. 2, pp. 161-172, Mar. 1990.
[25] M. Stonebraker, "Managing persistent objects in a multi-level store," inProc. ACM SIGMOD Conf., Denver, CO, May 1991, pp. 2-11.
[26] K.-Y. Whang and R. Krishnamurthy, "Query optimization in a memory-resident domain relational calculus system,"ACM Trans. Database Syst., vol. 15, no. 1, pp. 67-95, Mar. 1990.

Index Terms:
main memory databases; distributed databases; relational databases; concurrency control; physical memory; high-speed access; disk storage mechanisms; memory residence optimizations; concurrency control; distributed databases; relational databases; storage management
Citation:
H. Garcia-Molina, K. Salem, "Main Memory Database Systems: An Overview," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 6, pp. 509-516, Dec. 1992, doi:10.1109/69.180602
Usage of this product signifies your acceptance of the Terms of Use.