.png){kind=icon}
返回
A General Technique for Top-k Geometric Intersection Query Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2014.2316807.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In a top-k Geometric Intersection Query (top-k GIQ) problem, a set of n weighted, geometric objects in R-d is to be preprocessed into a compact data structure so that for any query geometric object, q, and integer k > 0, the k largest-weight objects intersected by q can be reported efficiently. While the top-k problem has been studied extensively for non-geometric problems (e. g., recommender systems), the geometric version has received little attention. This paper gives a general technique to solve any top-k GIQ problem efficiently. The technique relies only on the availability of an efficient solution for the underlying (non-top-k) GIQ problem, which is often the case. Using this, asymptotically efficient solutions are derived for several top-k GIQ problems, including top-k orthogonal and circular range search, point enclosure search, halfspace range search, etc. Implementations of some of these solutions, using practical data structures, show that they are quite efficient in practice. This paper also does a formal investigation of the hardness of the top-k GIQ problem, which reveals interesting connections between the top-k GIQ problem and the underlying (non-top-k) GIQ problem.
Keyword:
Range search
aggregation
Top-k
query processing and optimization
geometric algorithms and data structures
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Public awareness, involvement, and practices in electronic waste management in Addis Ababa, Ethiopia
OAAI
OAAI分享收藏
查看更多内容