This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Flexible and Efficient Resolution of Skyline Query Size Constraints
July 2011 (vol. 23 no. 7)
pp. 991-1005
ASCII Text
x 
 
Hua Lu, Christian S. Jensen, Zhenjie Zhang, "Flexible and Efficient Resolution of Skyline Query Size Constraints," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 7, pp. 991-1005, July, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2010.47,
author = {Hua Lu and Christian S. Jensen and Zhenjie Zhang},
title = {Flexible and Efficient Resolution of Skyline Query Size Constraints},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {23},
number = {7},
issn = {1041-4347},
year = {2011},
pages = {991-1005},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.47},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - Flexible and Efficient Resolution of Skyline Query Size Constraints
IS - 7
SN - 1041-4347
SP991
EP1005
EPD - 991-1005
A1 - Hua Lu,
A1 - Christian S. Jensen,
A1 - Zhenjie Zhang,
PY - 2011
KW - Skyline queries
KW - query processing
KW - database management.
VL - 23
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
Hua Lu, Aalborg University, Aalborg East
Christian S. Jensen, Aarhus University, Aarhus N
Zhenjie Zhang, Advanced Digital Sciences Center, Singapore Pte.
Given a set of multidimensional points, a skyline query returns the interesting points that are not dominated by other points. It has been observed that the actual cardinality (s) of a skyline query result may differ substantially from the desired result cardinality (k), which has prompted studies on how to reduce s for the case where k<s. This paper goes further by addressing the general case where the relationship between k and s is not known beforehand. Due to their complexity, the existing pointwise ranking and set-wide maximization techniques are not well suited for this problem. Moreover, the former often incurs too many ties in its ranking, and the latter is inapplicable for k>s. Based on these observations, the paper proposes a new approach, called skyline ordering, that forms a skyline-based partitioning of a given data set such that an order exists among the partitions. Then, set-wide maximization techniques may be applied within each partition. Efficient algorithms are developed for skyline ordering and for resolving size constraints using the skyline order. The results of extensive experiments show that skyline ordering yields a flexible framework for the efficient and scalable resolution of arbitrary size constraints on skyline queries.

