S. Abiteboul, T. Chan, E. Kharlamov, W. Nutt, and P. Senellart, Capturing continuous data and answering aggregate queries in probabilistic XML, ACM Transactions on Database Systems, vol.36, issue.4, 2011.
DOI : 10.1145/2043652.2043658
URL : https://hal.archives-ouvertes.fr/hal-00677722

A. Amarilli, Y. Amsterdamer, and T. Milo, On the complexity of mining itemsets from the crowd using taxonomies, ICDT, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00986184

A. Amarilli, Y. Amsterdamer, and T. Milo, Uncertainty in Crowd Data Sourcing Under Structural Constraints
DOI : 10.1007/978-3-662-43984-5_27
URL : https://hal.archives-ouvertes.fr/hal-01190716

A. Amarilli, Y. Amsterdamer, T. Milo, and P. Senellart, Top-k querying of unknown values under order constraints (extended version). CoRR, abs, 1701.
URL : https://hal.archives-ouvertes.fr/hal-01439310

A. Amarilli, P. Bourhis, and P. Senellart, Provenance Circuits for Trees and Treelike Instances, ICALP, 2015.
DOI : 10.1007/978-3-662-47666-6_5
URL : https://hal.archives-ouvertes.fr/hal-01178399

D. Bertsimas and S. Vempala, Solving convex programs by random walks, JACM, vol.51, issue.4, 2004.
DOI : 10.1145/509907.509926
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.5210

C. M. Bishop, Graphical models, Pattern Recognition and Machine Learning, 2006.

J. Bragg, D. S. Mausam, and . Weld, Crowdsourcing multi-label classification for taxonomy creation, HCOMP, 2013.

G. Brightwell and P. Winkler, Counting linear extensions, Order, vol.39, issue.2, 1991.
DOI : 10.1007/BF00383444

B. Büeler, A. Enge, and K. Fukuda, Exact Volume Computation for Polytopes: A Practical Study, Polytopes ? combinatorics and Computation, 2000.
DOI : 10.1007/978-3-0348-8438-9_6

R. Cheng, V. Dmitri, S. Kalashnikov, and . Prabhakar, Evaluating probabilistic queries over imprecise data, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, 2003.
DOI : 10.1145/872757.872823
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.6943

E. Ciceri, P. Fraternali, D. Martinenghi, and M. Tagliasacchi, Crowdsourcing for top-k query processing over uncertain data, IEEE TKDE, vol.28, issue.1, p.2016

B. Cohen, Y. Kimelfeld, and . Sagiv, Running tree automata on probabilistic XML, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, 2009.
DOI : 10.1145/1559795.1559831

G. Cormode, F. Li, and K. Yi, Semantics of Ranking Queries for Probabilistic Data and Expected Ranks, 2009 IEEE 25th International Conference on Data Engineering, 2009.
DOI : 10.1109/ICDE.2009.75

S. Cousins and . Vempala, A practical volume algorithm, Mathematical Programming Computation, vol.27, issue.2, p.2016
DOI : 10.1007/s12532-015-0097-z

S. B. Davidson, S. Khanna, T. Milo, and S. Roy, Using the crowd for top-k and group-by queries, Proceedings of the 16th International Conference on Database Theory, ICDT '13, 2013.
DOI : 10.1145/2448496.2448524
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.294.9342

A. De-loera, M. Dutra, . Köppe, . Moreinis, J. Pinto et al., Software for exact integration of polynomials over polyhedra, Computational Geometry, vol.46, issue.3, p.2013

L. Detwiler, W. Gatterbauer, B. Louie, D. Suciu, and P. Tarczy-hornoch, Integrating and Ranking Uncertain Scientific Data, 2009 IEEE 25th International Conference on Data Engineering, 2009.
DOI : 10.1109/ICDE.2009.209
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.1395

U. Faigle, L. Lovasz, R. Schrader, and G. Turán, Searching in trees, seriesparallel and interval orders, SIAM J. Comput, vol.15, issue.4, 1986.

C. Ge and F. Ma, A Fast and Practical Method to Estimate Volumes of Convex Polytopes, FAW, 2015.
DOI : 10.1007/978-3-319-19647-3_6

D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen et al., Discovering all most specific sentences, ACM Transactions on Database Systems, vol.28, issue.2, 2003.
DOI : 10.1145/777943.777945
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1494

P. Haghani, S. Michel, and K. Aberer, Evaluating top-k queries over incomplete data streams, Proceeding of the 18th ACM conference on Information and knowledge management, CIKM '09, 2009.
DOI : 10.1145/1645953.1646064

M. Hua, J. Pei, and X. Lin, Ranking queries on uncertain data, VLDB J, vol.20, issue.1, 2011.
DOI : 10.1007/978-1-4419-9380-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.1066

E. Yannis, R. Ioannidis, and . Ramakrishnan, Efficient transitive closure algorithms, VLDB, 1988.

J. Jestes, G. Cormode, F. Li, and K. Yi, Semantics of ranking queries for probabilistic data, IEEE TKDE, vol.23, issue.12, 2011.
DOI : 10.1109/tkde.2010.192
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.2602

. Jones, Lebesgue Integration on Euclidean Space Counting linear extensions of sparse posets, IJCAI, 2001.

R. Kannan, L. Lovász, and M. Simonovits, Random walks and an O * (n 5 ) volume algorithm for convex bodies, Random Struct. Algorithms, vol.11, issue.1, 1997.
DOI : 10.1002/(sici)1098-2418(199708)11:1<1::aid-rsa1>3.0.co;2-x

J. Lawrence, Polytope volume computation, Mathematics of Computation, vol.57, issue.195, 1991.
DOI : 10.1090/S0025-5718-1991-1079024-2

B. Li, A. Saha, and . Deshpande, A unified approach to ranking in probabilistic databases, PVLDB, vol.2, issue.1, 2009.

X. Lian and L. Chen, Probabilistic ranked queries in uncertain databases, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, 2008.
DOI : 10.1145/1353343.1353406
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.3843

X. Lian and L. Chen, A generic framework for handling uncertain data with local correlations, Proceedings of the VLDB Endowment, vol.4, issue.1, 2010.
DOI : 10.14778/1880172.1880174
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.227.7908

L. Lovász and I. Deák, Computational results of an O???(n4) volume algorithm, European Journal of Operational Research, vol.216, issue.1, p.2012
DOI : 10.1016/j.ejor.2011.06.024

L. Lovász and S. Vempala, Hit-and-run from a corner, SIAM J. Comput, vol.35, issue.4, 2006.

F. Maire, An algorithm for the exact computation of the centroid of higher dimensional polyhedra and its application to kernel machines, Third IEEE International Conference on Data Mining, 2003.
DOI : 10.1109/ICDM.2003.1250988

H. Papadimitriou, Efficient search for rationals, Information Processing Letters, vol.8, issue.1, 1979.
DOI : 10.1016/0020-0190(79)90079-6

A. D. Parameswaran, H. Sarma, N. Garcia-molina, J. Polyzotis, and . Widom, Humanassisted graph search: it's okay to ask questions, 2011.
DOI : 10.14778/1952376.1952377

G. Pruesse and F. Ruskey, Generating Linear Extensions Fast, SIAM Journal on Computing, vol.23, issue.2, 1994.
DOI : 10.1137/S0097539791202647
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3057

A. Luis and . Rademacher, Approximating the centroid is hard Efficient top-k query evaluation on probabilistic data, SCG, 2007. 43 Christopher Re, Nilesh N. Dalvi, and Dan Suciu ICDE, 2007.

M. Simonovits, How to compute the volume in high dimension? Mathematical programming, 2003.

M. A. Soliman, I. F. Ilyas, and S. Ben-david, Supporting ranking queries on uncertain and incomplete data, The VLDB Journal, vol.19, issue.4, 2010.
DOI : 10.1007/s00778-009-0176-8

M. A. Soliman, I. F. Ilyas, K. Chen-chuan, and . Chang, Top-k Query Processing in Uncertain Databases, 2007 IEEE 23rd International Conference on Data Engineering, 2007.
DOI : 10.1109/ICDE.2007.367935

J. Stoyanovich, S. Amer-yahia, B. Susan, M. Davidson, T. Jacob et al., Understanding local structure in ranked datasets, CIDR, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00923541

C. Sun, N. Rampalli, F. Yang, and A. Doan, Chimera, Proceedings of the VLDB Endowment, vol.7, issue.13, pp.7-2014
DOI : 10.14778/2733004.2733024

C. Wang, L. Yuan, J. You, R. Osmar, J. Zaïane et al., On pruning for top-k ranking in uncertain databases, Proceedings of the VLDB Endowment, vol.4, issue.10, p.4, 2011.
DOI : 10.14778/2021017.2021018

F. Yi, G. Li, D. Kollios, and . Srivastava, Efficient Processing of Top-k Queries in Uncertain Databases, 2008 IEEE 24th International Conference on Data Engineering, 2008.
DOI : 10.1109/ICDE.2008.4497571

X. Zhang and J. Chomicki, Semantics and evaluation of top-k queries in??probabilistic databases, Distributed and Parallel Databases, vol.16, issue.1, 2009.
DOI : 10.1007/s10619-009-7050-y