Semantics and evaluation of top-k queries in probabilistic databases
暂无分享,去创建一个
[1] Christoph Koch,et al. World-set decompositions: Expressiveness and efficient algorithms , 2007, Theor. Comput. Sci..
[2] Serge Abiteboul,et al. Foundations of Databases: The Logical Level , 1995 .
[3] Wendy Hui Wang,et al. The Threshold Algorithm: From Middleware Systems to the Relational Engine , 2007, IEEE Transactions on Knowledge and Data Engineering.
[4] Luis Gravano,et al. Evaluating top-k queries over Web-accessible databases , 2002, Proceedings 18th International Conference on Data Engineering.
[5] Joseph Y. Halpern. An Analysis of First-Order Logics of Probability , 1989, IJCAI.
[6] T. S. Jayram,et al. OLAP over uncertain and imprecise data , 2007, The VLDB Journal.
[7] Mohamed A. Soliman,et al. Top-k Query Processing in Uncertain Databases , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[8] FuhrNorbert,et al. A probabilistic relational algebra for the integration of information retrieval and database systems , 1997 .
[9] Norbert Fuhr,et al. A probabilistic relational algebra for the integration of information retrieval and database systems , 1997, TOIS.
[10] Walid G. Aref,et al. Supporting top-kjoin queries in relational databases , 2004, The VLDB Journal.
[11] Venu Govindaraju,et al. Biometrics Driven Smart Environments: Abstract Framework and Evaluation , 2008, UIC.
[12] Esteban Zimányi,et al. Query Evaluation in Probabilistic Relational Databases , 1997, Theor. Comput. Sci..
[13] Kevin Chen-Chuan Chang,et al. Probabilistic top-k and ranking-aggregate queries , 2008, TODS.
[14] Jennifer Widom,et al. Trio: A System for Integrated Management of Data, Accuracy, and Lineage , 2004, CIDR.
[15] Jian Pei,et al. Ranking queries on uncertain data: a probabilistic threshold approach , 2008, SIGMOD Conference.
[16] Ronald Fagin,et al. Combining Fuzzy Information from Multiple Systems , 1999, J. Comput. Syst. Sci..
[17] Dan Suciu,et al. Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.
[18] Dan Olteanu,et al. World-Set Decompositions: Expressiveness and Efficient Algorithms , 2007, ICDT.
[19] Feifei Li,et al. Efficient Processing of Top-k Queries in Uncertain Databases with x-Relations , 2008, IEEE Transactions on Knowledge and Data Engineering.
[20] Sudipto Guha,et al. Merging the Results of Approximate Match Operations , 2004, VLDB.
[21] Moni Naor,et al. Optimal aggregation algorithms for middleware , 2001, PODS '01.
[22] Jennifer Widom,et al. ULDBs: databases with uncertainty and lineage , 2006, VLDB.
[23] Michael Pittarelli,et al. The Theory of Probabilistic Databases , 1987, VLDB.
[24] Christopher Ré,et al. Efficient Top-k Query Evaluation on Probabilistic Data , 2007, 2007 IEEE 23rd International Conference on Data Engineering.
[25] John R. Smith,et al. Supporting Incremental Join Queries on Ranked Inputs , 2001, VLDB.
[26] Laks V. S. Lakshmanan,et al. ProbView: a flexible probabilistic database system , 1997, TODS.
[27] Xi Zhang,et al. Semantics and evaluation of top-k queries in probabilistic databases , 2008, 2008 IEEE 24th International Conference on Data Engineering Workshop.
[28] Walid G. Aref,et al. Joining Ranked Inputs in Practice , 2002, VLDB.
[29] Feifei Li,et al. Semantics of Ranking Queries for Probabilistic Data and Expected Ranks , 2009, 2009 IEEE 25th International Conference on Data Engineering.
[30] Tomasz Imielinski,et al. Incomplete Information in Relational Databases , 1984, JACM.