[1] J.L. Bentley, K.L. Clarkson, and D.B. Levine, "Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls," Proc. First Ann. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 179-187, 1990.
[2] I. Bartolini, P. Ciaccia, and M. Patella, "Efficient Sort-Based Skyline Evaluation," ACM Trans. Database Systems, vol. 33, no. 4, pp. 1-49, 2008.
[3] J.L. Bentley, H.T. Kung, M. Schkolnick, and C.D. Thompson, "On the Average Number of Maxima in a Set of Vectors and Applications," J. ACM, vol. 25, no. 4, pp. 536-543, 1978.
[4] H. Blunck and J. Vahrenhold, "In-Place Algorithms for Computing (Layers of) Maxima," Proc. Scandinavian Workshop Algorithm Theory (SWAT), pp. 363-374, 2006.
[5] S. Borzonyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. Int'l Conf. Data Eng. (ICDE), pp. 421-430, 2001.
[6] C.-Y. Chan, H. Jagadish, K.-L. Tan, A.K. Tung, and Z. Zhang, "Finding K-Dominant Skylines in High Dimensional Space," Proc. ACM SIGMOD, pp. 503-514, 2006.
[7] C.-Y. Chan, H. Jagadish, K.-L. Tan, A.K. Tung, and Z. Zhang, "On High Dimensional Skylines," Proc. Int'l Conf. Extending Database Technology (EDBT), pp. 478-495, 2006.
[8] Y.-C. Chang, L. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J.R. Smith, "The Onion Technique: Indexing for Linear Optimization Queries," Proc. ACM SIGMOD, pp. 391-402, 2000.
[9] J. Chomicki, "Preference Formulas in Relational Queries," ACM Trans. Database Systems, vol. 28, no. 4, pp. 427-466, 2003.
[10] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline with Presorting," Proc. Int'l Conf. Data Eng. (ICDE), pp. 717-719, 2003.
[11] B. Cui, H. Lu, Q. Xu, L. Chen, Y. Dai, and Y. Zhou, "Parallel Distributed Processing of Constrained Skyline Queries by Filtering," Proc. Int'l Conf. Data Eng. (ICDE), pp. 546-555, 2008.
[12] P. Godfrey, R. Shipley, and J. Gryz, "Maximal Vector Computation in Large Data Sets," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 229-240, 2005.
[13] G. Hjaltason and H. Samet, "Distance Browsing in Spatial Database," ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[14] Z. Huang, C.S. Jensen, H. Lu, and B.C. Ooi, "Skyline Queries against Mobile Lightweight Devices in MANETs," Proc. Int'l Conf. Data Eng. (ICDE), p. 66, 2006.
[15] W. Jin, M. Ester, and J. Han, "Efficient Processing of Ranked Queries with Sweeping Selection," Proc. European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), pp. 527-535, 2005.
[16] W. Jin, J. Han, and M. Ester, "Mining Thick Skylines over Large Databases," Proc. European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), pp. 255-266, 2004.
[17] V. Koltun and C.H. Papadimitriou, "Approximately Dominating Representatives," Proc. Int'l Conf. Data Theory (ICDT), pp. 204-214, 2005.
[18] D. Kossmann, F. Ramsak, and S. Rost, "Shooting Stars in the Sky: An Online Algorithm for Skyline Queries," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 275-286, 2002.
[19] H.T. Kung, F. Luccio, and F.P. Preparata, "On Finding the Maxima of a Set of Vectors," J. ACM, vol. 22, no. 4, pp. 469-476, 1975.
[20] P. Larson and H.Z. Yang, "Computing Queries from Derived Relations," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 259-269, 1985.
[21] X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang, "Selecting Stars: The k Most Representative Skyline Operator," Proc. Int'l Conf. Data Eng. (ICDE), pp. 86-95, 2007.
[22] D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An Optimal and Progressive Algorithm for Skyline Queries," Proc. SIGMOD, pp. 467-478, 2003.
[23] D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive Skyline Computation in Database Systems," ACM Trans. Database Systems, vol. 30, no. 1, pp. 41-82, 2005.
[24] Y. Tao, L. Ding, X. Lin, and J. Pei, "Distance-Based Representative Skyline," Proc. Int'l Conf. Data Eng. (ICDE), pp. 892-903, 2009.
[25] K.L. Tan, P.K. Eng, and B.C. Ooi, "Efficient Progressive Skyline Computation," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 301-310, 2001.
[26] A. Vlachou, C. Doulkeridis, K. Nørvåg, and M. Vazirgiannis, "Skyline-Based Peer-To-Peer Top-k Query Processing," Proc. Int'l Conf. Data Eng. (ICDE), pp. 1421-1423, 2008.
[27] T. Xia, D. Zhang, and Y. Tao, "On Skylining with Flexible Dominance Relation," Proc. Int'l Conf. Data Eng. (ICDE), pp. 1397-1399, 2008.
[28] M.L. Yiu and N. Mamoulis, "Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data," Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 483-494, 2007.
[29] Z. Zhang, X. Guo, H. Lu, A.K. Tung, and N. Wang, "Discovering Strong Skyline Points in High Dimensional Spaces," Proc. ACM Int'l Conf. Information and Knowledge Management (CIKM), pp. 247-248, 2005.
[30] S. Zhang, N. Mamoulis, and D.W. Cheung, "Scalable Skyline Computation Using Object-Based Space Partitioning," Proc. SIGMOD, pp. 483-494, 2009.

Index Terms:
Skyline queries, query processing, database management.
Citation:
Hua Lu, Christian S. Jensen, Zhenjie Zhang, "Flexible and Efficient Resolution of Skyline Query Size Constraints," IEEE Transactions on Knowledge and Data Engineering, vol. 23, no. 7, pp. 991-1005, July 2011, doi:10.1109/TKDE.2010.47
Usage of this product signifies your acceptance of the Terms of Use.