@inproceedings{Pfeifer/Fuhr:93,
author={U. Pfeifer and N. Fuhr},
title={Aufwandsabsch{\"a}tzung f{\"u}r die Prozessierung vager Anfragen auf der Basis des Datenstrom-Ansatzes},
booktitle={Datenbanksysteme in B{\"u}ro, Technik und Wissenschaft},
pages={375--392},
address={Heidelberg et al.},
publisher={Springer},
abstract={In this paper, we consider vague queries in text and fact databases. A vague query can be formulated as a combination of vague criteria. A single database object can meet a vague criterion to a certain degree. We confine ourselves to queries for which the answer can be computed efficiently by (perhaps repetitive) combination of rankings to new rankings. Since users usually will inspect some of the best answer objects only, the corresponding rankings need to be computed just as far as necessary to generate these first answer objects. In this contribution we describe an approach for estimating the number of elements needed from the basic rankings to compute a given number of elements of the resulting ranking. Experiments with a large text database prove the applicability of our approach.},
classification-codes={H.3.3; H.2.4},
entrydate=19921217,
free-terms={stream-oriented},
subject-descriptors={query processing; selection process},
year=1993
}