.png){kind=icon}
返回
Multidimensional access methods
.png){kind=icon}
OA
AI
DOI：10.1145/280277.280279.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Search operations in databases require special support at the physical level. This is true for conventional databases as well as spatial databases, where typical search operations include the point query (find all objects that contain a given search point) and the region query (find all objects that overlap a given search region). More than ten years of spatial database research have resulted in a great variety of multidimensional access methods to support such operations. We give an overview of that work. After a brief survey of spatial data management in general, we first present the class of point access methods, which are used to search sets of points in two or more dimensions. The second part of the paper is devoted to spatial access methods to handle extended objects, such as rectangles or polyhedra. We conclude with a discussion of theoretical and experimental results concerning the relative performance of various approaches.
Keyword:
data structures
multidimensional access methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
28
论文数:
2.4K
被引数:
3.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Fluorescence-Quenched Substrates for Quantitative Live Cell Imaging of Glucocerebrosidase Activity
PREAI
分享收藏
查看更多内容