Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moffat, A., Zobel, J.: Self-Indexing Inverted Files for Fast Text Retrieval. ACM Transactions on Information System 14(4), 349–379 (1996)
Zobel, J., Moffat, A.: Sacks – Davis. An Efficient Indexing Technique for Full- Text Database Systems. In: Proceedings of the 18th Inter. Conf. on VLDB, pp. 352–362 (1992)
Golomb: Run-Length Encodings. IEEE Transactions on Information Theory IT- 12(3), 399–401 (1996)
Roberts, C.: Partial-match retrieval via the method of superimposed code. Proceeding of the IEEE 67(12), 1624–1642 (1979)
Faloutsos, C.: Access methods for text. Computing Survey 17(1), 49–74 (1985)
Christodoulakis, S., Faloutsos, C.: Design Considerations for a Message File Server. TSE 10(2), 201–210 (1984)
Zobel, J., Moffat, A., Ramamohanarao, K.: Inverted files versus signature files for text indexing. Transactions on Database Systems 23(4), 453–490 (1998)
Muthukrishnan, S.: Efficient Algorithms for Document Retrieval Problems. In: Proc. ACM-SIAM SODA, pp. 657–666 (2002)
Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)
R. Grossi, J.S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). STOC 2000: 397- 406, 1999.
Yunfa, H., Shuigeng, Z.: A New Model of Chinese Full-text databases. In: Proceeding World Multiconference on Systemics, Cybernetics and Informatics, Florida, USA, pp. 528–533 (2001)
Xiaopeng, T., Yunfa, H., Shuigeng, Z.: Subsequent Array: A New Full Text Index. In: Proceeding World Multiconference on Systemics, Cybernetics and Informatics, Florida, USA, pp. 551–556 (2001)
Farach, M., Ferragina, P., Muthukrishnan, S.: Overcoming the Memory Bottleneck in Suffix Tree Construction. In: Proc. of IEEE FOCS, pp. 174–183 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Shen, Z., Wang, J., Hu, Y. (2004). Inter-relevant Successive Trees Model and Its Implementation. In: Yu, J.X., Lin, X., Lu, H., Zhang, Y. (eds) Advanced Web Technologies and Applications. APWeb 2004. Lecture Notes in Computer Science, vol 3007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24655-8_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-24655-8_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21371-0
Online ISBN: 978-3-540-24655-8
eBook Packages: Springer Book Archive