<?xml version="1.0" encoding="UTF-8"?>
<article article-type="research-article" xml:lang="en" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher">global-journal-of-computer-science-and-technology</journal-id>
<journal-title-group>
<journal-title>Global Journal of Computer Science and Technology</journal-title>
</journal-title-group>
<issn publication-format="print">0975-4350</issn>
<issn publication-format="electronic">0975-4172</issn>
<publisher><publisher-name>Global Journals Publishing Group Incorporated</publisher-name></publisher>
<self-uri xlink:href="https://globaljournals.org/journal-seo-export/jats/73809.xml" />
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">73809</article-id>
<title-group>
<article-title>aoGlobally Recorded binary encoded Domain Compression algorithm in Column Oriented Databasesa</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Mahrishi</surname><given-names>Mehul</given-names></name><xref ref-type="aff" rid="aff1" />
</contrib>
<contrib contrib-type="author"><name><surname>Shrotriya</surname><given-names>Anita</given-names></name></contrib>
<contrib contrib-type="author"><name><surname>Sharma</surname><given-names>Devendra Kr.</given-names></name></contrib>
</contrib-group>
<aff id="aff1">INDIA, Swami Keshvanand Institute Of Technology, Management &amp; Gramothan</aff>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2011-12-24">
<day>24</day>
<month>12</month>
<year>2011</year>
</pub-date>
<volume>11</volume>
<issue>23</issue>
<fpage>27</fpage>
<lpage>30</lpage>
<abstract><p>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 “Attribute Domain Compression”. 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.</p></abstract>
<kwd-group kwd-group-type="author-generated">
<kwd>Compression</kwd>
<kwd>Columnar database</kwd>
<kwd>tuples</kwd>
<kwd>tables.</kwd>
</kwd-group>
<self-uri content-type="pdf" xlink:href="https://globaljournals.org/GJCST_Volume11/5-Globally-Recorded-binary-encoded.pdf" />
<self-uri content-type="html" xlink:href="https://globaljournals.org/scholarly-articles/aoglobally-recorded-binary-encoded-domain-compression-algorithm-in-column-oriented-databasesa/" />
</article-meta>
</front>
<body>
<sec>
<title>Full Text</title>
<p>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 â€œAttribute Domain Compressionâ€. 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.</p>
</sec>
</body>
</article>