{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:10:24Z","timestamp":1654121424346},"reference-count":28,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,4,1]]},"abstract":"<p>In the authors\u2019 study they evaluate and compare the storage efficiency of different sparse matrix storage structures as index structure for Arabic text collection and their corresponding sparse matrix-vector multiplication algorithms to perform query processing in any Information Retrieval (IR) system. The study covers six sparse matrix storage structures including the Coordinate Storage (COO), Compressed Sparse Row (CSR), Compressed Sparse Column (CSC), Block Coordinate (BCO), Block Sparse Row (BSR), and Block Sparse Column (BSC). Evaluation depends on the storage space requirements for each storage structure and the efficiency of the query processing algorithm. The experimental results demonstrate that CSR is more efficient in terms of storage space requirements and query processing time than the other sparse matrix storage structures. The results also show that CSR requires the least amount of disk space and performs the best in terms of query processing time compared with the other point entry storage structures (COO, CSC). The results demonstrate that BSR requires the least amount of disk space and performs the best in terms of query processing time compared with the other block entry storage structures (BCO, BSC).<\/p>","DOI":"10.4018\/ijirr.2012040105","type":"journal-article","created":{"date-parts":[[2013,2,6]],"date-time":"2013-02-06T16:41:48Z","timestamp":1360168908000},"page":"52-67","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Different Sparse Matrix Storage Structures as Index Structure for Arabic Text Collection"],"prefix":"10.4018","volume":"2","author":[{"given":"Basel","family":"Bani-Ismail","sequence":"first","affiliation":[{"name":"Department of Computer Science, Sultan Qaboos University, Muscat, Oman"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ghassan","family":"Kanaan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Amman Arab University, Amman, Jordan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"ijirr.2012040105-0","doi-asserted-by":"crossref","unstructured":"Ahmed, N., Mateev, N., Pingali, K., & Stodghill, P. (2000). A framework for sparse matrix code synthesis from high-level specifications. In Proceedings of the 2000 ACM\/IEEE Conference on Supercomputing (CDROM) (p. 58).","DOI":"10.1109\/SC.2000.10033"},{"key":"ijirr.2012040105-1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21301"},{"key":"ijirr.2012040105-2","doi-asserted-by":"crossref","unstructured":"Aspn\u00e4s, M., Signell, A., & Westerholm, J. (2007). Efficient assembly of sparse matrices using hashing. In Proceedings of PARA 2006, Applied Parallel Computing, State of the Art in Scientific Computing, (LNCS, pp. 900-907), Berlin, Germany: Springer-Verlag.","DOI":"10.1007\/978-3-540-75755-9_107"},{"issue":"2","key":"ijirr.2012040105-3","first-page":"63","article-title":"The effect of fullword, stem, and root as index-term on Arabic information retrieval.","volume":"11","author":"B.Bani-Ismail","year":"2011","journal-title":"Global Journal of Computer Science and Technology"},{"key":"ijirr.2012040105-4","unstructured":"Carney, S., Heroux, M. A., Li, G., & Wu, K. (1994). A revised proposal for a sparse BLAS toolkit (Tech. Rep. No. 94-034). Minneapolis, MN: University of Minnesota, Army High Performance Computing Research Center."},{"key":"ijirr.2012040105-5","unstructured":"Dinkins, S., Kreaseck, B., & Strout, M. M. (2010, November 4-5). Steps toward simplifying sparse matrix data structures. In Proceedings of the Colorado Celebration of Women in Computing (CCWIC 2010)."},{"key":"ijirr.2012040105-6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"issue":"2","key":"ijirr.2012040105-7","first-page":"1","article-title":"An efficient storage format for large sparse matrices.","volume":"58","author":"A.Farzaneh","year":"2009","journal-title":"Communications Series A1 Mathematics & Statistics"},{"key":"ijirr.2012040105-8","doi-asserted-by":"crossref","unstructured":"Ghwanmeh, S., Kanaan, G., Al-Shalabi, R., & Rabab'ah, S. (2009). Enhanced algorithm for extracting the root of Arabic words. In Proceedings of the 6th International Conference on Computer Graphics, Imaging and Visualization (CGIV 2009) (pp. 388-391).","DOI":"10.1109\/CGIV.2009.10"},{"key":"ijirr.2012040105-9","unstructured":"Goharian, N., El-Ghazawi, T., & Grossman, D. (1999). On the implementation of information retrieval as sparse matrix application. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 1999) (Vol. 3, pp. 1551-1557)."},{"key":"ijirr.2012040105-10","unstructured":"Goharian, N., El-Ghazawi, T., & Grossman, D. (2001). Enterprise text processing: A sparse matrix approach. In Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC 2001) (pp. 71-75)."},{"key":"ijirr.2012040105-11","unstructured":"Goharian, N., El-Ghazawi, T., Grossman, D., & Chowdhury, A. (2000). On the enhancements of a sparse matrix information retrieval approach. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000)."},{"issue":"1","key":"ijirr.2012040105-12","first-page":"39","article-title":"Comparative analysis of sparse matrix algorithms for information retrieval. Journal of Systemics","volume":"1","author":"N.Goharian","year":"2003","journal-title":"Cybernetics and Informatics"},{"key":"ijirr.2012040105-13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-3005-5"},{"key":"ijirr.2012040105-14","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199702)48:2<122::AID-ASI3>3.0.CO;2-#"},{"key":"ijirr.2012040105-15","unstructured":"Jain, A., & Goharian, N. (2002). On parallel implementation of sparse matrix information retrieval engine. In Proceedings of the 2002 International Multi-conferences in Computer Science: On Information and Knowledge Engineering (IKE'02)."},{"key":"ijirr.2012040105-16","doi-asserted-by":"publisher","DOI":"10.1145\/237496.237497"},{"key":"ijirr.2012040105-17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80007-9"},{"key":"ijirr.2012040105-18","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183193000082"},{"key":"ijirr.2012040105-19","author":"S.Pissanetsky","year":"1984","journal-title":"Sparse matrix technology"},{"key":"ijirr.2012040105-20","doi-asserted-by":"crossref","unstructured":"Scholer, F., Williams, H. E., Yiannis, J., & Zobel, J. (2002). Compression of inverted indexes for fast query evaluation. In Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 222-229)","DOI":"10.1145\/564376.564416"},{"issue":"2","key":"ijirr.2012040105-21","first-page":"130","article-title":"Blocked-based sparse matrix-vector multiplication on distributed memory parallel computers.","volume":"8","author":"R.Shahnaz","year":"2011","journal-title":"The International Arab Journal of Information Technology"},{"key":"ijirr.2012040105-22","doi-asserted-by":"crossref","unstructured":"Shahnaz, R., Usman, A., & Chughtai, I. R. (2006). Implementation and evaluation of parallel sparse matrix-vector products on distributed memory parallel computers. In Proceedings of the IEEE International Conference on Cluster Computing (pp. 1-6).","DOI":"10.1109\/CLUSTR.2006.311878"},{"key":"ijirr.2012040105-23","first-page":"39","article-title":"Performance comparison of storage formats for sparse matrices. Facta Universitatis","volume":"24","author":"I. P.Stanimirovi\u0107","year":"2009","journal-title":"Series Mathematics and Informatics"},{"key":"ijirr.2012040105-24","unstructured":"Stein, S., & Goharian, N. (2003). On the mapping of index compression techniques on CSR information retrieval. In Proceedings of the International Conference on Information Technology: Computers and Communications (ITCC 2003) (pp. 661-664)."},{"key":"ijirr.2012040105-25","unstructured":"Tavakoli, F. (1997). Parallel sparse matrix-vector multiplication. Unpublished master's thesis, Royal Institute of Technology (KTH), Stockholm, Sweden."},{"key":"ijirr.2012040105-26","doi-asserted-by":"crossref","unstructured":"White, J. B., III, & Sadayappan, P. (1997). On improving the performance of sparse matrix-vector multiplication. In Proceedings of the Fourth International Conference on High-Performance Computing (pp. 66-71).","DOI":"10.1109\/HIPC.1997.634472"},{"key":"ijirr.2012040105-27","author":"I.Witten","year":"1999","journal-title":"Managing gigabytes: Compressing and indexing documents and images"}],"container-title":["International Journal of Information Retrieval Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=74784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T21:57:16Z","timestamp":1654120636000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijirr.2012040105"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijirr.2012040105","relation":{},"ISSN":["2155-6377","2155-6385"],"issn-type":[{"value":"2155-6377","type":"print"},{"value":"2155-6385","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}