Skip to main content
SpringerLink
Log in

A Fast Dynamic Method Using Memory Management

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3213))

  • 506 Accesses

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. 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 is speeding up character string retrieval by first making the full-text search of Uni-gram and by the full-text search of Bi-gram. This paper proposes a method of 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aoe, J.: Computer Algorithms- String pattern matching. IEEE Computer Society Press, Los Alamitos (1994)

    Google Scholar 

  2. Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Search. Communications of the ACM 18(6), 333–340 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  3. Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM 20(10), 62–72 (1977)

    Article  Google Scholar 

  4. Frakes, W.B.: Information Retrieval: Data Structures and Algorithms. Prentice Hall, New Jersey (1992)

    Google Scholar 

  5. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern matching in strings. SIAM Journal of Computing 6(2), 323–350 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  6. NACSIS Test Collection for Information Retrieval (NTCIR) Systems 1, National Center for science Information Systems (1999)

    Google Scholar 

  7. Penn TreeBank Release 2, Wall Street Journal articles in the P-O-S Tagged Corpora, Pennsylvania Univ (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science and Intelligent Systems, University of Tokushima, Tokushima, 770-8506, Japan

    Shinkaku Kashiji, Toru Sumitomo, Kazuhiro Morita, Masaki Oono, Masao Fuketa & Jun-ichi Aoe

Authors
  1. Shinkaku Kashiji
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toru Sumitomo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kazuhiro Morita
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Masaki Oono
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Masao Fuketa
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Jun-ichi Aoe
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. KES International, 2nd Floor, 145-157 St John Street, EC1V 4PY, London, United Kingdom

    Mircea Gh. Negoita

  2. Centre for SMART systems Engineering Research Centre, University of Brighton, BN2 4GJ, Moulsecoomb, Brighton, UK

    Robert J. Howlett

  3. School of Electrical and Information Engineering, Knowledge Based Intelligent Engineering Systems Centre, University of South Australia, 5095, Mawson Lakes, SA, Australia

    Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kashiji, S., Sumitomo, T., Morita, K., Oono, M., Fuketa, M., Aoe, Ji. (2004). A Fast Dynamic Method Using Memory Management. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30132-5_78

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30132-5_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23318-3

  • Online ISBN: 978-3-540-30132-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation