Top-k Stabbing Interval Queries
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910685661757440 |
|---|---|
| author | Akram, Waseem Saxena, Sanjeev |
| author_facet | Akram, Waseem Saxena, Sanjeev |
| contents | We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set $\mathcal{I}$ of weighted intervals such that, for a query point $q$ and an integer $k>0$, we can report the $k$ intervals with largest weights among those stabbed by $q$. In this paper, we present a linear space solution with $O(\log n + k)$ query time. Moreover, we also present another trade-off for the problem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_03037 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Top-k Stabbing Interval Queries Akram, Waseem Saxena, Sanjeev Data Structures and Algorithms Computational Geometry We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set $\mathcal{I}$ of weighted intervals such that, for a query point $q$ and an integer $k>0$, we can report the $k$ intervals with largest weights among those stabbed by $q$. In this paper, we present a linear space solution with $O(\log n + k)$ query time. Moreover, we also present another trade-off for the problem. |
| title | Top-k Stabbing Interval Queries |
| topic | Data Structures and Algorithms Computational Geometry |
| url | https://arxiv.org/abs/2411.03037 |