Two-Tier Storage DBMS for High-Performance Query Processing
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
This paper describes the design and implementation of a two-tier DBMS for handling massive data and providing faster response time. In the present day, the main requirements of DBMS are figured out using two aspects. The first is handling large amounts of data. And the second is providing fast response time. But in fact, Traditional DBMS cannot fulfill both the requirements. The disk-oriented DBMS can handle massive data but the response time is relatively slower than the memory-resident DBMS. On the other hand, the memory-resident DBMS can provide fast response time but they have original restrictions of database size. In this paper, to meet the requirements of handling large volumes of data and providing fast response time, a two-tier DBMS is proposed. The cold-data which does not require fast response times are managed by disk storage manager, and the hot-data which require fast response time among the large volumes of data are handled by memory storage manager as snapshots. As a result, the proposed system performs significantly better than disk-oriented DBMS with an added advantage to manage massive data at the same time.
Abstract
This paper describes the design and implementation of a two-tier DBMS for handling massive data and providing faster response time. In the present day, the main requirements of DBMS are figured out using two aspects. The first is handling large amounts of data. And the second is providing fast response time. But in fact, Traditional DBMS cannot fulfill both the requirements. The disk-oriented DBMS can handle massive data but the response time is relatively slower than the memory-resident DBMS. On the other hand, the memory-resident DBMS can provide fast response time but they have original restrictions of database size. In this paper, to meet the requirements of handling large volumes of data and providing fast response time, a two-tier DBMS is proposed. The cold-data which does not require fast response times are managed by disk storage manager, and the hot-data which require fast response time among the large volumes of data are handled by memory storage manager as snapshots. As a result, the proposed system performs significantly better than disk-oriented DBMS with an added advantage to manage massive data at the same time.
참고문헌 (18)
- Bijit Hore, "Indexing text data under space constraints", Proceedings of the thirteenth ACM international conference on Information and knowledge management CIKM '04 (2004)
- Goetz Graefe, "Transaction support for indexed summary views", Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)
- Sven Helmer, "A performance study of four index structures for set-valued attributes of low cardinality", The International Journal on Very Large Data Bases, 12(3) (2003)
- Zhifeng Chen, "Empirical evaluation of multi-level buffer cache collaboration for storage systems", Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems SIGMETRICS '05, 33(1) (2005)
- Wenhu Tian, "Techniques for automatically sizing multiple buffer pools in DB2", Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)
- Stephane Bressan, "A framework for modeling buffer replacement strategies", Proceedings of the ninth international conference on Information and knowledge management (2000)
- Jonathan Goldstein, "Optimizing queries using materialized views: a practical, scalable solution", Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)
- James J. Lu, "Efficient maintenance of materialized mediated views", Proceedings of the 1995 ACM SIGMOD international conference on Management of data (1995)
- Minwen Ji, "Affinity-based management of main memory database clusters", ACM Transactions on Internet Technology (TOIT), 2(4) (2002)
- Philip Bohannon, "Main-memory index structures with fixed-size partial keys", Proceedings of the 2001 ACM SIGMOD International conference on Management of data SIGMOD '01, 30(2) (2001)
- Tobin J. Lehman, "A Study of Index Structures for Main Memory Database Management Systems", Proceedings of the Twelfth International Conference on Very Large Data Bases (1986)
- Ying Xia, "Dynamic versioning concurrency control for index-based data access in main memory database systems", Proceedings of the tenth international conference on Information and knowledge management (2001)
- Tobin J.Lehman, "An Evaluation of Starburst's Memory Resident Storage Component", IEEE Transactions on knowledge and data Engineering, 4(6) (1992)
- Michael Stonebraker, "Managing Persistent Objects in a Multi-Level Store", SIGMOD Conference, pp.2~11 (1991)
- Kong-Rim Choi, "T*-tree: a main memory database index structure for real time applications", Proceedings of the Third International Workshop on Real-Time Computing Systems Application (RTCSA '96)
- Tobin Jon Lehman, "Design and performance evaluation of a main memory relational database system (t tree)", 박사, pp.1986
- D. Bitton, "Benchmarking simple database operations", Proc. 9th Int. Conf. on Very Large Databases (1983)
- S. Park, "Spatial database management system", Proc. of the KISS Spring Conf, (2003)