scholarly journals A Method of HBase Multi-Conditional Query for Ubiquitous Sensing Applications

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3064 ◽  
Author(s):  
Bo Shen ◽  
Yi-Chen Liao ◽  
Dan Liu ◽  
Han-Chieh Chao
Keyword(s):  
Big Data ◽  
Relational Databases ◽  
Computational Cost ◽  
Public Infrastructure ◽  
Space Filling Curve ◽  
Ubiquitous Sensing ◽  
Sensing Applications ◽  
Secondary Index ◽  
Linear Index ◽  
Filling Curve

Big data gathered from real systems, such as public infrastructure, healthcare, smart homes, industries, and so on, by sensor networks contain enormous value, and need to be mined deeply, which depends on a data storing and retrieving service. HBase is playing an increasingly important part in the big data environment since it provides a flexible pattern for storing extremely large amounts of unstructured data. Despite the fast-speed reading by RowKey, HBase does not natively support multi-conditional query, which is a common demand and operation in relational databases, especially for data analysis of ubiquitous sensing applications. In this paper, we introduce a method to construct a linear index by employing a Hilbert space-filling curve. As a RowKey generating schema, the proposed method maps multiple index-columns into a one-dimensional encoded sequence, and then constructs a new RowKey. We also provide a R-tree-based optimization to reduce the computational cost of encoding query conditions. Without using a secondary index mode, experimental results indicate that the proposed method has better performance in multi-conditional queries.

scholarly journals COMPARISON OF SPATIOTEMPORAL MAPPING TECHNIQUES FOR ENORMOUS ETL AND EXPLOITATION PATTERNS

2017 ◽  
Vol IV-4/W2 ◽  
pp. 7-13
Author(s):  
R. Deiotte ◽  
R. La Valley
Keyword(s):  
Spatial Data ◽  
Computational Cost ◽  
Spatiotemporal Data ◽  
Data Sets ◽  
Space Filling ◽  
Space Filling Curve ◽  
Spatiotemporal Mapping ◽  
Advantages And Disadvantages ◽  
Mapping Techniques ◽  
Filling Curve

The need to extract, transform, and exploit enormous volumes of spatiotemporal data has exploded with the rise of social media, advanced military sensors, wearables, automotive tracking, etc. However, current methods of spatiotemporal encoding and exploitation simultaneously limit the use of that information and increase computing complexity. Current spatiotemporal encoding methods from Niemeyer and Usher rely on a Z-order space filling curve, a relative of Peano’s 1890 space filling curve, for spatial hashing and interleaving temporal hashes to generate a spatiotemporal encoding. However, there exist other space-filling curves, and that provide different manifold coverings that could promote better hashing techniques for spatial data and have the potential to map spatiotemporal data without interleaving. The concatenation of Niemeyer’s and Usher’s techniques provide a highly efficient space-time index. However, other methods have advantages and disadvantages regarding computational cost, efficiency, and utility. This paper explores the several methods using a range of sizes of data sets from 1K to 10M observations and provides a comparison of the methods.

Region of Interest Based MRI Brain Image Compression Using Peano Space Filling Curve

2016 ◽  
Vol 11 (2) ◽  
pp. 114-120 ◽  
Author(s):  
C. Peter Devadoss ◽  
Balasubramanian Sankaragomathi ◽  
Thirugnanasambantham Monica
Keyword(s):  
Image Compression ◽  
Region Of Interest ◽  
Space Filling ◽  
Brain Image ◽  
Space Filling Curve ◽  
Mri Brain ◽  
Filling Curve ◽  
Mri Brain Image

A Space Filling Curve

1983 ◽  
Vol 90 (4) ◽  
pp. 283
Author(s):  
Liu Wen
Keyword(s):  
Space Filling ◽  
Space Filling Curve ◽  
Filling Curve

Formalizing the Mapping of UML Conceptual Schemas to Column-Oriented Databases

2018 ◽  
Vol 14 (3) ◽  
pp. 44-68 ◽  
Author(s):  
Fatma Abdelhedi ◽  
Amal Ait Brahim ◽  
Gilles Zurfluh
Keyword(s):  
Big Data ◽  
Data Warehouse ◽  
Relational Databases ◽  
Traditional Approach ◽  
Physical Models ◽  
Decision Making Process ◽  
Nosql Databases ◽  
Care Field ◽  
Sufficient Degree

Nowadays, most organizations need to improve their decision-making process using Big Data. To achieve this, they have to store Big Data, perform an analysis, and transform the results into useful and valuable information. To perform this, it's necessary to deal with new challenges in designing and creating data warehouse. Traditionally, creating a data warehouse followed well-governed process based on relational databases. The influence of Big Data challenged this traditional approach primarily due to the changing nature of data. As a result, using NoSQL databases has become a necessity to handle Big Data challenges. In this article, the authors show how to create a data warehouse on NoSQL systems. They propose the Object2NoSQL process that generates column-oriented physical models starting from a UML conceptual model. To ensure efficient automatic transformation, they propose a logical model that exhibits a sufficient degree of independence so as to enable its mapping to one or more column-oriented platforms. The authors provide experiments of their approach using a case study in the health care field.

Sign in / Sign up

Export Citation Format

Share Document