.png){kind=icon}
.png){kind=icon}
Return
cBiK: A Space-Efficient Data Structure for Spatial Keyword Queries
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2997258.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A vast amount of geo-referenced data is being generated by mobile devices and other sensors increasing the importance of spatio-textual analyses on such data. Due to the large volume of data, the use of indexes to speed up the queries that facilitate such analyses is imperative. Many disk resident indexes have been proposed for different types of spatial keyword queries, but their efficiency is harmed by their high I/O costs. In this work, we propose , the first spatio-textual index that uses compact data structures to reduce the size of the structure, hence facilitating its usage in main memory. Our experimental evaluation, shows that this approach needs half the space and is more than one order of magnitude faster than a disk resident state-of-the-art index. Also, we show that our approach is competitive even in a scenario where the disk resident data structure is warmed-up to fit in main memory.
Keywords:
Data structures
Wireless fidelity
Spatial databases
Euclidean distance
Spatial indexes
Computer science
Bitmap
compact data structure
< italic xmlns:ali=http:
www
niso
org
schemas
ali
1
0
xmlns:mml=http:
www
w3
org
1998
Math
MathML xmlns:xlink=http:
www
w3
org
1999
xlink xmlns:xsi=http:
www
w3
org
2001
XMLSchema-instance> k <
italic > NN
spatial keyword query
spatio-textual data
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
View more organizations