{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T18:50:26Z","timestamp":1687546226927},"reference-count":8,"publisher":"International Academy Publishing (IAP)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JCP"],"DOI":"10.4304\/jcp.8.5.1175-1183","type":"journal-article","created":{"date-parts":[[2013,4,19]],"date-time":"2013-04-19T10:50:50Z","timestamp":1366368650000},"source":"Crossref","is-referenced-by-count":2,"title":["H-HIBASE: Compression Enhancement of HIBASE Technique Using Huffman Coding"],"prefix":"10.17706","volume":"8","author":[{"given":"Ahsan","family":"Habib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. S. M. Latiful","family":"Hoque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Russel","family":"Hussain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2013,5,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/41.5.283"},{"key":"ref2","first-page":"294","article-title":"A Study of Index Structures for Main Memory Database Management Systems","volume-title":"Proceedings of the Twelfth International Conference on Very Large Databases","author":"Lehman","year":"1986","unstructured":"[2] T. J. Lehman, M. J. Carey, \"A Study of Index Structures for Main Memory Database Management Systems\", Proceedings of the Twelfth International Conference on Very Large Databases, pp. 294-303, August 1986."},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.4.12.1263-1274"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.885830"},{"key":"ref5","first-page":"387","volume-title":"Introduction to Algorithms","author":"Coreman","year":"2002","unstructured":"[7] T. H. Coreman, C. E. Leiserson, R. L. Rivest, C. Stein, \"Introduction to Algorithms\", second edition, page 387-388, 2002."},{"key":"ref5","unstructured":"[4] D. A. Huffman, \"A Method for the Construction of Minimum Redundancy Codes\", Proceedings of the I.R.E., vol. 40, pp. 1098-1101, September 1952."},{"key":"ref5","unstructured":"[6] Huffman Coding, Wikimedia Foundation, Inc., Last accessed on 8 August 2012. Last accessed at: http:\/\/en.wikipedia.org\/wiki\/Huffman_coding"},{"key":"ref5","unstructured":"[8] Declaring and Using Bit Fields in Structures, IBM, Last accessed on 18 August, 2012. Last Accessed at: http:\/\/publib.boulder.ibm.com\/infocenter\/macxhelp\/v6v81\/index.jsp?topic=%2Fcom.ibm.vacpp6m.doc%2Flanguage%2 Fref%2Fclrc03defbitf.htm"}],"container-title":["Journal of Computers"],"original-title":[],"deposited":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T11:13:35Z","timestamp":1442315615000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jcp\/article\/view\/8706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,1]]},"references-count":8,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2013,5,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jcp.8.5.1175-1183","relation":{},"ISSN":["1796-203X"],"issn-type":[{"value":"1796-203X","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5,1]]}}}