Abstract
Full-text search is widely used for various services of the Internet. A more high-speed and a more efficient full-text search technology are necessary because of the amount of increasing handled document and corresponding document data every day. An adaptive block management algorithm for efficient dynamic data management and speeding up character string retrieval were proposed. This paper proposes a speed-up technique of the retrieval by dynamic full-text search algorithm. Also, the update efficiency of dynamic full-text search system is very high compared with static full-text search system. So, when comparing 200MB registered document using this system speed will be about 426 times higher than static full-text search system. Moreover, this paper presents an efficient achievement method of the dynamic full-text search system for speeding deletion processing time. This experiment proven that the speed for deletion processing time is very high because the deletion of 50 files was 0.2 s or less.
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
Aoe, J.: Computer Algorithms-String pattern matching. IEEE Computer Society Press, Los Alamitos (1994)
Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 18(6), 333–340 (1975)
Baeza-Yates, R.A.: String Search Algorithms, ch. 10. Information Retrieval: Data Structure and Algorithms. Prentice-Hall, Englewood Cliffs (1992)
Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. of the ACM 20(10), 62–72 (1977)
Chen, Y.: Signature files and signature trees. Information Processing Letters 82, 213–221 (2002)
Frakes, W.B.: Information Retrieval: Data Structures and Algorithms. Prentice Hall, Jersey (1992)
Jung, M., Shishibori, M., Tanaka, Y., Aoe, J.: A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure. Information Processing & Management 38(2), 221–236 (2002)
Kim, J.Y., Taylor, J.: An approximate string-matching algorithm. Theoretical Computer Science 92, 107–117 (1992)
Kirschenhofer, P., Szpankowski, H.: On the balance property of Patricia tries: External path length viewpoint. Theoretical Computer Science 68, 1–17 (1989)
Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern matching in strings. SIAM Journal of Computing 6(2), 323–350 (1977)
NACSIS Test Collection for Information Retrieval (NTCIR) Systems 1 National Center for science Information Systems (1999)
Penn TreeBank Release 2, 1988-1989 Wall Street Journal articles in the Part-Of Speech Tagged Corpora, University of Pennsylvania (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morita, K. et al. (2005). New Approach for Speeding-up Technique of the Retrieval Using Dynamic Full-Text Search Algorithm. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554028_86
Download citation
DOI: https://doi.org/10.1007/11554028_86
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28897-8
Online ISBN: 978-3-540-31997-9
eBook Packages: Computer ScienceComputer Science (R0)