{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T21:40:26Z","timestamp":1713822026852},"reference-count":34,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7,1]]},"abstract":"<p>In this paper, the authors present a description of a new Web search engine model, the compressed index-query (CIQ) Web search engine model. This model incorporates two bit-level compression layers implemented at the back-end processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index (index compressor), and the second layer resides after the query parser for query compression (query compressor) to enable bit-level compressed index-query search. The data compression algorithm used in this model is the Hamming codes-based data compression (HCDC) algorithm, which is an asymmetric, lossless, bit-level algorithm permits CIQ search. The different components of the new Web model are implemented in a prototype CIQ test tool (CIQTT), which is used as a test bench to validate the accuracy and integrity of the retrieved data and evaluate the performance of the proposed model. The test results demonstrate that the proposed CIQ model reduces disk space requirements and searching time by more than 24%, and attains a 100% agreement when compared with an uncompressed model.<\/p>","DOI":"10.4018\/jitwe.2011070103","type":"journal-article","created":{"date-parts":[[2012,4,5]],"date-time":"2012-04-05T13:05:56Z","timestamp":1333631156000},"page":"39-56","source":"Crossref","is-referenced-by-count":3,"title":["Development of a Novel Compressed Index-Query Web Search Engine Model"],"prefix":"10.4018","volume":"6","author":[{"given":"Hussein","family":"Al-Bahadili","sequence":"first","affiliation":[{"name":"Petra University, Jordan"}]},{"given":"Saif","family":"Al-Saab","sequence":"additional","affiliation":[{"name":"University of Banking & Financial Sciences, Jordan"}]}],"member":"2432","reference":[{"key":"jitwe.2011070103-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2007.11.043"},{"key":"jitwe.2011070103-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2007.05.014"},{"key":"jitwe.2011070103-2","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-010-0123-6"},{"key":"jitwe.2011070103-3","doi-asserted-by":"publisher","DOI":"10.2316\/Journal.202.2010.3.202-2914"},{"issue":"4","key":"jitwe.2011070103-4","first-page":"73","article-title":"A compressed index-query web search engine model.","volume":"1","author":"S.Al-Bahadili","year":"2010","journal-title":"International Journal of Computer Information Systems"},{"key":"jitwe.2011070103-5","unstructured":"Al-Saab, S. (2011). A novel search engine model based on index-query bit-level compression (Unpublished doctoral dissertation). University of Banking & Financial Sciences, Faculty of Information Technology and Systems, Amman, Jordan."},{"key":"jitwe.2011070103-6","unstructured":"Anh, V. N., & Moffat, A. (2004, January). Index compression using fixed binary codewords. In Proceedings of the 15th Australasian Database Conference, Dunedin, New Zealand."},{"key":"jitwe.2011070103-7","unstructured":"Ashton, P. (2011). Windows NT NTML Auto-Authentication. Retrieved from http:\/\/insecure.org\/sploits\/NT.NTLM.auto-authentication.html"},{"key":"jitwe.2011070103-8","unstructured":"Badue, C., Baeza-Yates, R., Ribeiro-Neto, B., & Ziviani, N. (2002, September). Distributed query processing using partitioned inverted files. In Proceedings of the 9th String Processing and Information Retrieval Symposium."},{"key":"jitwe.2011070103-9","doi-asserted-by":"crossref","unstructured":"Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Journal of Computer Networks and ISDN Systems, 30(1-7), 107-117.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"jitwe.2011070103-10","author":"T.Calishain","year":"2004","journal-title":"Web search garage"},{"key":"jitwe.2011070103-11","doi-asserted-by":"crossref","unstructured":"Chen, Z., Gehrke, J., & Korn, F. (2001, May 21-24). Query optimization in compressed database systems. In Proceedings of the ACM Conference on Special Interest on Management of Data, Santa Barbara, CA (pp. 271-282).","DOI":"10.1145\/376284.375692"},{"key":"jitwe.2011070103-12","doi-asserted-by":"crossref","unstructured":"de Moura, E. S., Navarro, G., & Ziviani, N. (1997). Indexing compressed text. In Proceedings of the 4th South American Workshop on String Processing, Ottawa, ON, Canada (Vol. 8, pp. 95-111).","DOI":"10.1515\/9780773591400-010"},{"key":"jitwe.2011070103-13","doi-asserted-by":"publisher","DOI":"10.1145\/1125857.1125859"},{"issue":"1","key":"jitwe.2011070103-14","first-page":"12","article-title":"Compressed text indexes: From theory to practice.","volume":"13","author":"P.Ferragina","year":"2009","journal-title":"Journal of Experimental Algorithmics"},{"key":"jitwe.2011070103-15","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Luccio, F., Manzini, G., & Muthukrishnan, S. (2005). Structuring labeled trees for optimal succinctness, and beyond. In Proceedings of the IEEE Symposium on Foundations of Computer Science (pp. 184-193).","DOI":"10.1109\/SFCS.2005.69"},{"key":"jitwe.2011070103-16","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"jitwe.2011070103-17","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G., Makinen, V., & Navarro, G. (2007). Compressed representation of sequences and full-text indexes. ACM Transactions on Algorithms, 3(2).","DOI":"10.1145\/1240233.1240243"},{"key":"jitwe.2011070103-18","unstructured":"Gonzalez, R., & Navarro, G. (2006, July 5-7). Statistical encoding of succinct data structures. In Proceedings of the 17th Annual Conference on Combinatorial Pattern Matching, Barcelona, Spain (pp. 295-306)."},{"key":"jitwe.2011070103-19","doi-asserted-by":"crossref","unstructured":"Gonzalez, R., & Navarro, G. (2007a, July 9-11). Compressed text indexes with fast locate. In Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching, London, ON, Canada (pp. 216-227).","DOI":"10.1007\/978-3-540-73437-6_23"},{"key":"jitwe.2011070103-20","unstructured":"Gonzalez, R., & Navarro, G. (2007b). A compressed text index on secondary memory. In Proceedings of the 18th International Workshop on Combinatorial Algorithms (pp. 80-91)."},{"key":"jitwe.2011070103-21","unstructured":"Hadoop. (2011). What is Hadoop? Retrieved from http:\/\/hadoop.apache.org\/#What+Is+Hadoop%3F"},{"key":"jitwe.2011070103-22","author":"M.Levene","year":"2005","journal-title":"An introduction to search engine and navigation"},{"key":"jitwe.2011070103-23","unstructured":"Long, X., & Suel, T. (2003, September 9-12). Optimized query execution in large search engines with global page ordering. In Proceedings of the 29th International Conference on Very Large Databases, Berlin, Germany (Vol. 29)."},{"key":"jitwe.2011070103-24","unstructured":"Lucene. (2011). What is Apache Lucene? Retrieved from http:\/\/lucene.apache.org\/#What+Is+Apache+Lucene%3F"},{"key":"jitwe.2011070103-25","doi-asserted-by":"crossref","unstructured":"Melnik, S., Raghavan, S., Yang, B., & Garcia-Molina, H. (2000, May 2-5). Building a distributed full-text index for the Web. In Proceedings of the 10th International World Wide Web Conference, Hong-Kong.","DOI":"10.1145\/371920.372095"},{"key":"jitwe.2011070103-26","unstructured":"Moffat, A., & Culpepper, J. S. (2007, December). Hybrid bitvector index compression. In Proceedings of the 12th Australasian Document Computing Symposium, Melbourne, Australia (pp. 25-31)."},{"key":"jitwe.2011070103-27","unstructured":"Nutch. (2011). About Nutch. Retrieved from http:\/\/nutch.apache.org\/about.html"},{"key":"jitwe.2011070103-28","unstructured":"Solr. (2011). What is Solr? Retrieved from http:\/\/lucene.apache.org\/solr\/#intro"},{"key":"jitwe.2011070103-29","unstructured":"Varadarajan, S., & Chiueh, T. C. (1997). SASE: Implementation of a compressed text search engine. In Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems (p. 23)."},{"key":"jitwe.2011070103-30","unstructured":"Wikipedia. (2011). MapReduce. Retrieved from http:\/\/en.wikipedia.org\/wiki\/MapReduce"},{"key":"jitwe.2011070103-31","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., & Suel, T. (2009, April 20-24). Inverted index compression and query processing with optimized document ordering. In Proceedings of the 18th International Conference on World Wide Web, Madrid, Spain.","DOI":"10.1145\/1526709.1526764"},{"key":"jitwe.2011070103-32","doi-asserted-by":"crossref","unstructured":"Zhang, J., Long, X., & Suel, T. (2008, April 21-25). Performance of compressed inverted list caching in search engines. In Proceeding of the 17th International Conference on the World Wide Web, Beijing, China.","DOI":"10.1145\/1367497.1367550"},{"key":"jitwe.2011070103-33","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132959"}],"container-title":["International Journal of Information Technology and Web Engineering"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=64174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,22]],"date-time":"2024-04-22T21:23:07Z","timestamp":1713820987000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jitwe.2011070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,7,1]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jitwe.2011070103","relation":{},"ISSN":["1554-1045","1554-1053"],"issn-type":[{"value":"1554-1045","type":"print"},{"value":"1554-1053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,1]]}}}