References - Ranking Queries on Uncertain Data - page 219

111. A.C. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss, in VLDB (2002), pp. 454-465
112. M. Greenwald, S. Khanna, in SIGMOD Conference (2001), pp. 58-66
113. G.S. Manku, S. Rajagopalan, B.G. Lindsay, in SIGMOD '99: Proceedings of the 1999 ACM
SIGMOD international conference on Management of data (ACM, New York, NY, USA,
1999), pp. 251-262. DOI http://doi.acm.org/10.1145/304182.304204
114. G. Cormode, F. Korn, S. Muthukrishnan, D. Srivastava, in ICDE'05
115. G. Das, D. Gunopulos, N. Koudas, N. Sarkas, in VLDB (2007), pp. 183-194
116. A. Deshpande, C. Guestrin, S. Madden, J.M. Hellerstein, W. Hong, in VLDB (2004), pp.
588-599
117. Z. Liu, K.C. Sia, J. Cho, in SAC (2005), pp. 634-641
118. S. Han, E. Chan, R. Cheng, K. yiu Lam, Real-Time Systems 35 (1), 33 (2007)
119. L.J. Roos, A. Wajda, J. Nicol, Comput Biol Med. 16 , 45 (1986)
120. I.P. Fellegi, A.B. Sunter, Journal of the American Statistical Association 64 , 1183 (1969)
121. T.N. Herzog, F.J. Scheuren, W.E. Winkler, in Data Quality and Record Linkage Techniques
(Springer New York, 2007), pp. 93-106
122. W. Winkler. Matching and record linkage (1995). URL http://citeseer.ist.psu.
edu/winkler95matching.html
123. W.E. Winkler, in Proceedings of the Section on Survey Research Methods, American Statis-
tical Association (1993), pp. 274-279
124. V.I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals.
Tech. Rep. 8 (1966)
125. D. Gusfield, Algorithms on strings, trees, and sequences: computer science and computa-
tional biology (Cambridge University Press, New York, NY, USA, 1997)
126. L. Gravano, P.G. Ipeirotis, H.V. Jagadish, N. Koudas, S. Muthukrishnan, D. Srivastava, in
VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases
(Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2001), pp. 491-500
127. S. Chaudhuri, K. Ganjam, V. Ganti, R. Motwani, in SIGMOD '03: Proceedings of the 2003
ACM SIGMOD international conference on Management of data (ACM, New York, NY,
USA, 2003), pp. 313-324. DOI http://doi.acm.org/10.1145/872757.872796
128. W.

Cohen, P. Ravikumar, S. Fienberg. A comparison of string distance met-

rics for name-matching tasks (2003). URL http://citeseer.ist.psu.edu/

cohen03comparison.html
129. A. Inan, M. Kantarcioglu, E. Bertino, M. Scannapieco, in ICDE (2008), pp. 496-505
130. P. Christen, in KDD (2008), pp. 151-159
131. M. Michelson, C.A. Knoblock, in AAAI (2006)
132. C. Li, L. Jin, S. Mehrotra, World Wide Web 9 (4), 557 (2006)
133. F.V. Jensen, An Introduction to Bayesian Networks , 1st edn. (UCL Press, 1996)
134. R. Kindermann, J. Snell, Markov random fields and their applications (American Mathemat-
ical Society, Providence, Rhode Island, 1980)
135. E. Castillo, J.M. Gurtierrez, A.S. Hadi, Expert Systems and Probabilistic Network Models .
Monographs in Computer Science (1997)
136. H. Frank, Operations Research 17 (4), 583 (1969)
137. R.P. Loui, Commun. ACM 26 (9), 670 (1983).

DOI http://doi.acm.org/10.1145/358172.

358406
138. R. Hassin, E. Zemel, Mathematics of Operations Research 10 (4), 557 (1985)
139. S.K. Walley, H.H. Tan, in COCOON '95: Proceedings of the First Annual International
Conference on Computing and Combinatorics (Springer-Verlag, London, UK, 1995), pp.
213-222
140. D. Blai, L. Kaelbling, in IJCAI Workshop on Adaptive Spatial Representations of Dynamic
Environments (1999)
141. D.D.M.L. Rasteiro, A.J.B. Anjo, Journal of Mathematical Sciences 120 (1), 974 (2004)
142. Fan, Yueyue, Nie, Yu, Networks and Spatial Economics 6 (3-4), 333 (2006). DOI
http://dx.doi.org/10.1007/s11067-006-9287-6. URL http://dx.doi.org/10.1007/
s11067-006-9287-6