并行内存数据库快速事务提交与高效恢复方法研究
|
摘要
本文研究面向Cluster环境的并行内存数据库的快速事务提交与高效恢复方法,主要包括三个方面的内容:快速事务提交和日志处理、检查点操作、并行数据库的恢复。
本文改进单阶段提交协议,通过日志信息的并行写入硬盘,充分利用IO带宽,加快事务的提交,避免更新密集型应用中日志的堆积。传统两阶段锁协议导致读写事务的加锁冲突,降低系统的吞吐量。本文把加锁协议和临时版本管理结合起来,通过版本管理实现无堵塞的读事务,避免了读写事务之间的互相等待。
基于多版本管理实现一致检查点,必须付出版本管理的空间开销代价。本文采用元组级别的版本管理和版本共享技术,版本管理的开销大大降低。在内存越来越大的情况下,这些代价是合理的,因为系统事务处理能力和检查点操作效率得到了较大提高。
本文提出基于数据分区的并行恢复算法,实现了恢复过程的系统可用性。恢复过程中,各个站点的恢复工作是相互独立的,同时利用差分日志的特点,实现了数据分区之间,日志之间、数据和日志之间的并行处理,加快了恢复过程,减少了站点恢复的总时间。
本文使用J-SIM软件包建模进行仿真实验,验证了所提方案的可行性和效率。结果显示:(1)由于使用快速提交技术和并行日志写入,事务响应时间从50ms降低到21ms;(2)使用并行恢复算法,站点失败的恢复时间从65 s降低到28秒;(3)查询事务的吞吐量比模糊检查点高67%左右,而更新事务的吞吐量比模糊检查点高7.8%左右; (4)在80%更新事务的密集场景中,版本管理的空间开销在11%左右。(5)实验测试的恢复过程中的4个(1/4)时间段,系统平均吞吐量分别为90.2Ktps、98.3Ktps、104.5Ktps、107.7Ktps,事务的平均响应时间分别为273ms、32.3ms、9.2ms、5.32ms。
该论文有图49幅,表5个,参考文献121篇。
The dissertation focuses on fast committing protocol and higly efficient recovery schems for parallel main memory database on clusters, including: fast transaction committing protocol and logging, checkpointing, and recovery of the parallel main memory database.
The dissertation has enhanced traditional one phase committing protocol, and propose using parallel log writing to fully utilize the IO bandwidth to accelerate transaction committing, thus avoided log accumulation in update intensive applications. Traditional two phase locking leads to lock conficts between read only transations and update transactions, which lowers down system throughput. A novel transaction schedule protocol is proposed in this dissertation, transient versioning is combined with locking to support non blocking reading, and avoid conflicts between reader and writers.
The consitent checkpointing is implemented on multi versiong, thus space overhead is necessary. Since multi versioning is done on tuple level, and version sharing is used, the overhead is reduced. At present, the capacity of main memory is getting larger and larger, the cost is reasonable, because the efficiency of transaction processing and checkpointing is improved.
A partition based parallel recovery algorithm is proposed to provide system availability during recovery. During recovery, recovery of individual sites is independent, parallelism of three types, namely parallelism between partition, parallelism between log disks, and parallelism between data and log, are exploited to speedup recovery, the total recovery time is cut down.
The author has used the J-SIM software package to build a simulation system and conducted a seria of experiments, the feasibility and efficiency of the scheme proposed in this dissertation are verified. Experiment results show that: (1) Transaction response time is cut down owing to parallel log writing, from 50ms to 21 ms when log disk number is 8. (2) Total recovery time of the failure site is reduced from 65s to 28s. (3) The scheme achives higher performance than fuzzy checkpointing when the system is performing checkpointing. Query throughput of the scheme improves by about 67 percent over fuzzy checkpointing, and update transaction throughput improves by about 7.8 percent over fuzzy checkpointing. (4) The space overhead is around 11 percent in update intensive senarios, the overhead is acceptable. (5) The final experiment is conducted to measure system throughput and transaction response times during recovery.during four quarters of the recovery, system throughputs are 90.2Ktps、98.3Ktps、104.5Ktps、107.7Ktps, and avarage transaction response time are 273ms、32.3ms、9.2ms、5.32ms respectively.Experimnets results have verified the effetiveness and efficiency of the proposed scheme.
The dissertation includes 49 digrams, and 5 tables, and refers to 121 papers.
本文改进单阶段提交协议,通过日志信息的并行写入硬盘,充分利用IO带宽,加快事务的提交,避免更新密集型应用中日志的堆积。传统两阶段锁协议导致读写事务的加锁冲突,降低系统的吞吐量。本文把加锁协议和临时版本管理结合起来,通过版本管理实现无堵塞的读事务,避免了读写事务之间的互相等待。
基于多版本管理实现一致检查点,必须付出版本管理的空间开销代价。本文采用元组级别的版本管理和版本共享技术,版本管理的开销大大降低。在内存越来越大的情况下,这些代价是合理的,因为系统事务处理能力和检查点操作效率得到了较大提高。
本文提出基于数据分区的并行恢复算法,实现了恢复过程的系统可用性。恢复过程中,各个站点的恢复工作是相互独立的,同时利用差分日志的特点,实现了数据分区之间,日志之间、数据和日志之间的并行处理,加快了恢复过程,减少了站点恢复的总时间。
本文使用J-SIM软件包建模进行仿真实验,验证了所提方案的可行性和效率。结果显示:(1)由于使用快速提交技术和并行日志写入,事务响应时间从50ms降低到21ms;(2)使用并行恢复算法,站点失败的恢复时间从65 s降低到28秒;(3)查询事务的吞吐量比模糊检查点高67%左右,而更新事务的吞吐量比模糊检查点高7.8%左右; (4)在80%更新事务的密集场景中,版本管理的空间开销在11%左右。(5)实验测试的恢复过程中的4个(1/4)时间段,系统平均吞吐量分别为90.2Ktps、98.3Ktps、104.5Ktps、107.7Ktps,事务的平均响应时间分别为273ms、32.3ms、9.2ms、5.32ms。
该论文有图49幅,表5个,参考文献121篇。
The dissertation focuses on fast committing protocol and higly efficient recovery schems for parallel main memory database on clusters, including: fast transaction committing protocol and logging, checkpointing, and recovery of the parallel main memory database.
The dissertation has enhanced traditional one phase committing protocol, and propose using parallel log writing to fully utilize the IO bandwidth to accelerate transaction committing, thus avoided log accumulation in update intensive applications. Traditional two phase locking leads to lock conficts between read only transations and update transactions, which lowers down system throughput. A novel transaction schedule protocol is proposed in this dissertation, transient versioning is combined with locking to support non blocking reading, and avoid conflicts between reader and writers.
The consitent checkpointing is implemented on multi versiong, thus space overhead is necessary. Since multi versioning is done on tuple level, and version sharing is used, the overhead is reduced. At present, the capacity of main memory is getting larger and larger, the cost is reasonable, because the efficiency of transaction processing and checkpointing is improved.
A partition based parallel recovery algorithm is proposed to provide system availability during recovery. During recovery, recovery of individual sites is independent, parallelism of three types, namely parallelism between partition, parallelism between log disks, and parallelism between data and log, are exploited to speedup recovery, the total recovery time is cut down.
The author has used the J-SIM software package to build a simulation system and conducted a seria of experiments, the feasibility and efficiency of the scheme proposed in this dissertation are verified. Experiment results show that: (1) Transaction response time is cut down owing to parallel log writing, from 50ms to 21 ms when log disk number is 8. (2) Total recovery time of the failure site is reduced from 65s to 28s. (3) The scheme achives higher performance than fuzzy checkpointing when the system is performing checkpointing. Query throughput of the scheme improves by about 67 percent over fuzzy checkpointing, and update transaction throughput improves by about 7.8 percent over fuzzy checkpointing. (4) The space overhead is around 11 percent in update intensive senarios, the overhead is acceptable. (5) The final experiment is conducted to measure system throughput and transaction response times during recovery.during four quarters of the recovery, system throughputs are 90.2Ktps、98.3Ktps、104.5Ktps、107.7Ktps, and avarage transaction response time are 273ms、32.3ms、9.2ms、5.32ms respectively.Experimnets results have verified the effetiveness and efficiency of the proposed scheme.
The dissertation includes 49 digrams, and 5 tables, and refers to 121 papers.
引文
[1] McObject LLC. In-Memory Database Systems Beyond the Terabyte Size Boundary. 2007-12-1/2008-1-15. http://www.mcobject.com.
[2] H. Garcia-Molina, K. Salem. Main Memory Database Systems: An Overview. IEEE TRANSACTIONS ON KNOWLEDGE AND DATAENGINEERING, VOL4, 1992, pp. 509-516.
[3] Cambridge Consulting. The Optimal Interconnect for High Performance Clustered Environments: A Look at Infini-Band and Hewlett-Packard’s Implementation. 2004
[4] Kawashima H., Toyama M., Imai M., and Anzai Y. Providing Persistence for Sensor Streams with Light Neighbor WAL. In: Satoshi Ogawa. Proceedings of Pacific Rim International Symposium on Dependable Computing (PRDC2002). Tsukuba City, Japan:IEEE Computer Society, 2002. 257-264.
[5] Kawashima, H., Imai, M., Anzai, Y. Accelerating Remote Logging by Two Level Asynchronous Checkpointing. In: Shinji Ota.7th International Conference on Mobile Data Management, Nara, Japan:IEEE Computer Society, 2006. 127– 137.
[6] Hideyuki Kawashima, Michita Imai, Yuichiro Anzai. Providing Persistence for Sensor Data Streams by Remote WAL. In: A. Min Tjoa, Juan Trujillo Eds. Proceedings of 8th International Conference Data Warehousing and Knowledge Discovery (DaWaK 2006). Krakow, Poland:Lecture Notes in Computer Science 4081 Springer, 2006. 524-533.
[7] Newhall, Tia Amato, Daniel Pshenichkin, Alexandr. Reliable adaptable Network RAM. In: Takahiro Katagiri. Proceedings of 2008 IEEE International Conference on Cluster Computing. Tsukuba, Japan: IEEE Computer Society Press, 2008.2-12.
[8] Kai Li, Jeffrey F. Naughton. Multiprocessor Main Memory Transaction Processing. Proceedings of International Symposium on Databases in Parallel and Distributed Systems, 2000, pp.177 - 187.
[9] M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. O’Neil, P. O’Neil, A. Rasin, N. Tran, and S. Zdonik. C-Store: A column-oriented dbms. In VLDB’05, pages 553–564, 2005.
[10] Robert Kallman, Hideaki Kimura, Jonathan Natkins, Andrew Pavlo,Alexander Rasin, Stanley Zdonik,Evan P. C. Jones, Samuel Madden, Michael Stonebraker, Yang Zhang, John Hugg, Daniel J. Abadi. H-store: a high-performance, distributed main memory transaction processing system. Proceedings of the VLDB Endowment, 2008, Pages 1496-1499.
[11] A. Ailamaki, D. J. DeWitt, M. D. Hill, M. Skounakis. Weaving Relations for Cache Performance. VLDB, 2001, pp. 169-180.
[12] M. Stonebraker, C. Bear, U. Cetintemel, M. Cherniack, T. Ge, N. Hachem, S. Harizopoulos, J. Lifter, J. Rogers, and S. B. Zdonik. One size fits all? part 2: Benchmarking studies. In CIDR’07, pages 173–184, 2007.
[13] M. Stonebraker and U. Cetintemel.”one size fits all”: An idea whose time has come and gone. In ICDE’05, pages 2–11, 2005.
[14] The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0). http://www.tpc.org/tpcc/spec/tpcc current.pdf, June 2007.
[15] S. Manegold, P. Boncz, M. L. Kersten. Generic Database Cost Models for Hierarchical Memory Systems. VLDB, 2002.
[16] M. Zukowski, S. Héman, N. Nes, P. Boncz. Super-Scalar RAM-CPU Cache Compression. ICDE, 2006.
[17] D. J. Abadi, S. R. Madden, M. C. Ferreira. Integrating Compression and Execution in Column-Oriented Database Systems. SIGMOD, 2006.
[18] Z. Chen, J. Gehrke, F. Korn. Query Optimization In Compressed Database Systems. SIGMOD, 2001.
[19] S. Chen, A. Ailamaki, P. B. Gibbons. Improving Hash Join Performance through Prefetching. ICDE, 2004, pp. 116-127.
[20] S. Manegold, P. Boncz, N. Nes, M. Kersten. Cache-Conscious Radix-Decluster Projections. VLDB, 2004.
[21] A. Shatdal, C. Kant, J. F. Naughton. Cache Conscious Algorithms for Relational Query Processing. VLDB, 1994, pp. 510-521.
[22] P. Boncz, M. Zukowski, N. Nes. MonetDB/X100: Hyper-Pipelining Query Execution. CIDR, 2005.
[23] J. Zhou, K. A. Ross. Buffering Database Operations for Enhanced Instruction Cache Performance. SIGMOD, 2004, pp. 191-202.
[24] Peter Alexander Boncz. Monet: A Next-Generation DBMS Kernel For Query-Intensive Applications. Ph.D. Thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, May 2002.
[25] S. Manegold. Understanding, Modeling, and Improving Main-Memory Database Performance. Ph.D. Thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, Dec 2002.
[26] A. Ailamaki, D. J. DeWitt, M. D. Hill, D. A.Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proc. VLDB, 1999, pp. 266-277.
[27] B. He, Q, Luo. Cache-Oblivious Nested-Loop Joins. CIKM, 2006.
[28] B. He, Q, Luo. Cache-Oblivious Query Processing. CIDR, 2007, pp. 44-55.
[29] S. Manegold, P. Boncz, M. L. Kersten. What happens during a Join? Dissecting CPU and Memory Optimization Effects. VLDB, 2000, pp. 339-350.
[30] M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era: (it’s time for a complete rewrite). In VLDB’2007, pages 1150–1160, 2007.
[31] H. Luan, X. Du, S. Wang, Y. Ni, Q, Chen. J+-Tree: A New Index Structure in Main Memory. DASFAA, 2007.
[32] P. Bohannon, P. Mcllroy, R. Rastogi. Main-Memory Index Structures with Fixed-Size Partial Keys. SIGMOD, 2001.
[33] S. Chen, P. B. Gibbons, T. C. Mowry, G. Valentin. Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance. SIGMOD, 2002.
[34] S. Chen, P. B. Gibbons, T. C. Mowry. Improving Index Performance through Prefetching. SIGMOD, 2001, pp. 235-246.
[35] K. A. Ross. Conjunctive Selection Conditions in Main Memory. PODS, 2002.
[36] Y. Zhang, Z. Chen, Y. Zhou. Efficient Execution of Multiple Queries on Deep Memory Hierarchy. JCST, Vol 22(2), 2007, pp. 273-279.
[37] M. A. Bender, M. Farach-Colton, B. C. Kuszmaul. Cache-Oblivious String B-trees. PODs, 2006.
[38] H.Jagadish etal. Dali: A high performance main memory storage manager. In Proc. Of the 20th VLDB Conf., pages48-59, 1994
[39] Oracle TimesTen In-Memory Database Architectural Overview Release 6.0,2007
[40] Peter Alexander Boncz. Monet: A Next-Generation DBMS Kernel For Query-Intensive Applications. Ph.D. Thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, May 2002.
[41] M. A. Bender, M. Farach-Colton, B. C. Kuszmaul. Cache-Oblivious String B-trees. PODs, 2006.
[42] B. He, Q. Luo. Cache-Oblivious Query Processing. CIDR, 2007, pp. 44-55
[43] B. He, Q. Luo. Cache-Oblivious Nested-Loop Joins. CIKM, 2006.
[44] M. Frigo, C. E. Leiserson, H. Prokop, S. Ramachandran. Cache-Oblivious Algorithms.FOCS, 1999.
[45] T. M. Chilimbi, M. D. Hill, J. R. Larus. Cache-Conscious Structure Layout. SIGPLAN, 1999.
[46] J. Rao, K. A. Ross. Making B+-trees Cache Conscious in Main Memory. SIGMOD, 2000, pp. 475-486
[47] R. Rastogi, S.Seshadri, P. Bohannon, D. Leinbaugh. Logical and Physical Versioning in Main Memory Database. VLDB, 1997, pp. 86-95.
[48] V. Gottemukkala, T. J. Lehman. Locking and Latching in a Memory-Resident Database System. VLDB 1992.
[49] S. K. Cha, S. Hwang, K. Kim, K. Kwon. Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems. VLDB, 2001.
[50] M.H.Dunham. Recovery In Main Memory Databases. International Journal of Engineering Intelligent Systems Special Issue on Databases and Telecommunications, July 1996
[51] J.L.Lin and M.H.Dunham. Dynamic Segmented fuzzy check pointing for main memory databases. Submitted for publication., October 1995.
[52] X.Li, M.H.Eich, V.J.Joseph, Z.Gulzar, C.H.Corti, and M.Nascimento. Check pointing and recovery in partitioned main memory databases. In Proc. IASTED/ISMM International Conference on Intelligent Information Management Systems, Washington, DC, June 1995
[53] A.P. Liedes. Check pointing a main-memory database. Master's thesis, Helsinki University of Technology, Depart. of Computer Science, Oct 2004.
[54] Sang K.Cha and Changbin Song. P*TIME: Highly Scalable OLTP DBMS for Managing Update Intensive Stream Workload. VLDB2004.
[55] J. Lee, K. Kim, and S. K. Cha. Differential logging: a commutative and associative logging scheme for highly parallel main memory database. In Proceedings of the ICDE, pages 173-182,2001.
[56] S.K.Cha, et.al. P*TIME : A highly Parallel Main Memory DBMS Based on Differential Logging. Submitted to ACM SIGMOD 2001 Conference for Demo.
[57] Ailamaki, D. J. DeWitt, M. D. Hill, D. A.Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proc. VLDB, 1999, pp. 266-277.
[58] Peter M.G. Apers, Carel A. van den Berg, Jan Flokstra, Paul W.P.J. Grefen, Martin L. Kersten, Annita N. Wilshut. PRISMA_DB A Parallel Main Memory Relational DBMS. IEEE 1992.
[59] Annita N. Wilschut, Jan Flokstra, Peter M.G.Apers. Parallelism in a Main Memory DBMS The Performance of PRISMA DB. VLDB 1992.
[60] Maurice A.W. Houtsma, Annita N. Wilschut, Jan Flostra. Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA DB. 1993.
[61] J. N. Gray. Notes on database operating systems. Operating Systems: an Advanced Course, 60:397–405, 1991.
[62] B. Lampson and D. Lomet. A new presumed commit optimization for two phase commit. In 19th International Conference on Very Large Data Bases, Doublin, Ireland, 1993.
[63] A. C. G. Samaras, K. Britton and C. Mohan. Two-phase commit optimizations in a commercial distributed environment. Journal of Parallel and Distributed Databases, 3(4), 1995.
[64] R. Gupta, J. Haritsa, and K. Ramamritham. Revisiting commit processing in distributed database systems. In Proceedings of the 1997 ACM SIGMOD, pages 486–497, 1997.
[65] T. Park and H. Y. Yeom. A consistent group commit protocol for distributed database systems. In Parallel and Distributed Computing Systems, Aug. 1999.
[66] Inseon Lee, Heon Y. Yeom Taesoon Park, A New Approach for Distributed Main Memory Database Systems: Causal Commit Protocol,FCGS Conference 2002.
[67] C. Mohan, B. Lindsay, and R. Obermarck. Transaction management in the r* distributed database management system. ACM Trans. on Database Systems, 11(4), 1986.
[68] J. W. Stamos and F. Cristian. A low-cost atomic commit protocol. In 9th IEEE Symp. on Reliable Distributed Systems( SRDS’90), pages 66–75, 1990.
[69] J. W. Stamos and F. Cristian. Coordinator log transaction execution protocol. Distributed and Parallel Databases, 1(4):383–408, 1993.
[70] Y. Al-Houmaily and P. Chrysanthis. Two-phase commit in gigabit-networked distributed databases. In Parallel and Distributed Computing Systems, 1995.
[71] M. Abdallah and P. Pucheral. A single-phase non-blocking atomic commitment protocol. In 9th International Conference on Data and Expert Systems Applications(DEXA), Vienna, Aug. 1998.
[72] M. Abdallah, R. Guerraoui, and P. Pucheral. One-phase commit: Does it make sense, Dec. 1998.
[73] D. Gawlick and D. Kinkade. Varieties of concurrency control in IMS/VS Fast Path. Eata Engineering Bulletin, 8(2):3–10, June 1985.
[74] P.A. Bernstein, V. Hadzilacos, N.Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company, 1987.
[75] S. Woo, M. H. Kim, and Y. J. Lee. Accommodating logical logging under fuzzy check pointing in main memory databases. In Proceedings of the International Database Engineering and Applications Symposium, pages 53–62. IEEE Computer Society, 1997.
[76] M.H.Eich. A classification and comparison of Main memory database recovery techniques. In Proc. IEEE CS Intl. Conf. No. 3 on Data Engineering, Los Angeles, pages 332-339, February 1987.
[77] T.J.Lehman and M.J.Carey. A recovery algorithm for a high performance memory resident database systems. In Proceeding of ACM-SIGMOD 1987 International Conference on Management of Data, San Francisco, Pages104-117, 1987.
[78] X.Li and M.H.Eich. A New logging protocol: LAW. Technical Report CSE9221, Southern Methodist University, Dept. of Computer Science and Engineering, Dallas(TX),October 1992.
[79] Jun-Lin Lin, Margaret H. Dunham, Xi Li. Efficient Redo Processing in Main Memory Databases. 1996 IEEE International Conference On ACOUSTICS, SPEECH AND SIGNAL PROCESSING, Marriott Marquis Hotel, Atlanta, Georgia, May 7-10, 1996.
[80] S.K.Cha, et.al. P*TIME : A highly Parallel Main Memory DBMS Based on Differential Logging. Submitted to ACM SIGMOD 2001 Conference for Demo.
[81] R.B.Hagman. A Crash Recovery scheme for a memory resident database system. IEEE Transactions on Computers, 35(9):839-843, 1986.
[82] X.Li, M.H.Eich, Partition check pointing in main memory database, Technical Report 930CSE-23, Department of Computer Science and Engineering, South Methodist University, 1993.
[83] J.L.Lin and M.H.Eich. Segmented fuzzy checkpoiting for main memory databases. TechnicalReport CSE94442, Southern Methodist University, Dept. of Computer Science and Engneering, Dallas(TX),December 1994.
[84] X.Li, M.H.Eich, V.J.Joseph, Z.Gulzar, C.H.Corti, and M.Nascimento. Check pointing and recovery in partitioned main memory databases. In Proc. IASTED/ISMM International Conference on Intelligent Information Management Systems, Washington, DC, June 1995.
[85]廖国琼,刘云生,肖迎元.实时内存数据库分区模糊检查点策略.计算机研究与发展, 43(7):1291-1296, 2006.
[86] A.P. Liedes. Check pointing a main-memory database. Master’s thesis, Helsinki University of Technology, Depart. of Computer Science, Oct 2004.
[87] A.P. Liedes, A.Wolski. SIREN: A Memory-Conserving, Snapshot-Consistent Checkpoint Algorithm for in Memory Databases. ICDE 2006.
[88] M.H.Eich. Main Memory Database Recovery. In Proceedings of ACM-IEEE Fall Joint Computer Conference, pages 1226-1232, Nov. 1986.
[89] E.Levy and A.Silberschastz, Log Driven Backups: A Recovery Scheme for Large Memory Database Systems, the 5th Jerusalem Conf. on Information Technology (JCIT),1990..
[90] E.Levy. Incremental restart. In Proceeding of the Seventh International Conference on Data Engineering, Kobe, Japan, April,1991.
[91] E.Levy and A.Silberschatz. Incremental recovery in main memory database systems. IEEE Transactions on Knowledge and Data Engineering, 4(6), December 1992.
[92] Dongho Lee, Haengrae Cho. Checkpointing schemes for fast restart in main memory database systems. IEEE Pacific Rim Conf. Communications, Computers and Signal Processing, vol.2. Piscataway, NJ: IEEE Press, 1997. 663-668.
[93] L.Gruenwald. Reload in a Main Memory Database System: MARS. PhD Dissertation Department of Computer Science Southern Methodist University, August 1990.
[94] L.Gruenwald and M.H.Eich. MMDB Reload Algorithms. In Proc. Of the ACM SIGMOD International Conference on Management of Data, pages 397-405,1991.
[95] J.Huang,L.Gruenwald, Logging Real Time Main Memory Databases, Proceedings of International Computer Symposium, pages 1291-1296, December, 1994.
[96] J.Huang. Recovery Techniques in Real Time Main Memory Databases. PhD Dissertation, School of Computer Science, The University of Oklahoma, December 1995.
[97] Jing Huang ,Le Gruenwald. Crash recovery for real-time main memory database systems.Proceedings of the 1996 ACM symposium on Applied Computing.
[98]刘云生,李国徽.实时内存数据库的装入.软件学报, 11(6):829-835, 2000.
[99]肖迎元,刘云生,廖国琼,邓华锋.一种实时动态数据库故障恢复策略.软件学报. 2007, 18(10): 2516-2527.
[100]覃飙,刘云生,杨进才. A Commit Strategy for Distributed Real-Time Transaction.计算机科学与技术学报(英文版), 2003, 18(5): 626-636.
[101] I. Lee and H. Y. Yeom. A single phase distributed commit protocol for main memory database systems. In IPDPS’02, page 44, 2002.
[102] Bayer R., Heller H., Reiser A. Parallelism and Recovery in Database Systems, ACM Transactions on Database Systems, June 1980.
[103] D.J.Deeitt R.H.Katz. F.Ohlken. L.D.Shapiro. M.R.Stonebraker. And D.Wood. Implementation Techniques for main memory databases. In Prodeedings of ACM SIGMOD 1984 International Conference on Management of Data. Pages 1-8, July 1984.
[104] H.V.Jagadish, A.Silberschatz, and S.Sudarshan. Recovering from main memory lapses. In Proceedings of the 19th Conference on Very Large Databases, Morgan Kaufman pubs. Los Altos CA, Dublin, August 1993.
[105] T.Haerder and A. Reuter. Principles of Transactions Oriented Database Recovery. ACM Computing Surveys, 15(4), Pages 287-317, 1983.
[106] J. L. Lin and M. H. Dunham. A performance study of dynamic segmented fuzzy checkpointing in memory resident databases. Dallas, USA: Department of Computer Science and Engineering, Southern Methodist University, Technical Report: 96-CSE-14, 1996.
[107] Jing Huang, Le Gruenwald. An Update-Frequency-Valid-Interval Partition Checkpoint Technique for Real-Time Main Memory Databases. // Kwei-Jay Lin. Proceedings of the First International Workshop on Real-Time Databases: Issues and Applications. Newport Beach, California, USA: RTDB Endowment, 1996: 130-137.
[108] T.J.Lehman and M.J.Carey. A recovery algorithm for a high performance memory resident database systems. In Proceeding of ACM-SIGMOD 1987 International Conference on Management of Data, San Francisco, Pages104-117, 1987
[109] Mohan C., Pirahesh H., Lorie R. Efficient and Flexdible Methods for Transient Versioning of Records to Avoid Locking by Read only Transactions. ACM SIGMOD Intl. Conf. On Management of Data, June 1992.
[110] Bober P., Carey M. Multiversion Query Locking. Proc. 18th International Conference on Very Large Data Bases, August 1992.
[111] Tobin J. Lehman, Vibby Gottemukkala. The design and performance evaluation of a lock manager for a memory-resident database system (Chapter of Performance of concurrency control mechanisms in centralized database systems). Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1995. 406-428.
[112] Stephen Blott, Henry F. Korth. An almost-serial protocol for transaction execution in main-memory database systems. In Proceedings of the 28th international conference on Very Large Data Bases, Hong Kong, China, Volume28, Pages: 706 - 717, 2002.
[113] Intel Corporation. Intel Quad Core Xeon Processor Datasheet [EB/OL]. http ://www.intel.com, 2007-12-31/2008-2-15.
[114] E.Levy and A.Silberschatz. Incremental recovery in main memory database systems. IEEE Transactions on Knowledge and Data Engineering, 4(6), December 1992.
[115] Yutong Wang,Vijay Kumar. Performance Comparison of Main Memory Database Recovery Algorithms. Tech Report, Computer Science Telecommunications 5100 Rockhill, University of Missouri-Kansas City,2000.
[116] TMS Company. Texas Memory finds SSD traction in latency-sensitive finance vertical. www.texmemsys.com/files/f000238.pdf, 2008.
[117] Sang Won Lee, Bongki Moon. Design of Flash Based DBMS: An In-Page Logging Approach. 27th ACM SIGMOD International Conference on Management of Data / Principles of Database Systems, Beijing, China, 2007.
[118] J.Kim, J.M.Kim, S.H.Min, Y.Cho. A Space-Efficient Flash Transaction Layer for Compact-Flash Systems. IEEE Transactions on Consumer Electronics, 2002, 48(2): 366-375.
[119] Katsutaka Kimura, Takashi Kobayashi. Trends in High Density Flash Memory Technologies. In IEEE Conference on Electron Devices and Solid State Circuits, Hong Kong, 2003, pp.45-50.
[120] John Barr, Simon Robinson. Texas Memory finds SSD traction in latency sensitive finance vertical. http://www.texmemsys.com/files/f000238.pdf, 2008.
[121] McObject LLC White Paper. In-Memory Database Systems Beyond the Terabyte Size Boundary. http://www.mcobject.com, 2007
[2] H. Garcia-Molina, K. Salem. Main Memory Database Systems: An Overview. IEEE TRANSACTIONS ON KNOWLEDGE AND DATAENGINEERING, VOL4, 1992, pp. 509-516.
[3] Cambridge Consulting. The Optimal Interconnect for High Performance Clustered Environments: A Look at Infini-Band and Hewlett-Packard’s Implementation. 2004
[4] Kawashima H., Toyama M., Imai M., and Anzai Y. Providing Persistence for Sensor Streams with Light Neighbor WAL. In: Satoshi Ogawa. Proceedings of Pacific Rim International Symposium on Dependable Computing (PRDC2002). Tsukuba City, Japan:IEEE Computer Society, 2002. 257-264.
[5] Kawashima, H., Imai, M., Anzai, Y. Accelerating Remote Logging by Two Level Asynchronous Checkpointing. In: Shinji Ota.7th International Conference on Mobile Data Management, Nara, Japan:IEEE Computer Society, 2006. 127– 137.
[6] Hideyuki Kawashima, Michita Imai, Yuichiro Anzai. Providing Persistence for Sensor Data Streams by Remote WAL. In: A. Min Tjoa, Juan Trujillo Eds. Proceedings of 8th International Conference Data Warehousing and Knowledge Discovery (DaWaK 2006). Krakow, Poland:Lecture Notes in Computer Science 4081 Springer, 2006. 524-533.
[7] Newhall, Tia Amato, Daniel Pshenichkin, Alexandr. Reliable adaptable Network RAM. In: Takahiro Katagiri. Proceedings of 2008 IEEE International Conference on Cluster Computing. Tsukuba, Japan: IEEE Computer Society Press, 2008.2-12.
[8] Kai Li, Jeffrey F. Naughton. Multiprocessor Main Memory Transaction Processing. Proceedings of International Symposium on Databases in Parallel and Distributed Systems, 2000, pp.177 - 187.
[9] M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. O’Neil, P. O’Neil, A. Rasin, N. Tran, and S. Zdonik. C-Store: A column-oriented dbms. In VLDB’05, pages 553–564, 2005.
[10] Robert Kallman, Hideaki Kimura, Jonathan Natkins, Andrew Pavlo,Alexander Rasin, Stanley Zdonik,Evan P. C. Jones, Samuel Madden, Michael Stonebraker, Yang Zhang, John Hugg, Daniel J. Abadi. H-store: a high-performance, distributed main memory transaction processing system. Proceedings of the VLDB Endowment, 2008, Pages 1496-1499.
[11] A. Ailamaki, D. J. DeWitt, M. D. Hill, M. Skounakis. Weaving Relations for Cache Performance. VLDB, 2001, pp. 169-180.
[12] M. Stonebraker, C. Bear, U. Cetintemel, M. Cherniack, T. Ge, N. Hachem, S. Harizopoulos, J. Lifter, J. Rogers, and S. B. Zdonik. One size fits all? part 2: Benchmarking studies. In CIDR’07, pages 173–184, 2007.
[13] M. Stonebraker and U. Cetintemel.”one size fits all”: An idea whose time has come and gone. In ICDE’05, pages 2–11, 2005.
[14] The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0). http://www.tpc.org/tpcc/spec/tpcc current.pdf, June 2007.
[15] S. Manegold, P. Boncz, M. L. Kersten. Generic Database Cost Models for Hierarchical Memory Systems. VLDB, 2002.
[16] M. Zukowski, S. Héman, N. Nes, P. Boncz. Super-Scalar RAM-CPU Cache Compression. ICDE, 2006.
[17] D. J. Abadi, S. R. Madden, M. C. Ferreira. Integrating Compression and Execution in Column-Oriented Database Systems. SIGMOD, 2006.
[18] Z. Chen, J. Gehrke, F. Korn. Query Optimization In Compressed Database Systems. SIGMOD, 2001.
[19] S. Chen, A. Ailamaki, P. B. Gibbons. Improving Hash Join Performance through Prefetching. ICDE, 2004, pp. 116-127.
[20] S. Manegold, P. Boncz, N. Nes, M. Kersten. Cache-Conscious Radix-Decluster Projections. VLDB, 2004.
[21] A. Shatdal, C. Kant, J. F. Naughton. Cache Conscious Algorithms for Relational Query Processing. VLDB, 1994, pp. 510-521.
[22] P. Boncz, M. Zukowski, N. Nes. MonetDB/X100: Hyper-Pipelining Query Execution. CIDR, 2005.
[23] J. Zhou, K. A. Ross. Buffering Database Operations for Enhanced Instruction Cache Performance. SIGMOD, 2004, pp. 191-202.
[24] Peter Alexander Boncz. Monet: A Next-Generation DBMS Kernel For Query-Intensive Applications. Ph.D. Thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, May 2002.
[25] S. Manegold. Understanding, Modeling, and Improving Main-Memory Database Performance. Ph.D. Thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, Dec 2002.
[26] A. Ailamaki, D. J. DeWitt, M. D. Hill, D. A.Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proc. VLDB, 1999, pp. 266-277.
[27] B. He, Q, Luo. Cache-Oblivious Nested-Loop Joins. CIKM, 2006.
[28] B. He, Q, Luo. Cache-Oblivious Query Processing. CIDR, 2007, pp. 44-55.
[29] S. Manegold, P. Boncz, M. L. Kersten. What happens during a Join? Dissecting CPU and Memory Optimization Effects. VLDB, 2000, pp. 339-350.
[30] M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The end of an architectural era: (it’s time for a complete rewrite). In VLDB’2007, pages 1150–1160, 2007.
[31] H. Luan, X. Du, S. Wang, Y. Ni, Q, Chen. J+-Tree: A New Index Structure in Main Memory. DASFAA, 2007.
[32] P. Bohannon, P. Mcllroy, R. Rastogi. Main-Memory Index Structures with Fixed-Size Partial Keys. SIGMOD, 2001.
[33] S. Chen, P. B. Gibbons, T. C. Mowry, G. Valentin. Fractal Prefetching B+-Trees: Optimizing Both Cache and Disk Performance. SIGMOD, 2002.
[34] S. Chen, P. B. Gibbons, T. C. Mowry. Improving Index Performance through Prefetching. SIGMOD, 2001, pp. 235-246.
[35] K. A. Ross. Conjunctive Selection Conditions in Main Memory. PODS, 2002.
[36] Y. Zhang, Z. Chen, Y. Zhou. Efficient Execution of Multiple Queries on Deep Memory Hierarchy. JCST, Vol 22(2), 2007, pp. 273-279.
[37] M. A. Bender, M. Farach-Colton, B. C. Kuszmaul. Cache-Oblivious String B-trees. PODs, 2006.
[38] H.Jagadish etal. Dali: A high performance main memory storage manager. In Proc. Of the 20th VLDB Conf., pages48-59, 1994
[39] Oracle TimesTen In-Memory Database Architectural Overview Release 6.0,2007
[40] Peter Alexander Boncz. Monet: A Next-Generation DBMS Kernel For Query-Intensive Applications. Ph.D. Thesis, Universiteit van Amsterdam, Amsterdam, The Netherlands, May 2002.
[41] M. A. Bender, M. Farach-Colton, B. C. Kuszmaul. Cache-Oblivious String B-trees. PODs, 2006.
[42] B. He, Q. Luo. Cache-Oblivious Query Processing. CIDR, 2007, pp. 44-55
[43] B. He, Q. Luo. Cache-Oblivious Nested-Loop Joins. CIKM, 2006.
[44] M. Frigo, C. E. Leiserson, H. Prokop, S. Ramachandran. Cache-Oblivious Algorithms.FOCS, 1999.
[45] T. M. Chilimbi, M. D. Hill, J. R. Larus. Cache-Conscious Structure Layout. SIGPLAN, 1999.
[46] J. Rao, K. A. Ross. Making B+-trees Cache Conscious in Main Memory. SIGMOD, 2000, pp. 475-486
[47] R. Rastogi, S.Seshadri, P. Bohannon, D. Leinbaugh. Logical and Physical Versioning in Main Memory Database. VLDB, 1997, pp. 86-95.
[48] V. Gottemukkala, T. J. Lehman. Locking and Latching in a Memory-Resident Database System. VLDB 1992.
[49] S. K. Cha, S. Hwang, K. Kim, K. Kwon. Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems. VLDB, 2001.
[50] M.H.Dunham. Recovery In Main Memory Databases. International Journal of Engineering Intelligent Systems Special Issue on Databases and Telecommunications, July 1996
[51] J.L.Lin and M.H.Dunham. Dynamic Segmented fuzzy check pointing for main memory databases. Submitted for publication., October 1995.
[52] X.Li, M.H.Eich, V.J.Joseph, Z.Gulzar, C.H.Corti, and M.Nascimento. Check pointing and recovery in partitioned main memory databases. In Proc. IASTED/ISMM International Conference on Intelligent Information Management Systems, Washington, DC, June 1995
[53] A.P. Liedes. Check pointing a main-memory database. Master's thesis, Helsinki University of Technology, Depart. of Computer Science, Oct 2004.
[54] Sang K.Cha and Changbin Song. P*TIME: Highly Scalable OLTP DBMS for Managing Update Intensive Stream Workload. VLDB2004.
[55] J. Lee, K. Kim, and S. K. Cha. Differential logging: a commutative and associative logging scheme for highly parallel main memory database. In Proceedings of the ICDE, pages 173-182,2001.
[56] S.K.Cha, et.al. P*TIME : A highly Parallel Main Memory DBMS Based on Differential Logging. Submitted to ACM SIGMOD 2001 Conference for Demo.
[57] Ailamaki, D. J. DeWitt, M. D. Hill, D. A.Wood. DBMSs on a Modern Processor: Where Does Time Go? In Proc. VLDB, 1999, pp. 266-277.
[58] Peter M.G. Apers, Carel A. van den Berg, Jan Flokstra, Paul W.P.J. Grefen, Martin L. Kersten, Annita N. Wilshut. PRISMA_DB A Parallel Main Memory Relational DBMS. IEEE 1992.
[59] Annita N. Wilschut, Jan Flokstra, Peter M.G.Apers. Parallelism in a Main Memory DBMS The Performance of PRISMA DB. VLDB 1992.
[60] Maurice A.W. Houtsma, Annita N. Wilschut, Jan Flostra. Implementation and Performance Evaluation of a Parallel Transitive Closure Algorithm on PRISMA DB. 1993.
[61] J. N. Gray. Notes on database operating systems. Operating Systems: an Advanced Course, 60:397–405, 1991.
[62] B. Lampson and D. Lomet. A new presumed commit optimization for two phase commit. In 19th International Conference on Very Large Data Bases, Doublin, Ireland, 1993.
[63] A. C. G. Samaras, K. Britton and C. Mohan. Two-phase commit optimizations in a commercial distributed environment. Journal of Parallel and Distributed Databases, 3(4), 1995.
[64] R. Gupta, J. Haritsa, and K. Ramamritham. Revisiting commit processing in distributed database systems. In Proceedings of the 1997 ACM SIGMOD, pages 486–497, 1997.
[65] T. Park and H. Y. Yeom. A consistent group commit protocol for distributed database systems. In Parallel and Distributed Computing Systems, Aug. 1999.
[66] Inseon Lee, Heon Y. Yeom Taesoon Park, A New Approach for Distributed Main Memory Database Systems: Causal Commit Protocol,FCGS Conference 2002.
[67] C. Mohan, B. Lindsay, and R. Obermarck. Transaction management in the r* distributed database management system. ACM Trans. on Database Systems, 11(4), 1986.
[68] J. W. Stamos and F. Cristian. A low-cost atomic commit protocol. In 9th IEEE Symp. on Reliable Distributed Systems( SRDS’90), pages 66–75, 1990.
[69] J. W. Stamos and F. Cristian. Coordinator log transaction execution protocol. Distributed and Parallel Databases, 1(4):383–408, 1993.
[70] Y. Al-Houmaily and P. Chrysanthis. Two-phase commit in gigabit-networked distributed databases. In Parallel and Distributed Computing Systems, 1995.
[71] M. Abdallah and P. Pucheral. A single-phase non-blocking atomic commitment protocol. In 9th International Conference on Data and Expert Systems Applications(DEXA), Vienna, Aug. 1998.
[72] M. Abdallah, R. Guerraoui, and P. Pucheral. One-phase commit: Does it make sense, Dec. 1998.
[73] D. Gawlick and D. Kinkade. Varieties of concurrency control in IMS/VS Fast Path. Eata Engineering Bulletin, 8(2):3–10, June 1985.
[74] P.A. Bernstein, V. Hadzilacos, N.Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley Publishing Company, 1987.
[75] S. Woo, M. H. Kim, and Y. J. Lee. Accommodating logical logging under fuzzy check pointing in main memory databases. In Proceedings of the International Database Engineering and Applications Symposium, pages 53–62. IEEE Computer Society, 1997.
[76] M.H.Eich. A classification and comparison of Main memory database recovery techniques. In Proc. IEEE CS Intl. Conf. No. 3 on Data Engineering, Los Angeles, pages 332-339, February 1987.
[77] T.J.Lehman and M.J.Carey. A recovery algorithm for a high performance memory resident database systems. In Proceeding of ACM-SIGMOD 1987 International Conference on Management of Data, San Francisco, Pages104-117, 1987.
[78] X.Li and M.H.Eich. A New logging protocol: LAW. Technical Report CSE9221, Southern Methodist University, Dept. of Computer Science and Engineering, Dallas(TX),October 1992.
[79] Jun-Lin Lin, Margaret H. Dunham, Xi Li. Efficient Redo Processing in Main Memory Databases. 1996 IEEE International Conference On ACOUSTICS, SPEECH AND SIGNAL PROCESSING, Marriott Marquis Hotel, Atlanta, Georgia, May 7-10, 1996.
[80] S.K.Cha, et.al. P*TIME : A highly Parallel Main Memory DBMS Based on Differential Logging. Submitted to ACM SIGMOD 2001 Conference for Demo.
[81] R.B.Hagman. A Crash Recovery scheme for a memory resident database system. IEEE Transactions on Computers, 35(9):839-843, 1986.
[82] X.Li, M.H.Eich, Partition check pointing in main memory database, Technical Report 930CSE-23, Department of Computer Science and Engineering, South Methodist University, 1993.
[83] J.L.Lin and M.H.Eich. Segmented fuzzy checkpoiting for main memory databases. TechnicalReport CSE94442, Southern Methodist University, Dept. of Computer Science and Engneering, Dallas(TX),December 1994.
[84] X.Li, M.H.Eich, V.J.Joseph, Z.Gulzar, C.H.Corti, and M.Nascimento. Check pointing and recovery in partitioned main memory databases. In Proc. IASTED/ISMM International Conference on Intelligent Information Management Systems, Washington, DC, June 1995.
[85]廖国琼,刘云生,肖迎元.实时内存数据库分区模糊检查点策略.计算机研究与发展, 43(7):1291-1296, 2006.
[86] A.P. Liedes. Check pointing a main-memory database. Master’s thesis, Helsinki University of Technology, Depart. of Computer Science, Oct 2004.
[87] A.P. Liedes, A.Wolski. SIREN: A Memory-Conserving, Snapshot-Consistent Checkpoint Algorithm for in Memory Databases. ICDE 2006.
[88] M.H.Eich. Main Memory Database Recovery. In Proceedings of ACM-IEEE Fall Joint Computer Conference, pages 1226-1232, Nov. 1986.
[89] E.Levy and A.Silberschastz, Log Driven Backups: A Recovery Scheme for Large Memory Database Systems, the 5th Jerusalem Conf. on Information Technology (JCIT),1990..
[90] E.Levy. Incremental restart. In Proceeding of the Seventh International Conference on Data Engineering, Kobe, Japan, April,1991.
[91] E.Levy and A.Silberschatz. Incremental recovery in main memory database systems. IEEE Transactions on Knowledge and Data Engineering, 4(6), December 1992.
[92] Dongho Lee, Haengrae Cho. Checkpointing schemes for fast restart in main memory database systems. IEEE Pacific Rim Conf. Communications, Computers and Signal Processing, vol.2. Piscataway, NJ: IEEE Press, 1997. 663-668.
[93] L.Gruenwald. Reload in a Main Memory Database System: MARS. PhD Dissertation Department of Computer Science Southern Methodist University, August 1990.
[94] L.Gruenwald and M.H.Eich. MMDB Reload Algorithms. In Proc. Of the ACM SIGMOD International Conference on Management of Data, pages 397-405,1991.
[95] J.Huang,L.Gruenwald, Logging Real Time Main Memory Databases, Proceedings of International Computer Symposium, pages 1291-1296, December, 1994.
[96] J.Huang. Recovery Techniques in Real Time Main Memory Databases. PhD Dissertation, School of Computer Science, The University of Oklahoma, December 1995.
[97] Jing Huang ,Le Gruenwald. Crash recovery for real-time main memory database systems.Proceedings of the 1996 ACM symposium on Applied Computing.
[98]刘云生,李国徽.实时内存数据库的装入.软件学报, 11(6):829-835, 2000.
[99]肖迎元,刘云生,廖国琼,邓华锋.一种实时动态数据库故障恢复策略.软件学报. 2007, 18(10): 2516-2527.
[100]覃飙,刘云生,杨进才. A Commit Strategy for Distributed Real-Time Transaction.计算机科学与技术学报(英文版), 2003, 18(5): 626-636.
[101] I. Lee and H. Y. Yeom. A single phase distributed commit protocol for main memory database systems. In IPDPS’02, page 44, 2002.
[102] Bayer R., Heller H., Reiser A. Parallelism and Recovery in Database Systems, ACM Transactions on Database Systems, June 1980.
[103] D.J.Deeitt R.H.Katz. F.Ohlken. L.D.Shapiro. M.R.Stonebraker. And D.Wood. Implementation Techniques for main memory databases. In Prodeedings of ACM SIGMOD 1984 International Conference on Management of Data. Pages 1-8, July 1984.
[104] H.V.Jagadish, A.Silberschatz, and S.Sudarshan. Recovering from main memory lapses. In Proceedings of the 19th Conference on Very Large Databases, Morgan Kaufman pubs. Los Altos CA, Dublin, August 1993.
[105] T.Haerder and A. Reuter. Principles of Transactions Oriented Database Recovery. ACM Computing Surveys, 15(4), Pages 287-317, 1983.
[106] J. L. Lin and M. H. Dunham. A performance study of dynamic segmented fuzzy checkpointing in memory resident databases. Dallas, USA: Department of Computer Science and Engineering, Southern Methodist University, Technical Report: 96-CSE-14, 1996.
[107] Jing Huang, Le Gruenwald. An Update-Frequency-Valid-Interval Partition Checkpoint Technique for Real-Time Main Memory Databases. // Kwei-Jay Lin. Proceedings of the First International Workshop on Real-Time Databases: Issues and Applications. Newport Beach, California, USA: RTDB Endowment, 1996: 130-137.
[108] T.J.Lehman and M.J.Carey. A recovery algorithm for a high performance memory resident database systems. In Proceeding of ACM-SIGMOD 1987 International Conference on Management of Data, San Francisco, Pages104-117, 1987
[109] Mohan C., Pirahesh H., Lorie R. Efficient and Flexdible Methods for Transient Versioning of Records to Avoid Locking by Read only Transactions. ACM SIGMOD Intl. Conf. On Management of Data, June 1992.
[110] Bober P., Carey M. Multiversion Query Locking. Proc. 18th International Conference on Very Large Data Bases, August 1992.
[111] Tobin J. Lehman, Vibby Gottemukkala. The design and performance evaluation of a lock manager for a memory-resident database system (Chapter of Performance of concurrency control mechanisms in centralized database systems). Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1995. 406-428.
[112] Stephen Blott, Henry F. Korth. An almost-serial protocol for transaction execution in main-memory database systems. In Proceedings of the 28th international conference on Very Large Data Bases, Hong Kong, China, Volume28, Pages: 706 - 717, 2002.
[113] Intel Corporation. Intel Quad Core Xeon Processor Datasheet [EB/OL]. http ://www.intel.com, 2007-12-31/2008-2-15.
[114] E.Levy and A.Silberschatz. Incremental recovery in main memory database systems. IEEE Transactions on Knowledge and Data Engineering, 4(6), December 1992.
[115] Yutong Wang,Vijay Kumar. Performance Comparison of Main Memory Database Recovery Algorithms. Tech Report, Computer Science Telecommunications 5100 Rockhill, University of Missouri-Kansas City,2000.
[116] TMS Company. Texas Memory finds SSD traction in latency-sensitive finance vertical. www.texmemsys.com/files/f000238.pdf, 2008.
[117] Sang Won Lee, Bongki Moon. Design of Flash Based DBMS: An In-Page Logging Approach. 27th ACM SIGMOD International Conference on Management of Data / Principles of Database Systems, Beijing, China, 2007.
[118] J.Kim, J.M.Kim, S.H.Min, Y.Cho. A Space-Efficient Flash Transaction Layer for Compact-Flash Systems. IEEE Transactions on Consumer Electronics, 2002, 48(2): 366-375.
[119] Katsutaka Kimura, Takashi Kobayashi. Trends in High Density Flash Memory Technologies. In IEEE Conference on Electron Devices and Solid State Circuits, Hong Kong, 2003, pp.45-50.
[120] John Barr, Simon Robinson. Texas Memory finds SSD traction in latency sensitive finance vertical. http://www.texmemsys.com/files/f000238.pdf, 2008.
[121] McObject LLC White Paper. In-Memory Database Systems Beyond the Terabyte Size Boundary. http://www.mcobject.com, 2007
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |