D. K. Harman, E. A. Fox, R. Baeza-Yates and W. C. Lee. Inverted files. In Information Retrieval: Data Structures and Algorithms, W. B Frakes and R. Baeza-Yates (Eds). Prentice-Hall, Englewood Cli#s, N.J. pp. 28-43 (1992) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Structured Information Retrieval in XML documents - Kotsakis (2002) (4 citations) (Correct)
....between the node c of the path tree, for which tag(c) tag(t) and each newly inserted literal term of the inverted file. This particular reference associates a term with the path in the document where the term is located. The inverted file update is not discussed here. This is fully presented in [10], which also includes a few modifications that facilitate the creation of very large inverted files . The UpdateInvertedF ile procedure is used as an interface for updating the inverted file and creating the necessary links to the path index. This UpdateInvertedFile(I, t, c) Comments: content(t) ....
D. K. Harman, E. A. Fox, R. Baeza-Yates and W. C. Lee. Inverted files. In Information Retrieval: Data Structures and Algorithms, W. B Frakes and R. Baeza-Yates (Eds). Prentice-Hall, Englewood Cli#s, N.J. pp. 28-43 (1992)
Hierarchies Of Indices For Text Searching - Baeza-Yates, al. (1996) Self-citation (Baeza-yates) (Correct)
.... makes Glimpse inadequate to be used for very large texts (say over 250 megabytes) y Recommended by Stavros Christodoulakis 498 Nivio Ziviani et al. There are several structures that can be used in implementing lexicographical inverted files, such as sorted arrays, prefix B trees and tries [13]. Compared with sorted arrays, prefix B trees and tries use more space. On the other hand, updates are easier in B trees than in sorted arrays, and cannot be done efficiently in tries and pat arrays. Tries are very efficient because the search is directed by the query itself, giving a search time ....
D. Harman, E. Fox, R. Baeza-Yates and W. Lee. Inverted files. In W. B. Frakes and R. Baeza-Yates, editors, Information Retrieval Data Structures and Algorithms, pp. 28--43, Prentice-Hall, Englewoods Cliff, N.J. (1992).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC