Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data

DOI10.1016/j.jcss.2016.05.010zbMath1372.68227OpenAlexW2492317651MaRDI QIDQ2402353

Keqin Li, Guoqing Xiao, Xu Zhou, KenLi Li

Publication date: 7 September 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.05.010

zbMATH Keywords

uncertain datadata managementbig dataquery processingprobabilistic reverse top-\(k\) queries

Mathematics Subject Classification ID

Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (4)

Intuitionistic linguistic group decision-making methods based on generalized compensative weighted averaging aggregation operators ⋮ Prioritized aggregation operators and correlated aggregation operators for hesitant 2-tuple linguistic variables ⋮ kNN-P: a kNN classifier optimized by P systems ⋮ Hesitant picture 2-tuple linguistic aggregation operators based on Archimedean t-norm and t-conorm and their use in decision-making

Uses Software

• Casper*

Cites Work

• Queries and materialized views on probabilistic databases
• Ranking queries on uncertain data.
• Consistency checking and querying in probabilistic databases under integrity constraints
• Probabilistic top-\(k\) dominating queries in uncertain databases
• Computing rational solutions of linear matrix inequalities
• Comparing Top k Lists

This page was built for publication: Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data