An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems

Jin Ho Kim, Ju Young Kim, Sang Wook Kim, Soo Ho Ok, Hi Young Roh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)
Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsEe-Peng Lim, Schubert Foo, Chris Khoo, Edward Fox, Thanos Costantino, Hsinchun Chen, Shalini Urs
PublisherSpringer Verlag
Number of pages1
ISBN (Print)3540002618, 9783540002611
StatePublished - 2002 Jan 1
Event5th International Conference on Asian Digital Libraries, ICADL 2002 - Singapore, Singapore
Duration: 2002 Dec 112002 Dec 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2555
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Conference on Asian Digital Libraries, ICADL 2002
CountrySingapore
CitySingapore
Period02/12/1102/12/14

Fingerprint

B-tree
Information retrieval systems
Information Retrieval
Strategy

Cite this

Kim, J. H., Kim, J. Y., Kim, S. W., Ok, S. H., & Roh, H. Y. (2002). An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems. In E-P. Lim, S. Foo, C. Khoo, E. Fox, T. Costantino, H. Chen, & S. Urs (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2555). Springer Verlag.
Kim, Jin Ho ; Kim, Ju Young ; Kim, Sang Wook ; Ok, Soo Ho ; Roh, Hi Young. / An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Ee-Peng Lim ; Schubert Foo ; Chris Khoo ; Edward Fox ; Thanos Costantino ; Hsinchun Chen ; Shalini Urs. Springer Verlag, 2002. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6bbbfce7bf0549298323045be821cfc1,
title = "An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems",
author = "Kim, {Jin Ho} and Kim, {Ju Young} and Kim, {Sang Wook} and Ok, {Soo Ho} and Roh, {Hi Young}",
year = "2002",
month = "1",
day = "1",
language = "English",
isbn = "3540002618",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
editor = "Ee-Peng Lim and Schubert Foo and Chris Khoo and Edward Fox and Thanos Costantino and Hsinchun Chen and Shalini Urs",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 E-P Lim, S Foo, C Khoo, E Fox, T Costantino, H Chen & S Urs (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2555, Springer Verlag, 5th International Conference on Asian Digital Libraries, ICADL 2002, Singapore, Singapore, 02/12/11.

An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems. / Kim, Jin Ho; Kim, Ju Young; Kim, Sang Wook; Ok, Soo Ho; Roh, Hi Young.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Ee-Peng Lim; Schubert Foo; Chris Khoo; Edward Fox; Thanos Costantino; Hsinchun Chen; Shalini Urs. Springer Verlag, 2002. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2555).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems

AU - Kim, Jin Ho

AU - Kim, Ju Young

AU - Kim, Sang Wook

AU - Ok, Soo Ho

AU - Roh, Hi Young

PY - 2002/1/1

Y1 - 2002/1/1

UR - http://www.scopus.com/inward/record.url?scp=33747879710&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33747879710

SN - 3540002618

SN - 9783540002611

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Lim, Ee-Peng

A2 - Foo, Schubert

A2 - Khoo, Chris

A2 - Fox, Edward

A2 - Costantino, Thanos

A2 - Chen, Hsinchun

A2 - Urs, Shalini

PB - Springer Verlag

ER -

Kim JH, Kim JY, Kim SW, Ok SH, Roh HY. An efficient strategy for adding bulky data into B+-tree indices in information retrieval systems. In Lim E-P, Foo S, Khoo C, Fox E, Costantino T, Chen H, Urs S, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2002. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).