Istituto di Scienza e Tecnologie dell'Informazione     
Gibbs S. Document query simulation and Processing heuristics. Internal note IEI-B4-26, 1987.
This paper contains a study of query simulation and presents a number of query processing heuristics. The heuristics can be expressed using the notions of "pivot predicates". Given an arbitrary predicate p, a pivot predicate for p is one whose satisfaction is implied by satisfaction of p, a pin predicate for p is one whose satisfaction implies the satisfaction of p. Methods are described for constructing two pivot predicates -Attpivot(p) and TextPivot(p), and two pin predicates -Attpin(p) and TextPin(p). Attpivot(p) and Attpin(p) refer only to attributs valued documents components while TextPivot(p) and TextPin(p) refer only to text valued components.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional