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
Index compression using fixed binary codewords
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
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
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
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
A novel lossless data compression scheme based on the error correcting Hamming codes
Computers & Mathematics with Applications
Web search garage
Compressed text indexes: From theory to practice
Journal of Experimental Algorithmics (JEA)
Inverted index compression and query processing with optimized document ordering
Proceedings of the 18th international conference on World wide web
Statistical encoding of succinct data structures
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
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.