aoGlobally Recorded binary encoded Domain Compression algorithm in Column Oriented Databasesa
Keywords:
Compression, Columnar database, tuples, tables
Abstract
through this study, we propose two algorithms. The first algorithm describes the concept of compression of domains at attribute level and we call it as 201C;Attribute Domain Compression201D;. This algorithm can be implemented on both row and columnar databases. The idea behind the algorithm is to reduce the size of large databases as to store them optimally. The second algorithm is also applicable for both concepts of databases but will optimally work for columnar databases. The idea behind the algorithm is to generalize the tuple domains by giving it a value say (n) such that all other n-1 tuples or at least maximum can be identified.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2011-08-15
Issue
Section
License
Copyright (c) 2011 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.