论文信息 - Inter-relevant Successive Trees Model and Its Implementation

Inter-relevant Successive Trees Model and Its Implementation

Nowadays there are some popular full-text index models, such as the Inverted-File model, Signature File model and Pat array model. But all these models have their own disadvantages. In this paper a new full-text index model-Inter-relevant Successive Trees model is put forward. Experiments show that it outperforms Inverted-File Model.

[1] S. Muthukrishnan,et al. Efficient algorithms for document retrieval problems , 2002, SODA '02.

[2] Kotagiri Ramamohanarao,et al. Inverted files versus signature files for text indexing , 1998, TODS.

[3] S. Muthukrishnan,et al. Overcoming the memory bottleneck in suffix tree construction , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[4] C.S. Roberts,et al. Partial-match retrieval via the method of superimposed codes , 1979, Proceedings of the IEEE.

[5] Christos Faloutsos,et al. Access methods for text , 1985, CSUR.

[6] Alistair Moffat,et al. An Efficient Indexing Technique for Full Text Databases , 1992, Very Large Data Bases Conference.

[7] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.

[8] Solomon W. Golomb,et al. Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.

[9] Alistair Moffat,et al. Self-indexing inverted files for fast text retrieval , 1996, TOIS.

[10] Christos Faloutsos,et al. Design Considerations for a Message File Server , 1984, IEEE Transactions on Software Engineering.