iSky: Efficient and Progressive Skyline Computing in a Structured P2P Network

Lijiang Chen, Bin Cui, Hua Lu, Linhao Xu, Quanqing Xu

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Abstract

An interesting problem in peer-based data management is efficient support for skyline queries within a multiattribute space. A skyline query retrieves from a set of multidimensional data points a subset of interesting points, compared to which no other points are better. Skyline queries play an important role in multi-criteria decision making and user preference applications. In this paper, we address the skyline computing problem in a structured P2P network. We exploit the iMinMax(thetas) transformation to map high-dimensional data points to 1-dimensional values. All transformed data points are then distributed on a structured P2P network called BATON, where all peers are virtually organized as a balanced binary search tree. Subsequently, a progressive algorithm is proposed to compute skyline in the distributed P2P network. Further, we propose an adaptive skyline filtering technique to reduce both processing cost and communication cost during distributed skyline computing. Our performance study, with both synthetic and real datasets, shows that the proposed approach can dramatically reduce transferred data volume and gain quick response time
OriginalsprogEngelsk
TitelThe 28th IEEE International Conference on Distributed Computing Systems Beijing, China June 17 - 20, 2008 : Proceedings
Antal sider8
ForlagIEEE Computer Society Press
Publikationsdato2008
Sider160-167
ISBN (Elektronisk)978-0-7695-3172-4, 1063-6927
DOI
StatusUdgivet - 2008
Udgivet eksterntJa
Begivenhed28th International Conference on Distributed Computing Systems - Beijing, Kina
Varighed: 17 jun. 200820 jun. 2008
Konferencens nummer: 28

Konference

Konference28th International Conference on Distributed Computing Systems
Nummer28
Land/OmrådeKina
ByBeijing
Periode17/06/200820/06/2008

Citer dette