ACM Home Page
Please provide us with feedback. Feedback
Minimizing the communication cost for continuous skyline maintenance
Full text PdfPdf (513 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Research session 13: skyline query processing table of contents
Pages 495-508  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Zhenjie Zhang  National University of Singapore, Singapore, Singapore
Reynold Cheng  Hong Kong University, Hong Kong, Hong Kong
Dimitris Papadias  Hong Kong University of Science and Technology, Hong Kong, Hong Kong
Anthony K.H. Tung  National University of Singapore, Singapore, Singapore
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 31,   Downloads (12 Months): 141,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559845.1559898
What is a DOI?

ABSTRACT

Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, where a server continuously maintains the skyline of dynamic objects. Our first contribution is a Filter method that avoids transmission of updates from objects that cannot influence the skyline. Specifically, each object is assigned a filter so that it needs to issue an update only if it violates its filter. Filter achieves significant savings over the naive approach of transmitting all updates. Going one step further, we introduce the concept of frequent skyline query over a sliding window(FSQW). The motivation is that snapshot skylines are not very useful in streaming environments because they keep changing over time. Instead, FSQW reports the objects that appear in the skylines of at least θ ⋅ s of the s most recent timestamps (0 < θ ≤ 1). Filter can be easily adapted to FSQW processing, however, with potentially high overhead for large and frequently updated datasets. To further reduce the communication cost, we propose a Sampling method, which returns approximate FSQW results without computing each snapshot skyline. Finally, we integrate Filter and Sampling in a Hybrid approach that combines their individual advantages.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
W.-T. Balke, U. Güntzer, and J. X. Zheng. Efficient distributed skylining for web information systems. In EDBT, pages 256--273, 2004.
 
3
4
5
 
6
 
7
J. Chomicki, P. Godfrey, J. Gryz, and D. Liang. Skyline with presorting. In ICDE, pages 717--719, 2003.
8
 
9
 
10
 
11
12
 
13
14
 
15
 
16
 
17
 
18
 
19
 
20
21
22
 
23
 
24
 
25
 
26
 
27
 
28
S. Wang, B.C. Ooi, A.K.H. Tung, and L. Xu. Efficient skyline query processing on peer-to-peer networks. In ICDE, pages 1126--1135, 2007.
 
29
P. Wu, D. Agrawal, Ö. Egecioglu, and A. E. Abbadi. Deltasky: Optimal maintenance of skyline deletions without exclusive dominance region generation. In ICDE, pages 486--495, 2007.
 
30
P. Wu, C. Zhang, Y. Feng, B.Y. Zhao, D. Agrawal, and A.E. Abbadi. Parallelizing skyline queries for scalable distribution. In EDBT, pages 112--130, 2006.
31
 
32

Collaborative Colleagues:
Zhenjie Zhang: colleagues
Reynold Cheng: colleagues
Dimitris Papadias: colleagues
Anthony K.H. Tung: colleagues