{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:18Z","timestamp":1773481758581,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,2,10]],"date-time":"2010-02-10T00:00:00Z","timestamp":1265760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s00778-009-0176-8","type":"journal-article","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T16:37:14Z","timestamp":1265733434000},"page":"477-501","source":"Crossref","is-referenced-by-count":57,"title":["Supporting ranking queries on uncertain and incomplete data"],"prefix":"10.1007","volume":"19","author":[{"given":"Mohamed A.","family":"Soliman","sequence":"first","affiliation":[]},{"given":"Ihab F.","family":"Ilyas","sequence":"additional","affiliation":[]},{"given":"Shalev","family":"Ben-David","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,10]]},"reference":[{"key":"176_CR1","doi-asserted-by":"crossref","unstructured":"Sarma, A.D., Benjelloun, O., Halevy, A., Widom, J.: Working models for uncertain data. In: ICDE (2006)","DOI":"10.1109\/ICDE.2006.174"},{"key":"176_CR2","unstructured":"Benjelloun, O., Sarma, A.D., Halevy, A., Widom, J.: Uldbs: databases with uncertainty and lineage. In: VLDB (2006)"},{"key":"176_CR3","doi-asserted-by":"crossref","unstructured":"Dalvi, N., Suciu, D.: Efficient query evaluation on probabilistic databases. In: VLDB (2004)","DOI":"10.1016\/B978-012088469-8.50076-0"},{"key":"176_CR4","doi-asserted-by":"crossref","unstructured":"Chang, K.C.-C., Hwang, S.: Minimal probing: supporting expensive predicates for top-k queries. In: SIGMOD (2002)","DOI":"10.1145\/564691.564731"},{"key":"176_CR5","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., Soliman, M.A.: A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv. 40(4) (2008)","DOI":"10.1145\/1391729.1391730"},{"key":"176_CR6","doi-asserted-by":"crossref","unstructured":"Wolf, G., Khatri, H., Chokshi, B., Fan, J., Chen, Y., Kambhampati, S.: Query processing over incomplete autonomous databases. In: VLDB (2007)","DOI":"10.1109\/ICDE.2007.369028"},{"key":"176_CR7","doi-asserted-by":"crossref","unstructured":"Wu, X., Barbar\u00e1, D.: Learning missing values from summary constraints. SIGKDD Explor. 4(1) (2002)","DOI":"10.1145\/568574.568579"},{"key":"176_CR8","doi-asserted-by":"crossref","unstructured":"Chomicki, J.: Preference formulas in relational queries. ACM Trans. Database Syst. 28(4) (2003)","DOI":"10.1145\/958942.958946"},{"key":"176_CR9","doi-asserted-by":"crossref","unstructured":"Chan, C.-Y., Jagadish, H.V., Tan, K.-L., Tung, A.K.H., Zhang, Z.: Finding k-dominant skylines in high dimensional space. In: SIGMOD (2006)","DOI":"10.1145\/1142473.1142530"},{"key":"176_CR10","doi-asserted-by":"crossref","unstructured":"Tao, Y., Xiao, X., Pei, J.: Efficient skyline and top-k retrieval in subspaces. TKDE 19(8) (2007)","DOI":"10.1109\/TKDE.2007.1051"},{"key":"176_CR11","doi-asserted-by":"crossref","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions is #p-complete. In: STOC (1991)","DOI":"10.1145\/103418.103441"},{"key":"176_CR12","doi-asserted-by":"crossref","unstructured":"Cheng, R., Prabhakar, S., Kalashnikov, D.V.: Querying imprecise data in moving object environments. In: ICDE (2003)","DOI":"10.1109\/ICDE.2003.1260848"},{"key":"176_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW (2001)","DOI":"10.1145\/371920.372165"},{"key":"176_CR14","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Guestrin, C., Madden, S., Hellerstein, J.M., Hong, W.: Model-based approximate querying in sensor networks. VLDB J. 14(4) (2005)","DOI":"10.1007\/s00778-005-0159-3"},{"key":"176_CR15","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Kanellakis, P., Grahne, G.: On the representation and querying of sets of possible worlds. In: SIGMOD (1987)","DOI":"10.1145\/38713.38724"},{"key":"176_CR16","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367935"},{"key":"176_CR17","unstructured":"Zhang, X., Chomicki, J.: On the semantics and evaluation of top-k queries in probabilistic databases. In: ICDE Workshops (2008)"},{"key":"176_CR18","doi-asserted-by":"crossref","unstructured":"Hua, M., Pei, J., Zhang, W., Lin, X.: Ranking queries on uncertain data: a probabilistic threshold approach. In: SIGMOD (2008)","DOI":"10.1145\/1376616.1376685"},{"key":"176_CR19","doi-asserted-by":"crossref","unstructured":"O\u2019Leary, D.P.: Multidimensional integration: partition and conquer. Comput. Sci. Eng. 6(6) (2004)","DOI":"10.1109\/MCSE.2004.71"},{"key":"176_CR20","unstructured":"Jerrum, M., Sinclair, A.: The markov chain monte carlo method: an approach to approximate counting and integration. Approximation algorithms for NP-hard problems (1997)"},{"key":"176_CR21","doi-asserted-by":"crossref","unstructured":"Hastings, W.K.: Monte carlo sampling methods using markov chains and their applications. Biometrika 57(1) (1970)","DOI":"10.1093\/biomet\/57.1.97"},{"key":"176_CR22","doi-asserted-by":"crossref","unstructured":"Gelman, A., Rubin, D.B.: Inference from iterative simulation using multiple sequences. Stat. Sci. 7(4) (1992)","DOI":"10.1214\/ss\/1177011136"},{"key":"176_CR23","doi-asserted-by":"crossref","unstructured":"Cowles, M.K., Carlin, B.P.: Markov chain Monte Carlo convergence diagnostics: a comparative review. J. Am. Stat. Assoc. 91(434) (1996)","DOI":"10.1080\/01621459.1996.10476956"},{"key":"176_CR24","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC (2007)","DOI":"10.1145\/1250790.1250806"},{"key":"176_CR25","doi-asserted-by":"crossref","unstructured":"van Acker, P.: Transitivity revisited. Ann. Oper. Res. 23(1\u20134) (1990)","DOI":"10.1007\/BF02204837"},{"key":"176_CR26","doi-asserted-by":"crossref","unstructured":"Intriligator, M.D.: A probabilistic model of social choice. Rev. Econ. Stud. 40(4) (1973)","DOI":"10.2307\/2296588"},{"key":"176_CR27","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Probabilistic social choice based on simple voting comparisons. Rev. Econ. Stud. 51(4) (1984)","DOI":"10.2307\/2297786"},{"key":"176_CR28","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Markl, V., Haas, P.J., Brown, P., Aboulnaga, A.: Cords: automatic discovery of correlations and soft functional dependencies. In: SIGMOD (2004)","DOI":"10.1145\/1007568.1007641"},{"key":"176_CR29","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci. 1(1) (2001)","DOI":"10.1145\/375551.375567"},{"key":"176_CR30","doi-asserted-by":"crossref","unstructured":"Xin, D., Han, J., Chang, K.C.-C.: Progressive and selective merge: computing top-k with ad-hoc ranking functions. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247494"},{"key":"176_CR31","unstructured":"The R project for statistical computing: http:\/\/www.r-project.org"},{"key":"176_CR32","unstructured":"Bubley, R., Dyer, M.: Faster random generation of linear extensions. In: SODA (1998)"},{"key":"176_CR33","doi-asserted-by":"crossref","unstructured":"Re, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367934"},{"key":"176_CR34","unstructured":"Wu, M., Jermaine, C.: A Bayesian method for guessing the extreme values in a data set. In: VLDB (2007)"},{"key":"176_CR35","doi-asserted-by":"crossref","unstructured":"Li, J., Saha, B., Deshpande, A.: A unified approach to ranking in probabilistic databases. PVLDB 2(1) (2009)","DOI":"10.14778\/1687627.1687685"},{"key":"176_CR36","doi-asserted-by":"crossref","unstructured":"Li, J., Deshpande, A.: Consensus answers for queries over probabilistic databases. In: PODS (2009)","DOI":"10.1145\/1559795.1559835"},{"key":"176_CR37","volume-title":"Statistical Analysis with Missing Data","author":"R. Little","year":"1987","unstructured":"Little R., Rubin D.B.: Statistical Analysis with Missing Data. Wiley & Sons, New York (1987)"},{"key":"176_CR38","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316696","volume-title":"Multiple Imputation for Nonresponse in Surveys","author":"D.B. Rubin","year":"1987","unstructured":"Rubin D.B.: Multiple Imputation for Nonresponse in Surveys. Wiley & Sons, New York (1987)"},{"key":"176_CR39","doi-asserted-by":"crossref","unstructured":"Ola, A., Ozsoyoglu, G.: Incomplete relational database models based on intervals. IEEE TKDE 05(2) (1993)","DOI":"10.1109\/69.219737"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-009-0176-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-009-0176-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-009-0176-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:05:06Z","timestamp":1559142306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-009-0176-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,10]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s00778-009-0176-8","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,10]]}}}