WISK: A Workload-aware Learned Index for Spatial Keyword Queries

Author:

Sheng Yufan1ORCID,Cao Xin1ORCID,Fang Yixiang2ORCID,Zhao Kaiqi3ORCID,Qi Jianzhong4ORCID,Cong Gao5ORCID,Zhang Wenjie1ORCID

Affiliation:

1. University of New South Wales, Sydney, NSW, Australia

2. The Chinese University of Hong Kong, Shenzhen, Shenzhen, China

3. University of Auckland, Auckland, New Zealand

4. The University of Melbourne, Melbourne, VIC, Australia

5. Nanyang Technological Univesity, Singapore, Singapore

Abstract

Spatial objects often come with textual information, such as Points of Interest (POIs) with their descriptions, which are referred to as geo-textual data. To retrieve such data, spatial keyword queries that take into account both spatial proximity and textual relevance have been extensively studied. Existing indexes designed for spatial keyword queries are mostly built based on the geo-textual data without considering the distribution of queries already received. However, previous studies have shown that utilizing the known query distribution can improve the index structure for future query processing. In this paper, we propose WISK, a learned index for spatial keyword queries, which self-adapts for optimizing querying costs given a query workload. One key challenge is how to utilize both structured spatial attributes and unstructured textual information during learning the index. We first divide the data objects into partitions, aiming to minimize the processing costs of the given query workload. We prove the NP-hardness of the partitioning problem and propose a machine learning model to find the optimal partitions. Then, to achieve more pruning power, we build a hierarchical structure based on the generated partitions in a bottom-up manner with a reinforcement learning-based approach. We conduct extensive experiments on real-world datasets and query workloads with various distributions, and the results show that WISK outperforms all competitors, achieving up to 8× speedup in querying time with comparable storage overhead.

Funder

Guangdong Talent Program

NSFC

Basic and Applied Basic Research Fund in Guangdong Province

Shenzhen Science and Technology Program

Australian Research Council (ARC) Discovery Project

Australian Research Council Future Fellowship

Publisher

Association for Computing Machinery (ACM)

Reference79 articles.

1. Mining association rules between sets of items in large databases

2. Rakesh Agrawal Heikki Mannila Ramakrishnan Srikant Hannu Toivonen A Inkeri Verkamo etal 1996. Fast discovery of association rules. Vol. 12. AAAI/MIT Press Menlo Park CA 307--328. Rakesh Agrawal Heikki Mannila Ramakrishnan Srikant Hannu Toivonen A Inkeri Verkamo et al. 1996. Fast discovery of association rules. Vol. 12. AAAI/MIT Press Menlo Park CA 307--328.

3. The R*-tree: an efficient and robust access method for points and rectangles

4. Machine learning for combinatorial optimization: A methodological tour d’horizon

5. Variance Reduction

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Chameleon: Towards Update-Efficient Learned Indexing for Locally Skewed Data;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Accelerating String-Key Learned Index Structures via Memoization-Based Incremental Training;Proceedings of the VLDB Endowment;2024-04

3. SAM: A Spatial-Aware Learned Index for Disk-Based Multi-dimensional Search;Lecture Notes in Computer Science;2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3