Mar 24, 2014 · This work is the first attempt to provide efficient algorithms for top-k dominating query processing in the semi-dynamic and the fully-dynamic ...

In this work, we focus on the 2-dimensional space and present, for the first time, novel algorithms for top-k dominating query process- ing in main memory with ...

This work presents, for the first time, novel algorithms for top-k dominating query processing in main memory with non-trivial asymptotic guarantees in the ...

Dynamic Processing of Dominating Queries with. Performance Guarantees. Andreas Kosmatopoulos, Apostolos N. Papadopoulos, and Kostas Tsichlas. Aristotle ...

The paper examines errors in the experimental determination of the geometrical focus of a radio-optical focusing system (part of a system of optical ...

Title: Dynamic Processing of Dominating Queries with Performance Guarantees ; Authors: Kosmatopoulos Andreas, Papadopoulos Apostolos (School of Informatics, ...

Our work is based on the concept of dominance which compares data objects based on maximization preferences on the attribute values.

Dynamic Processing of Dominating Queries with Performance Guarantees. Andreas Kosmatopoulos, Apostolos N. Papadopoulos, Kostas Tsichlas pp. 225-234. [PDF] ...

Performance of Lazy depends on its traversal order. ▫. Intuitive order: choose ... Approximate top-k dominating result, with error guarantee. Page 22. 22.

Top-k dominating queries combine the natural idea of selecting the k best items with a comprehensive “goodness” criterion based on dominance.