The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
: Statistics that accurately describe the distribution of data values in the columns of relational tables are essential for effective query optimization in a database management sy...
Alexander Behm, Volker Markl, Peter J. Haas, Kesha...
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...