【24h】

Efficient and Timely Querying of Massive Trajectory Data in Internet of Vehicles

机译:车联网中海量轨迹数据的高效及时查询

获取原文
获取原文并翻译 | 示例

摘要

The Internet of Vehicles (IoV) has become an indispensable part of a smart city, which can provide useful traffic information to supervise and guide drivers in metropolis. However, as the traffic data scales to a great volume, it becomes difficult for conventional database management tools to meet the requirement of massive data analysis. HBase is an open source, non-relational, distributed database running on top of Hadoop Distributed File System (HDFS). It can solve the problems in massive data querying that an IoV system faces nowadays. In this paper, we propose a massive traffic data querying solution using HBase to analyze the data collected in practice. In this solution, we firstly preprocess the original data and then propose a schema for the HBase table, especially a row key structure design to storage data effectively. Based on the schema, several querying patterns are designed to realize various functions that are meaningful in IoV applications. The performance of the proposed row key design is compared with the strategy without row key design on an experimental evaluation, and the results show that the proposed schema has a promising performance in time consumption.
机译:车联网(IoV)已成为智慧城市不可或缺的一部分,它可以提供有用的交通信息来监督和指导大都市中的驾驶员。但是,随着交通数据规模的扩大,传统的数据库管理工具很难满足海量数据分析的需求。 HBase是运行在Hadoop分布式文件系统(HDFS)之上的开源,非关系,分布式数据库。它可以解决当今IoV系统面临的海量数据查询问题。在本文中,我们提出了一种使用HBase的大规模交通数据查询解决方案,以分析实际收集的数据。在该解决方案中,我们首先对原始数据进行预处理,然后为HBase表提出一个架构,尤其是行键结构设计以有效地存储数据。基于该模式,设计了几种查询模式以实现在IoV应用程序中有意义的各种功能。在实验评估中,将所提出的行密钥设计的性能与没有行密钥设计的策略进行了比较,结果表明,所提出的模式在时间消耗方面具有良好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号