Analytics over probabilistic unmerged duplicates

Ekaterini Ioannou, Minos N. Garofalakis

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review


This paper introduces probabilistic databases with unmerged duplicates (DB ud ), i.e., databases containing probabilistic information about instances found to describe the same real-world objects. We discuss the need for efficiently querying such databases and for supporting practical query scenarios that require analytical or summarized information. We also sketch possible methodologies and techniques that would allow performing efficient processing of queries over such probabilistic databases, and especially without the need to materialize the (potentially, huge) collection of all possible deduplication worlds.
Original languageEnglish
Title of host publicationProceedings of the International Conference on Scalable Uncertainty Management (SUM2014)
Place of PublicationCham
ISBN (Print)9783319115078
Publication statusPublished - 2014
Externally publishedYes

Publication series

NameLecture Notes in Computer Science

Cite this