A high-speed dynamic full-text search method by using memory management

Authors: S. Kashiji; El-Sayed Atlam; M. Fuketa; M. Oono; K. Morita; K. Tsuda; J.-I. Aoe

Source: International Journal of Computer Mathematics, Volume 81, Number 12, December 2004 , pp. 1477-1492(16)

Publisher: Taylor and Francis Ltd

Key:

- Free Content

- New Content

- Subscribed Content

- Free Trial Content

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 is necessary because of the amount of increasing handled document and corresponding document data every day. This paper proposes an adaptive block management algorithm that is efficient for dynamic data management method. This algorithm is applied for inverted file searching. The new method speeds up character string retrieval by first making a full-text search of uni-gram and a full-text search of bi-gram. This paper proposes a method for enhancing the static full-text search system of bi-gram to the dynamic full-text search system of bi-gram. Moreover, this paper presents an efficient achievement method of the dynamic full-text search system of bi-gram using effectiveness of the adaptive block management structure.

Keywords: Full-text Search; Inverted File Search; Uni-gram Index; Bi-gram Index; Adaptive Block Management

Document Type: Research article

DOI: 10.1080/00207160412331296643

The full text electronic article is available for purchase. You will be able to download the full text electronic article after payment.

$45.29 plus tax Refund Policy