TY - GEN
T1 - On efficient k-Skyband query processing over incomplete data
AU - Miao, Xiaoye
AU - Gao, Yunjun
AU - Chen, Lu
AU - Chen, Gang
AU - Li, Qing
AU - Jiang, Tao
PY - 2013
Y1 - 2013
N2 - The Skyline query and its variants have been extensively explored in the literature. Existing approaches, except one, assume that all dimensions are available for all data items. However, many practical applications such as sensor networks, decision making, and location-based services, may involve incomplete data items, i.e., some dimensional values are missing , due to the device failure or the privacy preservation. In this paper, for the first time, we study the problem of efficient k-Skyband (kSB) query processing on incomplete data, where multi-dimensional data items are missing some values of their dimensions. We formalize the problem, and then present several efficient algorithms for tackling it. Our methods employ some novel concepts/structures (e.g., expired skyline, shadow skyline, thickness warehouse, etc.) to improve the search performance. Extensive experiments with both real and synthetic data sets demonstrate the effectiveness and efficiency of our proposed algorithms. © Springer-Verlag 2013.
AB - The Skyline query and its variants have been extensively explored in the literature. Existing approaches, except one, assume that all dimensions are available for all data items. However, many practical applications such as sensor networks, decision making, and location-based services, may involve incomplete data items, i.e., some dimensional values are missing , due to the device failure or the privacy preservation. In this paper, for the first time, we study the problem of efficient k-Skyband (kSB) query processing on incomplete data, where multi-dimensional data items are missing some values of their dimensions. We formalize the problem, and then present several efficient algorithms for tackling it. Our methods employ some novel concepts/structures (e.g., expired skyline, shadow skyline, thickness warehouse, etc.) to improve the search performance. Extensive experiments with both real and synthetic data sets demonstrate the effectiveness and efficiency of our proposed algorithms. © Springer-Verlag 2013.
UR - https://www.scopus.com/pages/publications/84892857017
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84892857017&origin=recordpage
U2 - 10.1007/978-3-642-37487-6_32
DO - 10.1007/978-3-642-37487-6_32
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9783642374869
VL - 7825 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 424
EP - 439
BT - Database Systems for Advanced Applications
PB - Springer Verlag
T2 - 18th International Conference on Database Systems for Advanced Applications, DASFAA 2013
Y2 - 22 April 2013 through 25 April 2013
ER -