Ranking Queries on Probabilistic Linkages

  • Ming HuaEmail author
  • Jian Pei
Part of the Advances in Database Systems book series (ADBS, volume 42)


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.


Maximal Clique Query Evaluation Probabilistic Linkage Uncertain Object Aggregate Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Facebook Inc.Palo Alto CaliforniaUSA
  2. 2.School of Computing ScienceSimon Fraser UniversityBurnaby BritishCanada

Personalised recommendations