Pages that link to "Item:Q2283020"
From MaRDI portal
The following pages link to The hardness of resilience for nested aggregation query (Q2283020):
Displaying 4 items.
- Range partitioning within sublinear time: algorithms and lower bounds (Q2220789) (← links)
- Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762) (← links)
- Sampling-based approximate skyline calculation on big data (Q5057727) (← links)
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee (Q5919060) (← links)
