Pages that link to "Item:Q390147"
From MaRDI portal
The following pages link to Data structures for range-aggregate extent queries (Q390147):
Displaying 21 items.
- Data structures for extension violations in a query range (Q662125) (← links)
- Closest-pair queries and minimum-weight queries are equivalent for squares (Q824331) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Applications of range query theory to relational data base join and selection operations (Q1915512) (← links)
- Efficient external memory structures for range-aggregate queries (Q1931282) (← links)
- On the power of the semi-separated pair decomposition (Q1947974) (← links)
- Approximate range closest-pair queries (Q2206740) (← links)
- Range search on tuples of points (Q2253898) (← links)
- Closest-pair queries in fat rectangles (Q2331215) (← links)
- Opportunistic data structures for range queries (Q2498981) (← links)
- New bounds for range closest-pair problems (Q2671166) (← links)
- Aggregate-MAX Top-<i>k</i> Nearest Neighbor Searching in the <i>L</i><sub>1</sub> Plane (Q2950594) (← links)
- Range-Aggregate Queries Involving Geometric Aggregation Operations (Q3078390) (← links)
- On the Power of the Semi-Separated Pair Decomposition (Q3183436) (← links)
- (Q4410603) (← links)
- Searching for the closest-pair in a query translate (Q5088994) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- New Bounds for Range Closest-Pair Problems (Q5116533) (← links)
- Algorithms and Computation (Q5191680) (← links)
- (Q5705139) (← links)
- Range closest-pair search in higher dimensions (Q5896868) (← links)