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

Authors:
Hussein Al-Bahadili;Saif Al-Saab;Reyadh Naoum;Shakir M. Hussain
Affiliations:
The Arab Academy for Banking & Financial Sciences, Amman, Jordan;The Arab Academy for Banking & Financial Sciences, Amman, Jordan;The Arab Academy for Banking & Financial Sciences, Amman, Jordan;Petra University, Amman, Jordan
Venue:
Proceedings of the 1st International Conference on Intelligent Semantic Web-Services and Applications
Year:
2010

Citing 20
Cited 0

Text compression

Text compression
Algorithm 673: Dynamic Huffman coding

ACM Transactions on Mathematical Software (TOMS)
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Building a distributed full-text index for the Web

Proceedings of the 10th international conference on World Wide Web
Query optimization in compressed database systems

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
High-order entropy-compressed text indexes

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Index compression using fixed binary codewords

ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Indexing compressed text

Journal of the ACM (JACM)
Structuring labeled trees for optimal succinctness, and beyond

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Boosting the performance of Web search engines: Caching and prefetching query results by exploiting historical usage data

ACM Transactions on Information Systems (TOIS)
Inverted files for text search engines

ACM Computing Surveys (CSUR)
An Introduction to Search Engines and Web Navigation

An Introduction to Search Engines and Web Navigation
Compressed representations of sequences and full-text indexes

ACM Transactions on Algorithms (TALG)
SASE: implementation of a compressed text search engine

USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Optimized query execution in large search engines with global page ordering

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
An adaptive character wordlength algorithm for data compression

Computers & Mathematics with Applications
Web search garage

Web search garage
Compressed Text Indexes with Fast Locate

CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Compressed text indexes: From theory to practice

Journal of Experimental Algorithmics (JEA)
Statistical encoding of succinct data structures

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.