Flexible and efficient resolution of skyline query size constraints

IEEE Transactions on Knowledge and Data Engineering

Volumn 23, Issue 7, 2011, Pages 991-1005

  Lu, Hua ^a   Jensen, Christian S ^b   Zhang, Zhenjie ^c  

^a AALBORG UNIVERSITY   (Denmark)

^b AARHUS UNIVERSITY   (Denmark)

^c Illinois at Singapore Pte   (Singapore)

Author keywords

database management; query processing; Skyline queries

Indexed keywords

CARDINALITIES; DATA SETS; DATABASE MANAGEMENT; EFFICIENT ALGORITHM; FLEXIBLE FRAMEWORK; SIZE CONSTRAINT; SKYLINE QUERY;

ALGORITHMS; INDEXING (OF INFORMATION);

QUERY PROCESSING;

EID: 80054892808     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2010.47     Document Type: Article

References (30)

1. J.L. Bentley, K.L. Clarkson, and D.B. Levine, "Fast LinearExpected-Time Algorithms for Computing Maxima and ConvexHulls" Proc. First Ann. ACM-SIAM Symp. Discrete Algorithms(SODA), pp. 179-187, 1990.
2. I. Bartolini, P. Ciaccia, and M. Patella, "Efficient Sort-BasedSkyline 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, "Onthe Average Number of Maxima in a Set of Vectors andApplications" J. ACM, vol. 25, no. 4, pp. 536-543, 1978. (Pubitemid 9399481)
4. H. Blunck and J. Vahrenhold, "In-Place Algorithms for Computing(Layers of) Maxima" Proc. Scandinavian Workshop AlgorithmTheory (SWAT), pp. 363-374, 2006.
5. S. Borzonyi, D. Kossmann, and K. Stocker, "The SkylineOperator" Proc. Int'l Conf. Data Eng. (ICDE), pp. 421-430, 2001. (Pubitemid 32457144)
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. (Pubitemid 46946535)
7. C.-Y. Chan, H. Jagadish, K.-L. Tan, A.K. Tung, and Z. Zhang, "OnHigh Dimensional Skylines" Proc. Int'l Conf. Extending DatabaseTechnology (EDBT), pp. 478-495, 2006. (Pubitemid 43986837)
8. Y.-C. Chang, L. Bergman, V. Castelli, C.-S. Li, M.-L. Lo, and J.R.Smith, "The Onion Technique: Indexing for Linear OptimizationQueries" Proc. ACM SIGMOD, pp. 391-402, 2000.
9. J. Chomicki, "Preference Formulas in Relational Queries" ACMTrans. Database Systems, vol. 28, no. 4, pp. 427-466, 2003.
10. J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, "Skyline withPresorting" 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, " ParallelDistributed 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 Computationin Large Data Sets" Proc. Int'l Conf. Very Large Data Bases(VLDB), pp. 229-240, 2005. (Pubitemid 43991007)
13. G. Hjaltason and H. Samet, "Distance Browsing in SpatialDatabase" 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 Queriesagainst Mobile Lightweight Devices in MANETs" Proc. Int'l Conf.Data Eng. (ICDE), p. 66, 2006. (Pubitemid 44539858)
15. W. Jin, M. Ester, and J. Han, "Efficient Processing of RankedQueries with Sweeping Selection" Proc. European Conf. Principlesand Practice of Knowledge Discovery in Databases (PKDD), pp. 527-535, 2005.
16. W. Jin, J. Han, and M. Ester, "Mining Thick Skylines over LargeDatabases" Proc. European Conf. Principles and Practice of KnowledgeDiscovery in Databases (PKDD), pp. 255-266, 2004. (Pubitemid 39740408)
17. V. Koltun and C.H. Papadimitriou, "Approximately DominatingRepresentatives" 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. VeryLarge Data Bases (VLDB), pp. 275-286, 2002.
19. H.T. Kung, F. Luccio, and F.P. Preparata, "On Finding the Maximaof a Set of Vectors" J. ACM, vol. 22, no. 4, pp. 469-476, 1975.
20. P. Larson and H.Z. Yang, "Computing Queries from DerivedRelations" 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 kMost Representative Skyline Operator" Proc. Int'l Conf. Data Eng.(ICDE), pp. 86-95, 2007. (Pubitemid 47422012)
22. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An Optimal andProgressive Algorithm for Skyline Queries" Proc. SIGMOD,pp. 467-478, 2003.
23. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive SkylineComputation in Database Systems" ACM Trans. Database Systems,vol. 30, no. 1, pp. 41-82, 2005. (Pubitemid 41201811)
24. Y. Tao, L. Ding, X. Lin, and J. Pei, "Distance-Based RepresentativeSkyline" Proc. Int'l Conf. Data Eng. (ICDE), pp. 892-903, 2009.
25. K.L. Tan, P.K. Eng, and B.C. Ooi, "Efficient Progressive SkylineComputation" 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'lConf. Data Eng. (ICDE), pp. 1421-1423, 2008.
27. T. Xia, D. Zhang, and Y. Tao, "On Skylining with FlexibleDominance Relation" Proc. Int'l Conf. Data Eng. (ICDE), pp. 1397-1399, 2008.
28. M.L. Yiu and N. Mamoulis, "Efficient Processing of Top-kDominating 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, "DiscoveringStrong Skyline Points in High Dimensional Spaces" Proc. ACMInt'l Conf. Information and Knowledge Management (CIKM), pp. 247-248, 2005. (Pubitemid 44022147)
30. S. Zhang, N. Mamoulis, and D.W. Cheung, "Scalable SkylineComputation Using Object-Based Space Partitioning" Proc.SIGMOD, pp. 483-494, 2009.