@inproceedings{4fd318ac535b4eb8a37c7cb4779b85d0,
title = "A new class of lineage expressions over probabilistic databases computable in p-time",
abstract = "We study the problem of query evaluation over tuple-independent probabilistic databases. We define a new characterization of lineage expressions called disjoint branch acyclic, and show this class to be computed in P-time. Specifically, this work extends the class of lineage expressions for which evaluation can be performed in PTIME. We achieve this extension with a novel usage of junction trees to compute the probability of these lineage expressions.",
author = "Batya Kenig and Avigdor Gal and Ofer Strichman",
year = "2013",
doi = "10.1007/978-3-642-40381-1_17",
language = "الإنجليزيّة",
isbn = "9783642403804",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "219--232",
booktitle = "Scalable Uncertainty Management - 7th International Conference, SUM 2013, Proceedings",
note = "7th International Conference on Scalable Uncertainty Management, SUM 2013 ; Conference date: 16-09-2013 Through 18-09-2013",
}