Threshold-based probabilistic top-k dominating queries
暂无分享,去创建一个
Jian Pei | Xuemin Lin | Wenjie Zhang | Wei Wang | Ying Zhang | Wei Wang | J. Pei | Xuemin Lin | Ying Zhang | W. Zhang
[1] Sunil Prabhakar,et al. Evaluating probabilistic queries over imprecise data , 2003, SIGMOD '03.
[2] Dan Suciu,et al. Management of probabilistic data: foundations and challenges , 2007, PODS '07.
[3] Jennifer Widom,et al. Working Models for Uncertain Data , 2006, 22nd International Conference on Data Engineering (ICDE'06).
[4] Mohamed A. Soliman,et al. Top-k Query Processing in Uncertain Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[5] Oded Goldreich. Randomized Methods in Computation-Lecture Notes , 2001 .
[6] Man Lung Yiu,et al. Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data , 2007, VLDB.
[7] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .
[8] Prithviraj Sen,et al. Representing and Querying Correlated Tuples in Probabilistic Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[9] Dimitris Papadias,et al. Processing and optimization of multiway spatial joins using R-trees , 1999, PODS '99.
[10] Donald Kossmann,et al. The Skyline operator , 2001, Proceedings 17th International Conference on Data Engineering.
[11] Laks V. S. Lakshmanan,et al. ProbView: a flexible probabilistic database system , 1997, TODS.
[12] Tomasz Imielinski,et al. Incomplete Information in Relational Databases , 1984, JACM.
[13] Bin Jiang,et al. Probabilistic Skylines on Uncertain Data , 2007, VLDB.
[14] Hector Garcia-Molina,et al. The Management of Probabilistic Data , 1992, IEEE Trans. Knowl. Data Eng..
[15] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[16] Anthony K. H. Tung,et al. Finding k-dominant skylines in high dimensional space , 2006, SIGMOD Conference.
[17] Chi-Yin Chow,et al. Probabilistic Verifiers: Evaluating Constrained Nearest-Neighbor Queries over Uncertain Data , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[18] Panos Kalnis,et al. Efficient OLAP Operations in Spatial Data Warehouses , 2001, SSTD.
[19] M. Kalos,et al. Monte Carlo methods , 1986 .
[20] Thomas H. Cormen,et al. Introduction to algorithms [2nd ed.] , 2001 .
[21] Serge Abiteboul,et al. On the representation and querying of sets of possible worlds , 1987, SIGMOD '87.
[22] Hans-Peter Kriegel,et al. Density-based clustering of uncertain data , 2005, KDD '05.
[23] Beng Chin Ooi,et al. Efficient Progressive Skyline Computation , 2001, VLDB.
[24] Feifei Li,et al. Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations , 2008, IEEE Trans. Knowl. Data Eng..
[25] Dan Olteanu,et al. 10106 Worlds and Beyond: Efficient Representation and Processing of Incomplete Information , 2007, ICDE.
[26] Feifei Li,et al. Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations , 2008, IEEE Transactions on Knowledge and Data Engineering.
[27] Jeffrey Scott Vitter,et al. Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data , 2004, VLDB.
[28] Reynold Cheng,et al. Efficient Clustering of Uncertain Data , 2006, Sixth International Conference on Data Mining (ICDM'06).
[29] Ihab F. Ilyas,et al. Efficient search for the top-k probable nearest neighbors in uncertain databases , 2008, Proc. VLDB Endow..
[30] Parag Agrawal,et al. Trio: a system for data, uncertainty, and lineage , 2006, VLDB.
[31] Hans-Peter Kriegel,et al. Probabilistic Similarity Join on Uncertain Data , 2006, DASFAA.
[32] Hans-Peter Kriegel,et al. Probabilistic Nearest-Neighbor Query on Uncertain Objects , 2007, DASFAA.
[33] Peter Green,et al. Markov chain Monte Carlo in Practice , 1996 .
[34] Moni Naor,et al. Optimal aggregation algorithms for middleware , 2001, PODS.
[35] Hans-Peter Kriegel,et al. Efficient processing of spatial joins using R-trees , 1993, SIGMOD Conference.
[36] Man Lung Yiu,et al. Multi-dimensional top-k dominating queries , 2009, The VLDB Journal.
[37] A. Guttmma,et al. R-trees: a dynamic index structure for spatial searching , 1984 .
[38] Christopher Ré,et al. Efficient Top-k Query Evaluation on Probabilistic Data , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[39] Jian Pei,et al. Ranking queries on uncertain data: a probabilistic threshold approach , 2008, SIGMOD Conference.
[40] Alessandro Panconesi,et al. Concentration of Measure for the Analysis of Randomized Algorithms: Preface , 2009 .
[41] Yufei Tao,et al. Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions , 2005, VLDB.
[42] Bernhard Seeger,et al. Progressive skyline computation in database systems , 2005, TODS.
[43] Dan Suciu,et al. Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.
[44] Hans-Peter Kriegel,et al. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.