Ranking queries on uncertain data.
From MaRDI portal
Publication:632371
DOI10.1007/978-1-4419-9380-9zbMath1216.68011OpenAlexW4230389186MaRDI QIDQ632371
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
road networkstop-\(k\) queriescontinuous ranking queriesprobabilistic linkagesprobabilistic ranking queriesuncertain data processing
Database theory (68P15) Applications of statistics (62P99) Reasoning under uncertainty in the context of artificial intelligence (68T37) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (6)
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 ⋮ Efficient processing of probabilistic set-containment queries on uncertain set-valued data ⋮ Range-max queries on uncertain data ⋮ MUD: mapping-based query processing for high-dimensional uncertain data
This page was built for publication: Ranking queries on uncertain data.
