
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Raymond ChiWing Wong, Jian Pei, Ada WaiChee Fu, Ke Wang, "Online Skyline Analysis with Dynamic Preferences on Nominal Attributes," IEEE Transactions on Knowledge and Data Engineering, vol. 21, no. 1, pp. 3549, January, 2009.  
BibTex  x  
@article{ 10.1109/TKDE.2008.115, author = {Raymond ChiWing Wong and Jian Pei and Ada WaiChee Fu and Ke Wang}, title = {Online Skyline Analysis with Dynamic Preferences on Nominal Attributes}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {21}, number = {1}, issn = {10414347}, year = {2009}, pages = {3549}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2008.115}, 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  Online Skyline Analysis with Dynamic Preferences on Nominal Attributes IS  1 SN  10414347 SP35 EP49 EPD  3549 A1  Raymond ChiWing Wong, A1  Jian Pei, A1  Ada WaiChee Fu, A1  Ke Wang, PY  2009 KW  Data mining KW  Database Applications KW  Database Management KW  Information Technology and Systems KW  Skyline KW  materialization KW  data warehouses KW  preferences VL  21 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] W.T. Balke, U. Güntzer, and C. Lofi, “Eliciting Matters—Controlling Skyline Sizes by Incremental Integration of User Preferences,” Proc. 12th Intl Conf. Database Systems for Advanced Applications (DASFAA '07), pp. 551562, 2007.
[2] W.T. Balke, U. Güntzer, and W. Siberski, “Exploiting Indifference for Customization of Partial Order Skylines,” Proc. 10th Int'l Database Eng. and Applications Symp. (IDEAS '06), pp. 8088, 2006.
[3] J.L. Bentley, K.L. Clarkson, and D.B. Levine, “Fast Linear ExpectedTime Algorithms for Computing Maxima and Convex Hulls,” Proc. First Ann. ACMSIAM Symp. Discrete Algorithms (SODA '90), pp. 179187, 1990.
[4] 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. 536543, 1978.
[5] S. Börzsönyi, D. Kossmann, and K. Stocker, “The Skyline Operator,” Proc. 17th Int'l Conf. Data Eng. (ICDE '01), pp. 421430, 2001.
[6] C.Y. Chan, P.K. Eng, and K.L. Tan, “Efficient Processing of Skyline Queries with PartiallyOrdered Domains,” Proc. 21st Int'l Conf. Data Eng. (ICDE '05), pp. 190191, 2005.
[7] C.Y. Chan, P.K. Eng, and K.L. Tan, “Stratified Computation of Skylines with PartiallyOrdered Domains,” Proc. ACM SIGMOD'05, pp. 203214, 2005.
[8] S. Chaudhuri, N.N. Dalvi, and R. Kaushik, “Robust Cardinality and Cost Estimation for Skyline Operator,” Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), p. 64, 2006.
[9] J. Chomicki, “Iterative Modification and Incremental Evaluation of Preference Queries,” Proc. Int'l Symp. Foundations of Information and Knowledge Systems (FoIKS '06), pp. 6382, 2006.
[10] J. Chomicki, “Database Querying under Changing Preferences,” Annals of Math. and Artificial Intelligence, vol. 50, nos. 12, pp. 79109, 2007.
[11] J. Chomicki, P. Godfrey, J. Gryz, and D. Liang, “Skyline with Presorting,” Proc. 19th Int'l Conf. Data Eng. (ICDE '03), pp. 717816, 2003.
[12] O. BarndorffNielsen et al., “On the Distribution of the Number of Admissable Points in a Vector Random Sample,” Theory of Probability and Its Application, vol. 11, no. 2, 1966.
[13] Z. Huang, H. Lu, B.C. Ooi, and A.K.H. Tung, “Continuous Skyline Queries for Moving Objects,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 12, pp. 16451658, Dec. 2006.
[14] B. Jiang, J. Pei, X. Lin, D.W.L. Cheung, and J. Han, “Mining Preferences from Superior and Inferior Examples,” Proc. ACM SIGKDD, 2008.
[15] N.L. Johnson, S. Kotz, and A.W. Kem, Univariate Discrete Distributions. WileyInterscience, 1992.
[16] D. Kossmann, F. Ramsak, and S. Rost, “Shooting Stars in the Sky: An Online Algorithm for Skyline Queries,” Proc. 28th Int'l Conf. Very Large Data Bases (VLDB '02), pp. 275286, 2002.
[17] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “An Optimal and Progressive Algorithm for Skyline Queries,” Proc. ACM SIGMOD '03, pp. 467478, 2003.
[18] D. Papadias, Y. Tao, G. Fu, and B. Seeger, “Progressive Skyline Computation in Database Systems,” ACM Trans. Database Systems, vol. 30, no. 1, pp. 4182, 2005.
[19] J. Pei, A.W.C. Fu, X. Lin, and H. Wang, “Computing Compressed Multidimensional Skyline Cubes Efficiently,” Proc. 23rd Int'l Conf. Data Eng. (ICDE '07), pp. 96105, 2007.
[20] J. Pei, W. Jin, M. Ester, and Y. Tao, “Catching the Best Views of Skyline: A Semantic Approach Based on Decisive Subspaces,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 253264, 2005.
[21] J. Pei, Y. Yuan, X. Lin, W. Jin, M. Ester, Q. Liu, W. Wang, Y. Tao, J.X. Yu, and Q. Zhang, “Towards Multidimensional Subspace Skyline Analysis,” ACM Trans. Database Systems, vol. 31, no. 4, pp.13351381, 2006.
[22] K.L. Tan, P.K. Eng, and B.C. Ooi, “Efficient Progressive Skyline Computation,” Proc. 27th Int'l Conf. Very Large Data Bases (VLDB '01), pp. 301310, 2001.
[23] R.C.W. Wong, A.W.C. Fu, J. Pei, Y.S. Ho, T. Wong, and Y. Liu, “Efficient Skyline Querying with Variable User Preferences on Nominal Attributes,” Proc. 34th Int'l Conf. Very Large Data Bases (VLDB), 2008.
[24] R.C.W. Wong, J. Pei, A.W.C. Fu, and K. Wang, “Mining Favorable Facets,” Proc. ACM SIGKDD '07, pp. 804813, 2007.
[25] T. Xia and D. Zhang, “Refreshing the Sky: The Compressed Skycube with Efficient Support for Frequent Updates,” Proc. ACM SIGMOD '06, pp. 491502, 2006.
[26] Y. Yuan, X. Lin, Q. Liu, W. Wang, J.X. Yu, and Q. Zhang, “Efficient Computation of the Skyline Cube,” Proc. 31st Int'l Conf. Very Large Data Bases (VLDB '05), pp. 241252, 2005.