THBase: A Coprocessor-Based Scheme for Big Trajectory Data Management

被引:11
|
作者
Qin, Jiwei [1 ]
Ma, Liangli [1 ]
Niu, Jinghua [1 ]
机构
[1] Naval Univ Engn, Coll Elect Engn, Wuhan 430033, Hubei, Peoples R China
来源
FUTURE INTERNET | 2019年 / 11卷 / 01期
基金
中国国家自然科学基金;
关键词
trajectory data; HBase; coprocessor; spatiotemporal query;
D O I
10.3390/fi11010010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The rapid development of distributed technology has made it possible to store and query massive trajectory data. As a result, a variety of schemes for big trajectory data management have been proposed. However, the factor of data transmission is not considered in most of these, resulting in a certain impact on query efficiency. In view of that, we present THBase, a coprocessor-based scheme for big trajectory data management in HBase. THBase introduces a segment-based data model and a moving-object-based partition model to solve massive trajectory data storage, and exploits a hybrid local secondary index structure based on Observer coprocessor to accelerate spatiotemporal queries. Furthermore, it adopts certain maintenance strategies to ensure the colocation of relevant data. Based on these, THBase designs node-locality-based parallel query algorithms by Endpoint coprocessor to reduce the overhead caused by data transmission, thus ensuring efficient query performance. Experiments on datasets of ship trajectory show that our schemes can significantly outperform other schemes.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] CSIndex: A Coprocessor-Based Classified Secondary Index Mechanism for Efficient HBase Query
    Zou, Zhe
    Zheng, Linjiang
    Xia, Dong
    Chen, Yiwei
    Liu, Weining
    Chen, Yixiong
    2019 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING (ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM 2019), 2019, : 897 - 904
  • [2] Analysis of Hospitalizing Behaviors Based on Big Trajectory Data
    Wang, Yongdong
    Xu, Dongwei
    Peng, Peng
    Xuan, Qi
    Zhang, Guijun
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2019, 6 (04) : 692 - 701
  • [3] Research on Index Mechanism of HBase Based on Coprocessor for Sensor Data
    Ye, Feng
    Zhu, Songjie
    Lou, Yuansheng
    Liu, Zihao
    Chen, Yong
    Huang, Qian
    2019 IEEE 43RD ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1, 2019, : 598 - 603
  • [4] Embedding an Extra Layer of Data Compression Scheme for Efficient Management of Big-Data
    Pal, Sayan
    Das, Indranil
    Majumder, Suvajit
    Gupta, Amit Kr.
    Bhattacharya, Indrajit
    INFORMATION SYSTEMS DESIGN AND INTELLIGENT APPLICATIONS, VOL 2, 2015, 340 : 699 - 708
  • [5] A Data Management System for Big Geospatial Data Based on Phoenix
    Chen M.
    Li L.
    Xie P.
    Fu S.
    He L.
    Zhou X.
    Li, Longhai (lhli@xidian.edu.cn), 1600, Editorial Board of Medical Journal of Wuhan University (45): : 719 - 727
  • [6] Personalized trajectory privacy data publishing scheme based on differential privacy
    Liu, Peiqian
    Wu, Duoduo
    Shen, Zihao
    Wang, Hui
    Liu, Kun
    INTERNET OF THINGS, 2024, 25
  • [7] Big Trajectory Data: A Survey of Applications and Services
    Kong, Xiangjie
    Li, Menglin
    Ma, Kai
    Tian, Kaiqi
    Wang, Mengyuan
    Ning, Zhaolong
    Xia, Feng
    IEEE ACCESS, 2018, 6 : 58295 - 58306
  • [8] MaritimeDS: a data service framework for unsupervised maritime traffic monitoring based on trajectory big data
    Yang X.
    Wang G.
    Gao J.
    Journal of Reliable Intelligent Environments, 2022, 8 (01) : 3 - 19
  • [9] The analysis of urban taxi operation efficiency based on GPS trajectory big data
    Dong, Xianlei
    Zhang, Min
    Zhang, Shuang
    Shen, Xinyi
    Hu, Beibei
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2019, 528
  • [10] A block coprocessor for user data rate improvements to GPRS coding scheme 4
    Sherratt, R. Simon
    Zhang, Kai
    Wilkes, Owen J.
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2007, 16 (04) : 541 - 551