DEFINITION: Given a set of points p1, p2, ......., pn, the skyline query returns a set of points P, called as the skyline points, such that any point pi ∈ P is not dominated by any other point in the dataset. A point p1 dominates another point p2, if p1 is not worse than p2 in all dimensions and p1 is better than p2 in at least one dimension. In other words, a point p1 dominates another point p...

Several algorithms for processing reverse skyline queries have been proposed in recent literature. However, these algorithms are based on pre-processing approaches, and hence involve complex procedures and waste storage space due to inefficient use of storage. In addition, they are not robust to frequently changing data as, they have to re-compute and update the pre-computed results. To overcom...

Looking at a countryside, human has no difficulty to identify salient information such as skyline in case of benign weather. At the same time, during the last decade, smartphones are more and more abundant in our daily life with always new efficient proposed services but augmented reality systems suffer from a lack of performance to offer a well adapted tool in this context. The aim of this pap...

Estimation of demographic history from nucleotide sequences represents an important component of many studies in molecular ecology. For example, knowledge of a population's history can allow us to test hypotheses about the impact of climatic and anthropogenic factors. In the past, demographic analysis was typically limited to relatively simple population models, such as exponential or logistic ...

The skyline of a set of points in the plane is the subset of maximal points, where a point (x, y) is maximal if no other point (x′, y′) satisfies x′ ≥ x and y′ ≥ x. We consider the problem of preprocessing a set P of n points into a space efficient static data structure supporting orthogonal skyline counting queries, i.e. given a query rectangle R to report the size of the skyline of P ∩ R. We ...

Constrained skyline queries retrieve all points that optimize some user’s preferences subject to orthogonal range constraints, but at significant computational cost. This paper is the first to propose caching to improve constrained skyline query response time. Because arbitrary range constraints are unlikely to match a cached query exactly, our proposed method identifies and exploits similar ca...

The database skyline query (or non-domination query) has a spatial form: Given set P with n point sites, and S of m locations interest, site p ∈ is if only for each q ∖ { } , there exists at least one location s that closer to than . We reduce the problem determining points finding sites have non-empty cells in an additively weighted Voronoi diagram under convex distance function. weights said ...

Skyline queries return the set of non-dominated tuples, where a tuple is dominated if there exists another with better values on all attributes. In the past few years the problem has been studied extensively, and a great number of external memory algorithms have been proposed. We thoroughly study the most important scan-based methods, which perform a number of passes over the database in order ...

In this paper, we introduce a new interesting path finding problem, which is the Skyline Trips of Multiple POIs Categories (STMPC) query. In particular, given a road network with a set of Points of Interest (POIs) from different categories, a list of items the user is planning to purchase and a pricing function for items at each related POI; find the skyline trips in term of both trip length an...