Efficient processing of probabilistic set-containment queries on uncertain set-valued data

DOI10.1016/j.ins.2012.02.004zbMath1247.68075OpenAlexW2054997291MaRDI QIDQ454921

Gang Chen, Yuan Gao, Xiaolong Zhang, Ke Chen, Kian-Lee Tan, Li-Dan Shou

Publication date: 2 October 2012

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

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

zbMATH Keywords

expected jaccard containmentprobabilistic set-containment query/joinset containment queryuncertain queryuncertain set-valued attributesuncertain set-valued data

Mathematics Subject Classification ID

Database theory (68P15) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ranking queries on uncertain data.
• Combining intensional with extensional query evaluation in tuple independent probabilistic databases
• On the representation and querying of sets of possible worlds
• Incomplete Information in Relational Databases
• Extended algebra and calculus for nested relational databases

This page was built for publication: Efficient processing of probabilistic set-containment queries on uncertain set-valued data