Ranking queries on uncertain data.

DOI10.1007/978-1-4419-9380-9MaRDI QIDQ632371zbMATH OpenOpenAlexFDO

Authors Ming Hua, Jian Pei

Publication date 16 March 2011

Published in Advances in Database Systems (Search for Journal in Brave)

Full work available at URL http://summit.sfu.ca/item/10421

zbMATH Keywords

road networkstop-\(k\) queriescontinuous ranking queriesprobabilistic linkagesprobabilistic ranking queriesuncertain data processing

Mathematics Subject Classification ID

Applications of statistics (62P99) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Reasoning under uncertainty in the context of artificial intelligence (68T37) Database theory (68P15)

Recommendations

• Probabilistic top-\(k\) and ranking query algorithms in uncertain databases
• Survey on query processing based on uncertain data
• Probabilistic ranking techniques in relational databases.
• Continuous ranking on uncertain streams
• Managing and mining uncertain data

Cited in

(10)

• Possible world based consistency learning model for clustering and classifying uncertain data
• Querying with Uncertainty
• Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data
• MUD: mapping-based query processing for high-dimensional uncertain data
• On the semantics of top-\(k\) ranking for objects with uncertain data
• Range-max queries on uncertain data
• Probabilistic ranking techniques in relational databases.
• Efficient processing of probabilistic set-containment queries on uncertain set-valued data
• Continuous ranking on uncertain streams
• Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples

This page was built for publication: Ranking queries on uncertain data.

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