New approach for speeding-up technique of the retrieval using dynamic full-text search algorithm

Authors:
Kazuhiro Morita;El-Sayed Atlam;Masao Fuketa;Elmarhomy Ghada;Masaki Oono;Toru Sumitomo;Jun-ichi Aoe
Affiliations:
Department of Information Science and Intelligent Systems, University of Tokushima, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Japan;Department of Information Science and Intelligent Systems, University of Tokushima, Japan
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Year:
2005

Citing 9
Cited 0

On the balance property of Patricia tries: external path length viewpoint

Theoretical Computer Science
Information retrieval: data structures and algorithms

Information retrieval: data structures and algorithms
String searching algorithms

Information retrieval
An approximate string-matching algorithm

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Computer Algorithms: String Pattern Matching Strategies

Computer Algorithms: String Pattern Matching Strategies
Signature files and signature trees

Information Processing Letters
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure

Information Processing and Management: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.