Saif al-Saab

Arab Academy for Banking and Financial Sciences, Computer Information System, Graduate Student

Followers

Following

Co-authors

Public Views

B. Harun Küçük

University of Pennsylvania

Bilami Azeddine

El-Hadj Lakhdar

Marisol de la Cadena

University of California, Davis

Christopher Witmore

Texas Tech University

Armando Marques-Guedes

UNL - New University of Lisbon

Paul Tobin

Dublin Institute of Technology

Roshan Chitrakar

Nepal College of Information Technology

Gerassimos Barlas

American University of Sharjah

Jaydip Sen

Praxis Business School

Prof.Dr. Nadire Cavus

Near East University

Interests

Uploads

Papers by Saif al-Saab

Modeling Artificial Bees Colony System

International Conference on Artificial Intelligence, 2008

The static random access memory reduces the access time thereof and reduces the power consumption... more The static random access memory reduces the access time thereof and reduces the power consumption thereof during its time of operation, and employs a circuit arrangement such that not only is the logical amplitude of each bit line diminished during a read-out operation, but the bit line is precharged after a write operation is accomplished during a write operation.

A Compressed Index-Query Web Search Engine Model

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both 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, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

A web search engine model based on index-query bit-level compression

Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications - ISWSA '10, 2010

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the backend processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

Development of a Novel Compressed Index-Query Web Search Engine Model

International Journal of Information Technology and Web Engineering, 2011

In this paper, the authors present a description of a new Web search engine model, the compressed... more 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 prop...

Download

A web search engine model based on index-query bit-level compression

by Shakir Hussain and Saif al-Saab

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the backend processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

Development of a Novel Compressed Index-Query Web Search Engine Model

by Saif al-Saab and Hussein Al-Bahadili

International Journal of Information Technology and Web Engineering, 2000

Development of a Novel Compressed Index-Query Web Search Engine Model

by Saif al-Saab and Hussein Al-Bahadili

Modeling Artificial Bees Colony System

Ic Ai, 2008

Developing optimization algorithm using artificial bee colony system

by Saif al-Saab and N. El-Omari

ABSTRACT More recently, computer scientists have found in the study of social insect&#x27;s b... more

A web search engine model based on index-query bit-level compression

by Hussein Al-Bahadili, Reyadh Naoum, and Saif al-Saab

Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications - ISWSA '10, 2010

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the backend processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

A Novel Compressed Index-Query Web Search Engine Model

by Saif al-Saab and Hussein Al-Bahadili

Abstract: In this paper we present a description of a new Web search engine model, namely, the co... more Abstract: In this paper we present a description of a new Web search engine model, namely, the compressed index-query (CIQ) Web search engine model, which 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 to evaluate the performance of new Web search engine model. The test results demonstra...

Download

Modeling Artificial Bees Colony System

International Conference on Artificial Intelligence, 2008

A Compressed Index-Query Web Search Engine Model

Download

A web search engine model based on index-query bit-level compression

Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications - ISWSA '10, 2010

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the backend processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

Development of a Novel Compressed Index-Query Web Search Engine Model

International Journal of Information Technology and Web Engineering, 2011

Download

A web search engine model based on index-query bit-level compression

by Shakir Hussain and Saif al-Saab

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the backend processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

Development of a Novel Compressed Index-Query Web Search Engine Model

by Saif al-Saab and Hussein Al-Bahadili

International Journal of Information Technology and Web Engineering, 2000

Development of a Novel Compressed Index-Query Web Search Engine Model

by Saif al-Saab and Hussein Al-Bahadili

Modeling Artificial Bees Colony System

Ic Ai, 2008

Developing optimization algorithm using artificial bee colony system

by Saif al-Saab and N. El-Omari

ABSTRACT More recently, computer scientists have found in the study of social insect&#x27;s b... more

A web search engine model based on index-query bit-level compression

by Hussein Al-Bahadili, Reyadh Naoum, and Saif al-Saab

Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications - ISWSA '10, 2010

In this paper, we propose a new web search engine model based on index-query bit-level compressio... more In this paper, we propose a new web search engine model based on index-query bit-level compression. The model incorporates two bit-level compression layers both implemented at the backend processor (server) side, one layer resides after the indexer acting as a second compression layer to generate a double compressed index, and the second layer be located after the query parser for query compression to enable bit-level compressed index-query search. This contributes to reducing the size of the index file as well as reducing disk I/O overheads, and consequently yielding higher retrieval rate and performance. The data compression scheme used in this model is the adaptive character wordlength (ACW(n,s)) scheme, which is an asymmetric, lossless, bit-level scheme that permits compressed index-query search. Results investigating the performance of the ACW(n,s) scheme is presented and discussed.

Download

A Novel Compressed Index-Query Web Search Engine Model

by Saif al-Saab and Hussein Al-Bahadili

Download

Saif al-Saab

Related Authors

Uploads

Papers by Saif al-Saab

Log In