Order reprints

Spatio-temporal Keywords Queries in HBase

Xiaoying Chen Chong Zhang Zonglin Shi Weidong Xiao

*Corresponding author:  

BDIA2016,1,81doi:10.3934/bdia.2016.1.81

With the amount of data accumulated to tens of billions of scale, HBase, a distributed key-value database, plays a significant role in providing effective and high-throughput data service and management. However, for the applications involving spatio-temporal data, there is no good solution, due to inefficient query processing in HBase. In this paper, we propose spatiotemporal keyword searching problem for HBase, which is a meaningful issue in real life and a new challenge in this platform. To solve this problem, a novel access model for HBase is designed, containing row keys for indexing spatiotemporal dimensions and Bloom filters for fast detecting the existence of query keywords. And then, two algorithms for spatio-temporal keyword queries are developed, one is suitable for the queries with ordinary selectivity, the other is a parallel algorithm based on MapReduce aiming for the large range queries. We evaluate our algorithms on a real dataset, and the empirical results show that they are capable to handle spatio-temporal keyword queries efficiently.

Please supply your name and a valid email address you yourself

Fields marked*are required

Article URL   http://www.aimspress.com/BDIA/article/1991.html
Article ID   2380-6966_2016_1_81
Editorial Email  
Your Name *
Your Email *
Quantity *

Copyright © AIMS Press All Rights Reserved