Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2010.17D.1.017

An Efficient Processing Method of Top-k(g) Skyline Group Queries for Incomplete Data  

Park, Mi-Ra (한국기술교육대학교 정보미디어공학과)
Min, Jun-Ki (한국기술교육대학교 인터넷미디어공학부)
Publication Information
The KIPS Transactions:PartD / v.17D, no.1, 2010 , pp. 17-24 More about this Journal
Abstract
Recently, there has been growing interest in skyline queries. Most of works for skyline queries assume that the data do not have null value. However, when we input data through the Web or with other different tools, there exist incomplete data with null values. As a result, several skyline processing techniques for incomplete data have been proposed. However, available skyline query techniques for incomplete data do not consider the environments that coexist complete data and incomplete data since these techniques deal with the incomplete data only. In this paper, we propose a novel skyline group processing technique which evaluates skyline queries for the environments that coexist complete data and incomplete data. To do this, we introduce the top-k(g) skyline group query which searches g skyline groups with respect to the user's dimensional preference. In our experimental study, we show efficiency of our proposed technique.
Keywords
Skyline; Incomplete Data; Skyline Group Queries; Top-k(g);
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. E. Khalefa, M. F. Mokbel, and J. J. Levandoski, “Skyline Query Processing for incomplete Data,” ICDE, 2008.
2 J. Pei, W. Jin, M. Ester, and Y. Tao, “Catching the best views of skyline: A semantic approach based on decisive subspaces,” VLDB, 2005.
3 C. Y. Chan, H. V. Jagadish, K. L. Tan, A. K. H. Tung, and Z. Zhang, “Finding k-Dominant Skylines in High Dimensional Space,” SIGMOD, 2006.
4 S. Borzsonyi, D. Kossmann, and K. Stocker, “The Skyline Operator,” ICDE, pp.421-430, 2001.
5 J. W. Lee, G. W. You, and S. W. Hwang, “Telescope: Zooming to Interesting Skylines,” DASFAA, 2007.
6 T. Xia, and D. Zhang, “Refreshing the Sky: The Compressed Skycube with Efficient Support for Frequent Updates,” ACM SIGMOD, 2006.
7 W. Jin, J. Han, and M. Ester, “Mining thick skylines over large databases,” PKDD, 2004.
8 V. Hristidis, N. Koudas, and Y. Papakonstantinou, “PREFER: A system for the efficient execution of multi-parametric ranked queries,” SIGMOD, 2001.
9 Y. Yuan, X. Lin, Q. Liu, W. Wang, J. X. Yu, and Q. Zhang, 2005“Efficient computation of the skyline cube,” VLDB, 2005.
10 Y. Tao, and D. Papadias, “Maintaining Sliding Window Skyline on Data Streams,” TKDE, 2006.
11 X. Lin, Y. Yuan, and W. Wang, “Stabbing the Sky: Efficient Skyline Computation over Sliding Windows,” ICDE, 2005.
12 C. Y. Chan, H. V. Jagadish, A. K. H. Tung, and Z. Zhang, “On high dimensional skylines,” EDBT, 2006.
13 N. Bruno, L. Gravano, and A. Marian, “Evaluating Top-k Queries over Web-accessible Databases,” ICDE, 2002.