Untitled

Navarro, Gonzalo; Moura, Edleno Silva de; Neubert, Marden; Ziviani, Nívio; Baeza-Yates, Ricardo

doi:10.1023/a:1009934302807

Cited by 81 publications

(7 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To eliminate these redundant data, the inverted list is split into n subsequences and a new tag sequence is constructed by adding tags [14]. Then each subsequence is grouped by tags and processed by using d-gaps [7]. .…”

Section: B Eliminating Redundancy and D-gapsmentioning

confidence: 99%

“…Inverted index and techniques of compression have been studied extensively in the past [1,[5][6][7]. The fundamental theory of compression method is integer transform.…”

Section: Introductionmentioning

confidence: 99%

“…Parameterized code needs to preprocess database and calculate the best parameter before encoding, it includes Golomb [8], etc. While nonparameterized code [7,[9][10] needs not to preprocess database, it includes Unary, Eliasγ , Eliasδ , etc. Reference [10] has shown that the compression ratio of nonparameterized code is not far less than that of parameterized code.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Inverted Index Compression Using Multi-codes

Sun

Wang

2014

2014 Seventh International Symposium on Computational Intelligence and Design

View full text Add to dashboard Cite

How to decrease the space consumed by index is a key issue in big data processing. In this paper, a new compression method is proposed to decrease the space consumption of inverted index. First, a lot of redundant integers are removed by using the techniques of splitting inverted list, adding tags and making groups. Second, the total number of small integers is increased by using d-gaps in each group. Third, these subsequences are compressed using different codes. At last, all compressed subsequences are combined into a long sequence. Experiment results show that our method decreases the compression ratio and its decoding speed is also fast.

show abstract

Section: B Eliminating Redundancy and D-gapsmentioning

confidence: 99%

“…Inverted index and techniques of compression have been studied extensively in the past [1,[5][6][7]. The fundamental theory of compression method is integer transform.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Inverted Index Compression Using Multi-codes

Sun

Wang

2014

2014 Seventh International Symposium on Computational Intelligence and Design

View full text Add to dashboard Cite

show abstract

“…On this basis, Navarro [5] etc study the random addressing method of compression data of inverted table, which provides random access capability and reduces the data amount of disk access.…”

Section: Introductionmentioning

confidence: 99%

Research of Inverted Index Method Based on Block Organizing Technology

Yang

2012

AMR

View full text Add to dashboard Cite

In order to further improve the overall efficiency of retrieval system, it proposes a method of inverted index based on block organizing technology. The specific studying process is as follows. Firstly, retrieval performance model of inverted index is generated based on data statistics, and then analyze the organizational strategy of inverted file block index, finally, retrieval performance model is verified through simulation experiment. The result shows that the method of inverted file block organization can get higher algorithm efficiency under the condition of less cycle numbers in the search algorithm, and also reduce the execution time of search algorithm significantly, which can verify the feasibility of inverted file block index method.

show abstract

“…Text Compression and Indexing. Despite that there has been some work on space-efficient inverted indexes for natural language texts [67,58] (able of finding whole words and phrases), until one decade ago it was believed that any general index for text searching (such as those that we are considering in this paper) would need much more space. In practice, the smallest indexes available were the suffix arrays [47], requiring u log u bits 1 to index a text of u symbols.…”

Section: Introduction and Previous Workmentioning

confidence: 99%