Relational Data Model in Document Hierarchical Indexing

  • Alexander Gelbukh
  • Grigori Sidorov
  • Adolfo Guzmán-Arenas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2389)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Alexander Gelbukh
    • 1
  • Grigori Sidorov
    • 1
  • Adolfo Guzmán-Arenas
    • 1
  1. 1.Center for Computing ResearchNational Polytechnic InstituteMexico CityMexico

Personalised recommendations