Probabilistic databases with MarkoViews
نویسندگان
چکیده
منابع مشابه
Probabilistic Databases with MarkoViews
Most of the work on query evaluation in probabilistic databases has focused on the simple tuple-independent data model, where tuples are independent random events. Several efficient query evaluation techniques exists in this setting, such as safe plans, algorithms based on OBDDs, treedecomposition and a variety of approximation algorithms. However, complex data analytics tasks often require com...
متن کاملProbabilistic Databases
This paper provides a glimpse of basic probabilistic database concepts, which is an active area of research in today’s world. The discussion starts with the need for probabilistic databases, and their advantages over conventional databases in certain circumstances. Then, some of the key aspects of probabilistic databases are discussed, which include topics like types of uncertainties in a proba...
متن کاملQueries with Difference on Probabilistic Databases
We study the feasibility of the exact and approximate computation of the probability of relational queries with difference on tuple-independent databases. We show that even the difference between two “safe” conjunctive queries without self-joins is “unsafe” for exact computation. We turn to approximation and design an FPRAS for a large class of relational queries with difference, limited by how...
متن کاملTractable Queries with Inequalities on Probabilistic Databases
The problem of efficient evaluation of queries on probabilistic databases has received a great attention in recent years. In this thesis, we introduce novel classes of queries with inequalities (<,≤) that admit tractable evaluation, in the context where query evaluation is #P-hard in general. We also introduce a new kind of hard query that is not captured by previous characterizations. As an ap...
متن کاملApproximate Lifted Inference with Probabilistic Databases
This paper proposes a new approach for approximate evaluation of #P-hard queries with probabilistic databases. In our approach, every query is evaluated entirely in the database engine by evaluating a fixed number of query plans, each providing an upper bound on the true probability, then taking their minimum. We provide an algorithm that takes into account important schema information to enume...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2012
ISSN: 2150-8097
DOI: 10.14778/2350229.2350236