Skyline queries have become commonplace in many applications. The main problem is to efficiently find the set of Pareto-optimal choices from a large amount of database items. Several algorithms and indexing techniques have been proposed recently, but until now no indexing technique was able to address all problems for skyline queries in realistic applications: fast access, superior scalability ...

Received Jan 15, 2018 Revised Mar 29, 2018 Accepted Apr 11, 2018 Nowadays, in most of the modern database applications, lots of critical queries and tasks cannot be completely addressed by machine. Crowdsourcing database has become a new paradigm for harness human cognitive abilities to process these computer hard tasks. In particular, those problems that are difficult for machines but easier f...

Finding the skyline in a multi-dimensional space is relevant to a wide range of applications. The skyline operator over a set of d-dimensional points selects the points that are not dominated by any other point on all dimensions. Therefore, it provides a minimal set of candidates for the users to make their personal trade-off among all optimal solutions. The existing algorithms establish both t...

Uncertain data arises from various applications such as sensor networks, scientific data management, data integration, and location based applications. While significant research efforts have been dedicated to modeling, managing and querying uncertain data, advanced analysis of uncertain data is still in its early stages. In this paper, we focus on skyline analysis of uncertain data, modeled as...

Skyline Queries have received a lot of attention due to their intuitive query formulation. Following the concept of Pareto optimality all ‘best’ database items satisfying different aspects of the query are returned to the user. However, this often results in huge result set sizes. In everyday’s life users face the same problem. But here, when confronted with a too large variety of choices users...

The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between items to select the most promising ones, based on user preferences. Skyline and top-k dominating queries are examples of such techniques. A skyline query computes the items that are not dominated, whereas a top-k dominating query returns the k items with...

This section of the issue hosts extended versions of the four best papers of the 11th International Symposium on Spatial and Temporal Databases (SSTD 2009). The proceedings of the symposium are published by Springer, as volume 5644 of the series Lecture Notes in Computer Science. More information about it can be found at http://www.springeronline.com/978-3-642-02981-3. For the first time in the...

The skyline problem can be easily solved in linear I/Os in 2D space, after sorting the points of P by x-coordinate (think: how). We will show that the 3D version of the problem can also be settled in O(NB logM/B N B ) I/Os. Our description below follows that of [3]. Algorithm. Our algorithm accepts as input a dataset P whose points are sorted by x-coordinate. If N ≤ M (i.e., the memory capacity...

FOCUS: Does the paper clearly identify the problem it is addressing ? The paper does not clearly identify the problem it is addressing. In order to understand the problem the majority of the paper must be read before understanding that the problem is finding a faster method to find k-dominate skyline queries in preparation for continuous queries. Identify the problem within the first paragraph,...