In this paper, aiming at securing range query, top-k query, and skyline query in tiered sensor networks, we propose the Secure Range Query (SRQ), Secure Top-k Query (STQ), and Secure Skyline Query (SSQ) schemes, respectively. In particular, SRQ, by using our proposed prime aggregation technique, has the lowest communication overhead among prior works, while STQ and SSQ, to our knowledge, are th...

Skyline queries are well known for their intuitive query formalization and easy to understand semantics when selecting the most interesting database objects in a personalized fashion. They naturally fill the gap between set-based SQL queries and rank-aware database retrieval and thus have emerged in the last few years as a popular tool for personalized retrieval in the database research communi...

The last years there is an increasing interest for query processing techniques that take into consideration the dominance relationship between objects 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 objects that are not dominated, whereas a top-k dominating query returns the k object...

We study the problem of k-dominance in a set of d-dimensional vectors, prove bounds on the number of maxima (skyline vectors), under both worst-case and average-case models, perform experimental evaluation using synthetic and real-world data, and explore an application of kdominant skyline for extracting a small set of top-ranked vectors in high dimensions where the full skylines can be unmanag...

We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The insertion procedure involved in the proof leads to an analogue of the Robinson-SchenstedKnuth Algorithm for semi-skyline augmented fillings. This procedure co...

This paper presents FlexlQ, a framework for feedback based query refinement. In FlexiQ, feedback is used to discover the query intent of the user and skyline operator is used to confine the search space of the proposed query refinement algorithms. The feedback consists of both unexpected information currently present in the query output and expected information that is missing from the query ou...

In this paper, we focus on the retrieval of a set of interesting answers called the skyline from a database. Given a set of points, the skyline comprises the points that are not dominated by other points. A point dominates another point if it is as good or better in all dimensions and better in at least one dimension. We present two novel algorithms, Bitmap and Index, to compute the skyline of ...

We propose a novel approach to computing the skyline set of a relational table R, with respect to preferences expressed over one or more numerical attributes. Our approach is based on what we call the query lattice of R, and our basic algorithm constructs the skyline set as the union of the answers to a subset of queries from that lattice hence without directly accessing the table R. Therefore,...

In this paper, we introduce a new approach to finish reverse k-skyband (RkSB) query which returns all the points in given dataset P whose dynamic k-skyband contains specific query object q. The main ideas include reuse technology and early stopping. The former save the information of node accesses during R-tree search into an auxiliary heap so that dramatically decreases the I/O cost and improv...

Motivation As an example, consider the following situation where an online customer is looking for laptops in a website. He will have several preferences in his mind about the various features his laptop should support like the price of the laptop, the battery life, weight of the laptop, processor speed, memory etc. It would be really cumbersome for that person to look at all laptops in the web...