Large string access and storage

作者: Ivan Schreter , Mihnea Andrei , Colin Florendo

DOI:

关键词: Connection stringscanf format stringTheoretical computer scienceComputer scienceString metricString searching algorithmEmpty stringString interpolationString interningApproximate string matching

摘要: Techniques for handling large string values in a dictionary within an in-memory database system are presented. The can be paged-column main dictionary. For example, value block of may loaded into memory, where the stores compression. include first portion and one or more logical pointers to pages containing remainder value. materialized contiguous location pointer created.

参考文章(64)
Gregory R. Ganger, Shafeeq Sinnamohideen, Raja R. Sambasivan, John D. Strunk, Brandon Salmon, William V. Courtright, Jay J. Wylie, Andrew J. Klosterman, James Hendricks, Matthew Wachs, Michael Abd-El-Malek, Manish Prasad, Michael P. Mesnier, Chuck Cranor, Eno Thereska, Early experiences on the journey towards self-* storage. IEEE Data(base) Engineering Bulletin. ,vol. 29, pp. 55- 62 ,(2006)
Jayant R. Haritsa, Gautam Ray, S. Seshadri, Database Compression: A Performance Enhancement Tool. conference on management of data. pp. 0- ,(1995)
Benoît Dageville, Karl Dias, Oracle's Self-Tuning Architecture and Solutions. IEEE Data(base) Engineering Bulletin. ,vol. 29, pp. 24- 31 ,(2006)
Alexander Zeier, Christian Lemke, Kai-Uwe Sattler, Franz Faerber, Speeding up queries in column stores: a case for compression data warehousing and knowledge discovery. pp. 117- 129 ,(2010)
Joos-Hendrik Bose, Frank Renkes, Logging scheme for column-oriented in-memory databases ,(2011)
Ioan Bogdan Crivat, Cristian Petculescu, Amir Netz, Efficient column based data encoding for large-scale data storage ,(2009)
Peter Anthony Franaszek, John Timothy Robinson, Joy Aloysius Thomas, Adaptive multiple dictionary data compression ,(1995)
Guenter Radestock, Andrew Ross, Franz Faerber, Block compression of tables with repeated values ,(2008)