Abstract
In Internet-based information retrieval systems, a large amount of data are periodically collected from the Internet by robot agents and stored into a database. For fast retrieval, their key values are also added into an existing index, widely constructed as an inverted file using a B+-tree. Obviously, the simplest method of adding multiple key values into a B+-tree is to apply the insertion algorithm repeatedly. However, this method inserts new key values into a B+-tree in a random order without considering adjacency between them. This makes each page within the B+-tree accessed a lot of times, and thus requires large processing time. To solve this problem, we present a new method called Bulk_Add that effectively adds a bulky set of new key values into an existing B+-tree index.
This work was supported by the KOSEF through Advanced Information Technology Research Center, the Research Project(Grant KRF-2000-041-E00258) of Korea Research Foundation, and the Basic Research Project(Grant R05-2002-000-01085-0) of KOSEF
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
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, JH., Kim, JY., Kim, SW., Ok, SH., Roh, HY. (2002). An Efficient Strategy for Adding Bulky Data into B+-Tree Indices in Information Retrieval Systems. In: Lim, E.P., et al. Digital Libraries: People, Knowledge, and Technology. ICADL 2002. Lecture Notes in Computer Science, vol 2555. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36227-4_75
Download citation
DOI: https://doi.org/10.1007/3-540-36227-4_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00261-1
Online ISBN: 978-3-540-36227-2
eBook Packages: Springer Book Archive