Skip to main content
SpringerLink
Log in

Relational Data Model in Document Hierarchical Indexing

  • Conference paper
  • First Online:
Book cover Advances in Natural Language Processing (PorTAL 2002)

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

Included in the following conference series:

  • 481 Accesses

Abstract

One of the problems of the development of document indexing and retrieval applications is the usage of hierarchies. In this paper we describe a method of automatic hierarchical indexing using the traditional relational data model. The main idea is to assign continuous numbers to the words (grammatical forms of the words) that characterize the nodes in the hierarchy (concept tree). One of the advantages of the proposed scheme is its simplicity. The system that implements such indexing scheme is described.

The work was done under partial support of CONACyT, CGEPI-IPN, and SNI, Mexico.

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. Baeza-Yates, R., and B. Ribeiro-Neto. Modern information retrieval. Addison-Wesley Longman. 1999.

    Google Scholar 

  2. Gelbukh, A. Lazy Query Enrichment: A Simple Method of Indexing Large Specialized Document Bases. Proc. DEXA-2000. LNCS 1873, Springer, pp. 526–535.

    Google Scholar 

  3. Gelbukh, A. and G. Sidorov. Intelligent system for document retrieval of the Mexican Senate. Proc. CIC-2000, IPN, Mexico, pp. 315–321.

    Google Scholar 

  4. Gelbukh, A., G. Sidorov, and A. Guzman-Arenas. Use of a weighted topic hierarchy for text retrieval and classification. In TSD-99, LNAI 1692, Springer, pp. 130–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Computing Research, National Polytechnic Institute, Av. Juan Dios Batiz s/n, Zacatenco, 07738, Mexico City, Mexico

    Alexander Gelbukh, Grigori Sidorov & Adolfo Guzmán-Arenas

Authors
  1. Alexander Gelbukh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grigori Sidorov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Adolfo Guzmán-Arenas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidade de Lisboa e CAUTL (IST), Av. Rovisco Pais, 1049-001, Lisboa, Portugal

    Elisabete Ranchhod

  2. L2F/INESC ID Lisboa, Technical University of Lisbon, Av. Rovisco Pais, 1049-001, Lisboa, Portugal

    Nuno J. Mamede

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gelbukh, A., Sidorov, G., Guzmán-Arenas, A. (2002). Relational Data Model in Document Hierarchical Indexing. In: Ranchhod, E., Mamede, N.J. (eds) Advances in Natural Language Processing. PorTAL 2002. Lecture Notes in Computer Science(), vol 2389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45433-0_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-45433-0_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43829-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation