Research on the Compression Algorithm with Querying without Decompression Based on the Streamline Dynamic Successive Trees

Lin Huo; Xiao Xing; Xian Ze Zou

doi:10.4028/www.scientific.net/AMR.482-484.149

Paper Titles

Study on Enhancing Recovery Factor of Binary Compound Flooding Using Surface-Active Polymer as Pre-Slug
p.117

Application of Pulsed Blowing Technique in High-Lift Control Surface Design
p.121

Implementation of Indoor Wireless Positioning System in an Omni-Wheel Robot Based on Gyroscope
p.126

Gender Diversity Research in the Slovak Republic and the Participation of Women in Top Management Positions in Science and Research
p.136

Research on the Compression Algorithm with Querying without Decompression Based on the Streamline Dynamic Successive Trees
p.149

Analysis of Horizontal Squeeze Casting Process for Pipe Oil Part
p.154

Fabric Defect Detection Scheme Based on Gabor Filter and PCA
p.159

Novel Approach to Fabricate an Amperometric Biosensor by One-Step Electrodeposition Hemoglobin and Au Nanoparticles-Chitosan Nanocomposite Film on Carbon Ionic Liquid Electrode
p.164

Video Steganalysis Exploiting Motion Vector Calibration-Based Features
p.168

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 482-484Research on the Compression Algorithm with...

Research on the Compression Algorithm with Querying without Decompression Based on the Streamline Dynamic Successive Trees

Abstract:

Index compression is an effective way to solve the problem that the index is too huge when mass information is retrieved. Based on the Streamline Dynamic Successive Trees(SDST) index, a compression method with querying on the index without decompression is proposed in this paper.It also presents the compression algorithm,the algorithm of how to retrieve without decompression.The experiments show that the compression efficiency of SDST is much better than that of the IF index and its querying time is much less.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 482-484)

Pages:

149-153

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.482-484.149

Citation:

Cite this paper

Online since:

February 2012

Authors:

Lin Huo, Xiao Xing, Xian Ze Zou

Keywords:

Compression Method, Index Compression, Querying without Decompression, Streamline Dynamic Successive Trees

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] C.Buckley A.F. Lewit. Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieva(1985),pp.97-110.

Google Scholar

[2] Xuewen Liu, Xiaopeng Tao, Yu Yu, et al. Journal Of Software(2002),pp.150-158(In Chinese).

Google Scholar

[3] Lin Huo,Junwen Huang,Zhengding Lu,ect.Journal of Chinese Cmoputer Systems.vol 31(2010),pp.286-290 (In Chinese).

Google Scholar

[4] Xiaozhu Liu, Zhiyong Peng.Journal of Software, (2009),p.1768−1784(In Chinese).

Google Scholar

[5] Daniel K. Blandford Guy E.Blelloch. SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms.(2004),pp.11-19

Google Scholar

[6] Jiangong Zhang, Xiaohui Long, Torsten Suel. Proceeding of the 17th international conference on World Wide Web.(2008),pp.387-396 (In Chinese).

Google Scholar

[7] Ian H.Witten,Alistair Moffat.A Harcourt Science and Technology Company. San Diego.(1999)

Google Scholar

[8] Moffat A.Lang Stuiver.Information Retrieval(2000). pp.25-47.

Google Scholar

[9] Vongoc Anh Alistair Moffat. Information Retrieval,(2005),p.151–166

Google Scholar

[10] Xiaozhu Liu, Zhiyong Peng.Chinese Journal of Computers.(2010)pp.977-987 (In Chinese).

Google Scholar