Efficient and Progressive Algorithms for Distributed Skyline Queries over Uncertain Data

• Published in: IEEE transactions on knowledge and data engineering Vol. 24; no. 8; pp. 1448 - 1462
• Main Authors: Ding, Xiaofeng, Jin, Hai
• Format: Journal Article
• Language: English
• Published: IEEE 01.08.2012
• Subjects: Algorithm design and analysis; Bandwidth; distributed database; Distributed databases; Probabilistic logic; Servers; Skyline; uncertain data; Uncertainty
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2011.77

The skyline operator has received considerable attention from the database community, due to its importance in many applications including multicriteria decision making, preference answering, and so forth. In many applications where uncertain data are inherently exist, i.e., data collected from different sources in distributed locations are usually with imprecise measurements, and thus exhibit kind of uncertainty. Taking into account the network delay and economic cost associated with sharing and communicating large amounts of distributed data over an internet, an important problem in this scenario is to retrieve the global skyline tuples from all the distributed local sites with minimum communication cost. Based on the well-known notation of the probabilistic skyline query over centralized uncertain data, in this paper, we propose the notation of distributed skyline queries over uncertain data. Furthermore, two communication- and computation-efficient algorithms are proposed to retrieve the qualified skylines from distributed local sites. Extensive experiments have been conducted to verify the efficiency, the effectiveness and the progressiveness of our algorithms with both the synthetic and real data sets.