Abstract
In Chapters 4, 5 and 6, we adopt an independent uncertain object model. That is, we assume that any two uncertain objects in a data set are independent. In many applications, various types of dependencies may exist among real world uncertain objects, such as the case shown in Example 2.12. In this chapter, we study how to answer probabilistic ranking queries on the probabilistic linkage model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Hua, M., Pei, J. (2011). Ranking Queries on Probabilistic Linkages. In: Ranking Queries on Uncertain Data. Advances in Database Systems, vol 42. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9380-9_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9380-9_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-9379-3
Online ISBN: 978-1-4419-9380-9
eBook Packages: Computer ScienceComputer Science (R0)