Coding methods for text string search on compressed databases

摘要

A method for the partitioning of a compressed database is presented. The partitioned database is held as an inverted list for ease of string searching. An algorithm for mapping the string onto the search keys is also presented. The analysis shows that it is possible to hold a database as an inverted list and still obtain reasonable compression.