A learned spatial textual index for efficient keyword queries

被引:1
作者
Ding, Xiaofeng [1 ]
Zheng, Yinting [1 ]
Wang, Zuan [1 ]
Choo, Kim-Kwang Raymond [2 ]
Jin, Hai [1 ]
机构
[1] Huazhong Univ Sci & Technol, Natl Engn Res Ctr Big Data Technol & Syst, Sch Comp Sci & Technol, Serv Comp Technol & Syst Lab,Cluster & Grid Comp, Wuhan 430074, Hubei, Peoples R China
[2] Univ Texas San Antonio, San Antonio, TX 78249 USA
基金
中国国家自然科学基金;
关键词
Learned index; Spatial textual data; Query processing; Index optimization; SEARCH;
D O I
10.1007/s10844-022-00752-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Spatial textual indexing techniques allow one to efficiently access and process large volume of geospatial data, and recent research efforts have demonstrated that learned indexes can lead to better performance in comparison to conventional indexes. In this paper, we present a learned spatial textual index designed to process spatial textual data efficiently. Specifically, our proposed index is constructed based on the idea of radix table, spline points, and inverted lists. Besides, Morton encoding was used to convert high-dimensional coordinates into one dimension. In order to handle data insertion, deletion, and update in real-time, a gap array is used to store the underlying data, and a space reallocation strategy in units of spline points is designed. Based on the index, we propose query processing algorithms to handle different spatial keyword queries efficiently. An optimizer using random forest regression model was also designed to obtain appropriate index parameters for minimizing query latency. We evaluate our proposed index with IR-tree, and the findings show that our index outperforms IR-tree in terms of construction time, index size, and query efficiency.
引用
收藏
页码:803 / 827
页数:25
相关论文
共 40 条
[1]  
[Anonymous], 2005, P 2005 ACM CIKM INT
[2]   SP-GiST: An extensible database index for supporting space partitioning trees [J].
Aref, WG ;
Ilyas, IF .
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2001, 17 (2-3) :215-240
[3]  
BECKMANN N, 1990, SIGMOD REC, V19, P322, DOI 10.1145/93605.98741
[4]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[5]   Time-Aware Boolean Spatial Keyword Queries [J].
Chen, Gang ;
Zhao, Jingwen ;
Gao, Yunjun ;
Chen, Lei ;
Chen, Rui .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2017, 29 (11) :2601-2614
[6]   Spatial keyword search: a survey [J].
Chen, Lisi ;
Shang, Shuo ;
Yang, Chengcheng ;
Li, Jing .
GEOINFORMATICA, 2020, 24 (01) :85-106
[7]   Spatial Keyword Query Processing: An Experimental Evaluation [J].
Chen, Lisi ;
Cong, Gao ;
Jensen, Christian S. ;
Wu, Dingming .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (03) :217-228
[8]   Maximizing Bichromatic Reverse Spatial and Textual k Nearest Neighbor Queries [J].
Choudhury, Farhana M. ;
Culpepper, J. Shane ;
Sellis, Timos ;
Cao, Xin .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2016, 9 (06) :456-467
[9]  
Cong G, 2009, PROC VLDB ENDOW, V2
[10]  
Davitkova A., 2020, EDBT, P407