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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baeza-Yates, R., and B. Ribeiro-Neto. Modern information retrieval. Addison-Wesley Longman. 1999.
Gelbukh, A. Lazy Query Enrichment: A Simple Method of Indexing Large Specialized Document Bases. Proc. DEXA-2000. LNCS 1873, Springer, pp. 526–535.
Gelbukh, A. and G. Sidorov. Intelligent system for document retrieval of the Mexican Senate. Proc. CIC-2000, IPN, Mexico, pp. 315–321.
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.
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
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