Probabilistic ranking techniques in relational databases.

DOI10.2200/S00344ED1V01Y201103DTM014MaRDI QIDQ5392548zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ihab F. Ilyas, Mohamed A. Soliman

Publication date 12 April 2011

Published in Synthesis Lectures on Data Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2200/s00344ed1v01y201103dtm014

Mathematics Subject Classification ID

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

Recommendations

• Probabilistic top-k and ranking query algorithms in uncertain databases
• Ranking queries on uncertain data.
• Continuous ranking on uncertain streams
• Probabilistic top-\(k\) range query processing for uncertain databases
• On the semantics of top-\(k\) ranking for objects with uncertain data

Cited in

(3)

• A novel ranking framework for linked data from relational databases
• Continuous ranking on uncertain streams
• Ranking queries on uncertain data.

This page was built for publication: Probabilistic ranking techniques in relational databases.

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