文献类型：会议论文

英文题名：An Efficient Approach for Building Compressed Full-text Index for Structured Data

作者：Liang, Jun[1];Xiao, Lin[2];Zhang, Di[3]

通讯作者：Liang, J[1]

机构：[1]Beijing Union Univ, Training Ctr Elect Informat, Beijing, Peoples R China;[2]Beijing Union Univ, Coll Appl Sci & Technol, Beijing, Peoples R China;[3]Chinese Acad Sci, Inst Software, Beijing, Peoples R China

第一机构：北京联合大学工科综合实验教学示范中心

通讯机构：[1]corresponding author), Beijing Union Univ, Training Ctr Elect Informat, Beijing, Peoples R China.|[1141791]北京联合大学工科综合实验教学示范中心;[11417]北京联合大学;

会议论文集：4th International Conference on Computer Sciences and Convergence Information Technology

会议日期：NOV 24-26, 2009

会议地点：Seoul, SOUTH KOREA

语种：英文

外文关键词：self-index; compressed full-text index; data compression; structured data

摘要：The self-index is a kind of highly compressed, self-contained full-text index. It is designed for indexing plain texts in order to reduce its permanent storage, as well as to enhance searching performance. Apart from being a sequence of characters, usually the text has specific internal structure. The data record, as a basic model of structured data, is therefore employed to represent and organize such form of data widespread. In this paper, we design and implement an approach to building the self-index for data records via text medium. Our approach indexes the data records through an intermediate text which accommodates aligned record fields by stuffing delimiters among them. By theoretical analysis, we give the upper bounds of permanent space of our approach in a worst case. In addition, we report a series of experimental results to validate the correctness and efficiency of the proposed approach.