2Abadi D J, Boncz PA, Harizopoulos S. Column-Oriented database systems. VLDB 2009 Tutorial, 2009. http://cs-www.cs.yale.edu/ homes/dna/talks/Column _Store _Tutorial_ VLDB09 .pdf.
3Datta A, Thomas H. Querying compressed data in data warehouses. Journal of Information Technology and Management, 2002, 3(4):353-386. [doi: 10.1023/A:1019772807859].
4Bhuiyan MM, Hoque ASML. High performance SQL queries on compressed relational database. Journal of Computers, 2009, 3(12):1263-1274.
5O'Connell SJ, Winterbottom N. Performing joins without decompression in a compressed database system. SIGMOD Record, 2003,32(1):6-11. [doi: 10.1145/640990.640991].
6Olofson C. Feature: The database revolution, 2012. http://www.ibm.com/developerworks/datedlibrary/dmmag/DMMag_2011_ Issue 1/FeatureHistory/.
7Kallman R, Kimura H, Natkins J, Pavlo A, Rasin A, Zdonik S, Jones EPC, Madden S, Stonebraker M, Zhang Y, Hugg J, Abadi DJ. H-Store: A high-performance, distributed main memory transaction processing system. Proc. of the VLDB Endowment, 2008,1(2): 1496-1499.
8Lu HJ, Ng YY, Tian ZP. T-Tree or B-tree: Main memory database index structure revisited. In: Orlowska ME, ed. Proc. of the Australasian Database Conf. 2000. Canberra: IEEE Computer Society, 2000.65-73. [doi: 10.1109/ADC.2000.819815].
9Shatdal A, Kant C, Naughton JF. Cache conscious algorithms for relational query processing. In: Bocca JB, Jarke M, Zaniolo C, eds. Proc. of the VLDB'94. Chile: Morgan Kaufmann Publishers, 1994.510-521.
10Luan I-I, Du XY, Wang S. Cache-Conscious data cube computation on a modern processor. Journal of Computer Science and Technology, 2009,24(4):708-722.
