Pages that link to "Item:Q2911364"
From MaRDI portal
The following pages link to Probabilistic top-\(k\) and ranking query algorithms in uncertain databases (Q2911364):
Displaying 12 items.
- Computing rarity on uncertain data (Q350968) (← links)
- Efficient processing of probabilistic set-containment queries on uncertain set-valued data (Q454921) (← links)
- Ranking queries on uncertain data. (Q632371) (← links)
- \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models (Q660968) (← links)
- On the semantics of top-\(k\) ranking for objects with uncertain data (Q660976) (← links)
- A dynamic data structure for top-\(k\) queries on uncertain data (Q955007) (← links)
- Efficient monochromatic and bichromatic probabilistic reverse top-\(k\) query processing for uncertain big data (Q2402353) (← links)
- Probabilistic top-\(k\) dominating queries in uncertain databases (Q2510183) (← links)
- Supporting various top-k queries over uncertain datasets (Q2927290) (← links)
- Top-k Querying of Unknown Values under Order Constraints (Q3174893) (← links)
- Probabilistic Ranking Techniques in Relational Databases (Q5392548) (← links)
- Continuous ranking on uncertain streams (Q5964251) (← links)
