This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Evaluation of Starburst's Memory Resident Storage Component
December 1992 (vol. 4 no. 6)
pp. 555-566

As part of the Starburst extensible database project, the authors have designed and implemented a memory resident storage component that can coexist along side traditional disk-oriented storage components. The memory resident storage component shares the code of Starburst's common services, such as query optimization, plan generation, query evaluation, record manipulation, and transaction management. The design of Starburst's memory resident storage component is discussed, contrasted with Starburst's default disk-oriented storage component, and compared to the performance of the two storage components using the Wisconsin Benchmarks. The results show that a memory resident storage component can perform significantly better than a disk-oriented storage component, even when the disk-oriented storage component has all of its data cached in memory. The benchmark results show that, by using memory resident techniques, overall query execution can be improved by up to a factor of four.

[1] A. Ammann, M. Hanrahan, and R. Krishnamurthy, "Design of a memory resident DMS," inProc. Spring COMPCON, Feb. 1985.
[2] M. M. Astrahanet al., "System R: Relational approach to database management,"Trans. Database Syst., vol. 1, no. 1, pp. 97-137, 1976.
[3] D. Bitton, D. DeWitt, and C. Turbyfill, "Benchmarking simple database operations," inProc. 9th Int. Conf. on Very Large Databases, Nov. 1983.
[4] 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.
[5] M. Carey and D. DeWitt, "Extensible database systems," inProc. Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems, Feb. 1986.
[6] M. Carey, B. Lindsay, J. McPherson, and E. Shekita, "An incremental join attachment for Starburst," inProc. 15th Int. Conf. on Very Large Databases," Aug. 1989.
[7] D. D. Chamberlinet al., "A history and evaluation of system R,"Commun. ACM, vol. 24, no. 10, pp. 632-646, Oct. 1981.
[8] D. J. DeWittet al., "Implementation techniques for main memory databases," inProc. ACM Sigmod(Boston, MA), June 18-21, 1984, pp. 1-8.
[9] D. DeWittet al., "The Gamma database machine project,"IEEE Trans. Knowl. Data Eng., vol. 2, Mar. 1990.
[10] M. Eich, "MARS: The design of a main memory database machine," inProc. 4th Int. Workshop on Database Machines, Oct. 1985, pp. 468-481.
[11] M. Eich, "Comparing MMDB systems," Tech. Rep. 87-CSE-6, Southern Methodist Univ., Feb 1987.
[12] G.E. Flores and B. Kirkpatrik, "Optical Lithography Stalls X Rays,"IEEE Spectrum, Vol. 28, No. 10, Oct. 1991, pp. 24-27.
[13] V. Gottemukkala and T. Lehman, "Implementation of a concurrency control mechanism for a memory-resident database system," IBM Res. Rep, IBM Almaden Res. Ctr, 1992.
[14] V. Gottemukkala and T. Lehman, "Locking and latching in a memory-resident database system," inProc. 18th Int. Conf. on Very Large Data Bases, Aug. 1992.
[15] Tandem Performance Group, "A Benchmark of Non-Stop SQL on Debit-Credit Transaction,"Proc. ACM-SIGMOD, ACM, N.Y., 1988, pp. 337-341.
[16] L. M. Haas, J. C. Freytag, G. M. Lohman, and H. Pirahesh, "Extensible query processing in Starburst," inProc. ACM SIGMOD.Portland, OR, May 1989, pp. 377-388.
[17] L. Haaset al., "Starburst mid-flight: As the dust clear,"IEEE Trans. Knowl. Data Eng., vol. 2, Mar. 1990.
[18] T. Haerder, "Implementing a generalized access path structure for a relational database system," inACM Trans. Database Syst., vol. 3, no. 3, pp. 285-298, Sept. 1978.
[19] 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.
[20] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: Addison-Wesley, 1973.
[21] V. Kumar and A. Berger, "Performance measurement of some main memory database recovery algorithms," inProc. 7th Int. Conf. on Data Engineering, Apr. 1991.
[22] T. J. Lehman, "Design and performance evaluation of a main memory relational database system," Ph.D. dissertation, CS Dep., Univ. of Wisconsin-Madison, 1986.
[23] 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.
[24] 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.
[25] 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.
[26] B. Lindsay, "A data management extension architecture," inProc. 1987 ACM-SIGMOD Conf. Management Data, San Francisco, CA. May 1987.
[27] G. Lohman, "Grammar-like functional rules for representing query optimization alternatives,"ACM SIGMOD, 1988.
[28] J. F. Paris and D. D. E. Long, "Resilient memory-resident data objects," inProc. 10th Int. Phoenix Conf. on Computers and Communications, Mar. 1991, pp. 145-151.
[29] K. Salem and H. Garcia-Molina, "Crash recovery mechanisms for main storage database system," Tech. Rep. CS-TR-0340-86, Comput. Sci. Dep., Princeton Univ., Apr. 1986.
[30] K. Salem and H. Garcia-Molina, "System M: A transaction processing testbed for memory-resident data,"IEEE Trans. Knowl. Data Eng., vol. 2, Mar. 1990.
[31] M. Stonebrakeret al., "The implementation of POSTGRES,"IEEE Trans. Knowl. Data Eng., vol. 2, Mar. 1990.
[32] Dbc/1012 Database Computer System Manual, Release 2.0, Document c10-0001-02, Teradata Corp., Nov. 1985.
[33] 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:
Starburst; extensible database project; memory resident storage component; disk-oriented storage components; query optimization; plan generation; query evaluation; record manipulation; transaction management; Wisconsin Benchmarks; database management systems; performance evaluation; query processing; storage management; transaction processing
Citation:
T.J. Lehman, E.J. Shekita, L.-F. Cabrera, "An Evaluation of Starburst's Memory Resident Storage Component," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 6, pp. 555-566, Dec. 1992, doi:10.1109/69.180606
Usage of this product signifies your acceptance of the Terms of Use.