Compression of double array structures for fixed length keywords

作者：

Highlights：

• A new compression method of the double array is proposed.

• The BASE array is removed from the double array.

• The retrieval and construction algorithms are proposed.

• The space usage of our method is more compact than that of the double array.

• The retrieval speed of our method is almost the same as the double array.

摘要

•A new compression method of the double array is proposed.•The BASE array is removed from the double array.•The retrieval and construction algorithms are proposed.•The space usage of our method is more compact than that of the double array.•The retrieval speed of our method is almost the same as the double array.

论文关键词：Trie,Double array,Fixed length keyword,Compression method

论文评审过程：Received 5 October 2011, Revised 31 March 2014, Accepted 7 April 2014, Available online 3 May 2014.

论文官网地址：https://doi.org/10.1016/j.ipm.2014.04.004