Combining intensional with extensional query evaluation in tuple independent probabilistic databases

DOI10.1016/j.ins.2010.11.001zbMath1211.68166OpenAlexW2000965296MaRDI QIDQ632784

Shan Wang, Biao Qin

Publication date: 28 March 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.11.001

zbMATH Keywords

hierarchyprobabilistic databasesbucket elimination frameworkprobabilistic graphical modelsafe plan

Mathematics Subject Classification ID

Database theory (68P15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Efficient processing of probabilistic set-containment queries on uncertain set-valued data ⋮ MUD: mapping-based query processing for high-dimensional uncertain data

Uses Software

• ProbView
• MYSTIQ
• MS SQL Server
• Trio

Cites Work

• Query evaluation in probabilistic relational databases
• Contrast of a fuzzy relation
• Bucket elimination: a unifying framework for processing hard and soft constraints
• Database design and querying within the fuzzy semantic model

This page was built for publication: Combining intensional with extensional query evaluation in tuple independent probabilistic databases