UC-PSkyline: probabilistic skyline queries over uncertain contexts
From MaRDI portal
Publication:1990343
DOI10.1007/978-3-319-42297-8_57zbMATH Open1398.68126DBLPconf/icic/ZhangZW16OpenAlexW2485716217WikidataQ58361733 ScholiaQ58361733MaRDI QIDQ1990343FDOQ1990343
Authors: Jiping Zheng, Zhiming Zhang, Y. Wang
Publication date: 25 October 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-42297-8_57
Recommendations
Data structures (68P05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Database theory (68P15)
Cited In (12)
- Skyline queries over possibilistic RDF data
- Bounds on skyline probability for databases with uncertain preferences
- Efficient computation for probabilistic skyline over uncertain preferences
- Bi-directional search for skyline probability
- Skyline ranking for uncertain databases
- Towards estimating expected sizes of probabilistic skylines
- Effective approach for an extended P-skyline query
- Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples
- Efficient skyline maintenance over frequently updated evidential databases
- (Approximate) uncertain skylines
- Survey on query processing based on uncertain data
- Domination in the probabilistic world: computing skylines for arbitrary correlations and ranking semantics
This page was built for publication: UC-PSkyline: probabilistic skyline queries over uncertain contexts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990343)