DocumentCode :
2210818
Title :
MD-HBase: A Scalable Multi-dimensional Data Infrastructure for Location Aware Services
Author :
Nishimura, Shoji ; Das, Sudipto ; Agrawal, Divyakant ; Abbadi, A.E.
Author_Institution :
Service Platforms Res. Labs., NEC Corp., Kawasaki, Japan
Volume :
1
fYear :
2011
fDate :
6-9 June 2011
Firstpage :
7
Lastpage :
16
Abstract :
The ubiquity of location enabled devices has resulted in a wide proliferation of location based applications and services. To handle the growing scale, database management systems driving such location based services (LBS) must cope with high insert rates for location updates of millions of devices, while supporting efficient real-time analysis on latest location. Traditional DBMSs, equipped with multi-dimensional index structures, can efficiently handle spatio-temporal data. However, popular open source relational database systems are overwhelmed by the high insertion rates, real-time querying requirements, and terabytes of data that these systems must handle. On the other hand, Key-value stores can effectively support large scale operation, but do not natively support multi-attribute accesses needed to support the rich querying functionality essential for the LBSs. We present MD-HBase, a scalable data management system for LBSs that bridges this gap between scale and functionality. Our approach leverages a multi-dimensional index structure layered over a Key-value store. The underlying Key-value store allows the system to sustain high insert throughput and large data volumes, while ensuring fault-tolerance, and high availability. On the other hand, the index layer allows efficient multi-dimensional query processing. We present the design of MD-HBase that builds two standard index structures-the K-d tree and the Quad tree-over a range partitioned Key-value store. Our prototype implementation using HBase, a standard open-source Key-value store, can handle hundreds of thousands of inserts per second using a modest 16 node cluster, while efficiently processing multidimensional range queries and nearest neighbor queries in real-time with response times as low as hundreds of milliseconds.
Keywords :
data analysis; fault tolerant computing; mobile computing; public domain software; query processing; relational databases; spatiotemporal phenomena; storage management; tree data structures; DBMS; K-d tree; LBS; MP-HBase; database management systems; fault tolerance; key value store; location aware services; multiattribute access; multidimensional index structures; multidimensional query processing; nearest neighbor queries; open source relational database; quad tree; real-time analysis; real-time querying requirements; scalable data management system; spatiotemporal data; ubiquitous computing; Indexing; Memory; Nearest neighbor searches; Query processing; Real time systems; Throughput; key value stores; location based services; multidimensional data; real time analysis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mobile Data Management (MDM), 2011 12th IEEE International Conference on
Conference_Location :
Lulea
Print_ISBN :
978-1-4577-0581-6
Electronic_ISBN :
978-0-7695-4436-6
Type :
conf
DOI :
10.1109/MDM.2011.41
Filename :
6068416
Link To Document :
بازگشت