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

DOI10.1016/J.INS.2012.02.004zbMATH Open1247.68075OpenAlexW2054997291MaRDI QIDQ454921FDOQ454921

Gang Chen, Xiaolong Zhang, Yuan Gao, Kian-Lee Tan, Ke Chen, Lidan 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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Incomplete Information in Relational Databases
• On the representation and querying of sets of possible worlds
• Extended algebra and calculus for nested relational databases
• Ranking queries on uncertain data.
• Combining intensional with extensional query evaluation in tuple independent probabilistic databases

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454921)