Continuous Skyline Monitoring over Distributed Data Streams

Lu, Hua; Zhou, Yongluan; Haustad, Jonas

doi:10.1007/978-3-642-13818-8_39

Cited by 15 publications

(8 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Continuous Queries. Continuous skyline queries have been studied under various settings, e.g., updating skyline in data streams [16,17], skyline maintenance due to deletions [25] and skyline monitoring for dynamically changing points [12,15,11]. Below, we describe the most closely related work and discuss why these techniques are not suitable to solve the problem studied in this paper.…”

Section: Skyline Queriesmentioning

confidence: 96%

A safe zone based approach for monitoring moving skyline queries

Cheema

Lin

Zhang

et al. 2013

Proceedings of the 16th International Conference on Extending Database Technology

View full text Add to dashboard Cite

Given a set of criterions, an object o dominates another object o ′ if o is more preferable than o ′ according to every criterion. A skyline query returns every object that is not dominated by any other object. In this paper, we study the problem of continuously monitoring a moving skyline query where one of the criterions is the distance between the objects and the moving query. We propose a safe zone based approach to address the challenge of efficiently updating the results as the query moves. A safe zone is the area such that the results of a query remain unchanged as long as the query lies inside this area. Hence, the results are required to be updated only when the query leaves its safe zone. Although the main focus of this paper is to present the techniques for Euclidean distance metric, the proposed techniques are applicable to any metric distance (e.g., Manhattan distance, road network distance). We present several non-trivial optimizations and propose an efficient algorithm for safe zone construction. Our experiments demonstrate that the cost of our safe zone based approach is reasonably close to a lower bound cost and is three orders of magnitude lower than the cost of a naïve algorithm.

show abstract

Section: Skyline Queriesmentioning

confidence: 96%

A safe zone based approach for monitoring moving skyline queries

Cheema

Lin

Zhang

et al. 2013

Proceedings of the 16th International Conference on Extending Database Technology

View full text Add to dashboard Cite

show abstract

“…Subsequently, Question 1 is checked by comparing the updating tuple with the current global skyline points not coming from the updating site (lines [12][13][14][15][16][17][18][19][20][21][22][23][24]. If the updating tuple is dominated, the process will stop immediately (lines [15][16][17][18][19][20].…”

Section: Update Processing On the Servermentioning

confidence: 99%

“…This work extends our preliminary research [14]. First, the query initialization phase is presented in an in-depth manner with more technical details (Section 4).…”

Section: Introductionmentioning

confidence: 97%

Efficient and scalable continuous skyline monitoring in two-tier streaming settings

Zhou

Haustad

2013

Information Systems

Self Cite

View full text Add to dashboard Cite

“…Specifically, no solutions have been proposed so far for skyline-based relaxation over data streams (while proposals for skyline query processing do exist -see, e.g., [83,113,115]). Even if such solutions were available, skyline-based computation is blocking and therefore a window-based computation would be required in order to restrict the set of items upon which dominance has to be checked.…”

Section: Adaptive Processing Of Skyline-based Queries Over Data Streamsmentioning

confidence: 99%

“…In order to address this problem, a common approach is to integrate both top-k and skyline advantages in a single technique. We refer the reader to Chapter 2 for further information about this topic.Solutions for continuous skyline query processing have also been provided, both in centralized [115] and distributed [83,113] architectures. Similarly to stored data, these approaches deal with totally ordered numerical domains.…”

mentioning

confidence: 99%