Answering Temporal Analytic Queries over Big Data Based on Precomputing Architecture
File version
Accepted Manuscript (AM)
Author(s)
Ren, Xuguang
Stantic, Bela
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Nguyen, NT
Tojo, S
Nguyen, LM
Trawinski, B
Date
Size
File type(s)
Location
License
Abstract
Big data explosion brings revolutionary changes to many aspects of our lives. Huge volume of data, along with its complexity poses big challenges to data analytic applications. Techniques proposed in data warehousing and online analytical processing (OLAP), such as precomputed multidimensional cubes, dramatically improve the response time of analytic queries based on relational databases. There are some recent works extending similar concepts into NoSQL such as constructing cubes from NoSQL stores and converting existing cubes into NoSQL stores. However, only few works are studying the precomputing structure deliberately within NoSQL databases. In this paper, we present an architecture for answering temporal analytic queries over big data by precomputing the results of granulated chunks of collections which are decomposed from the original large collection. By using the precomputing structure, we are able to answer the drill-down and roll-up temporal queries over large amount of data within reasonable response time.
Journal Title
Lecture Notes in Computer Science
Conference Title
Book Title
Edition
Volume
10191
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2017 Springer International Publishing AG. This is an electronic version of an article published in Lecture Notes In Computer Science (LNCS), Volume 10191, pp 281-290, 2017. Lecture Notes In Computer Science (LNCS) is available online at: http://link.springer.com// with the open URL of your article.
Item Access Status
Note
Access the data
Related item(s)
Subject
Other information and computing sciences not elsewhere classified