Ranking queries on uncertain data.

DOI10.1007/978-1-4419-9380-9zbMATH Open1216.68011OpenAlexW4230389186MaRDI QIDQ632371FDOQ632371

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)

Cited In (7)

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

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)