arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2207.00550cs.DBcs.LG
收藏

“AI +R”树:实例优化的R树

The "AI+R"-tree: An Instance-optimized R-tree

Purdue University(普渡大学)

Abdullah-Al-Mamun, Ch. Md. Rakin Haider, Jianguo Wang, Walid G. Aref

摘要:

实例优化系统的新兴类别已经显示出通过专门针对特定数据和查询工作负载来实现高性能的潜力。特别地,机器学习(ML)技术已经成功地应用于构建各种实例优化的组件(例如,学习指数)。本文研究利用ML技术来增强空间索引的性能,特别是R树,用于给定的数据和查询工作负载。由于R树索引节点覆盖的区域在空间上重叠,因此在搜索空间中的特定点时,可以潜在地探索从根到叶的多个路径。在最坏的情况下,可以搜索整个R树。在本文中,我们定义并使用重叠率来量化范围查询所需的无关叶节点访问的程度。我们的目标是提高传统的R树的查询性能高重叠范围查询,因为他们往往会招致长的运行时间。我们引入了一种新的AI树,将R树的搜索操作转换为多标签分类任务,以排除无关的叶节点访问。然后,我们将传统的R-树扩充到AI-树中,形成混合的“AI+R”-树。“AI+R”树可以使用学习模型自动区分高重叠和低重叠查询。因此,“AI+R”树使用AI树处理高重叠查询,并且使用R树处理低重叠查询。在真实数据集上的实验表明,“AI+R”树可以提高查询性能比传统的R树高达500%。

英文摘要:

The emerging class of instance-optimized systems has shown potential to achieve high performance by specializing to a specific data and query workloads. Particularly, Machine Learning (ML) techniques have been applied successfully to build various instance-optimized components (e.g., learned indexes). This paper investigates to leverage ML techniques to enhance the performance of spatial indexes, particularly the R-tree, for a given data and query workloads. As the areas covered by the R-tree index nodes overlap in space, upon searching for a specific point in space, multiple paths from root to leaf may potentially be explored. In the worst case, the entire R-tree could be searched. In this paper, we define and use the overlap ratio to quantify the degree of extraneous leaf node accesses required by a range query. The goal is to enhance the query performance of a traditional R-tree for high-overlap range queries as they tend to incur long running-times. We introduce a new AI-tree that transforms the search operation of an R-tree into a multi-label classification task to exclude the extraneous leaf node accesses. Then, we augment a traditional R-tree to the AI-tree to form a hybrid "AI+R"-tree. The "AI+R"-tree can automatically differentiate between the high- and low-overlap queries using a learned model. Thus, the "AI+R"-tree processes high-overlap queries using the AI-tree, and the low-overlap queries using the R-tree. Experiments on real datasets demonstrate that the "AI+R"-tree can enhance the query performance over a traditional R-tree by up to 500%.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