The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
View Materialization Over Big Data
|
|
Author(s): Akshay Kumar (Jawaharlal Nehru University, India)and T. V. Vijay Kumar (Jawaharlal Nehru University, India)
Copyright: 2021
Volume: 2
Issue: 1
Pages: 25
Source title:
International Journal of Data Analytics (IJDA)
Editor(s)-in-Chief: Bruce Qiang Swan (SUNY Buffalo State, USA)
DOI: 10.4018/IJDA.2021010103
Purchase
|
Abstract
Advances in technology have resulted in the generation of a large volume of heterogeneous big data for large enterprises engaged in e-commerce, healthcare, education, etc. This is being created at a rapid rate but is low in its veracity. This big data includes large sets of semi-structured and unstructured data and is stored over a distributed file system (DFS). This data can be processed in a fault tolerant manner using several frameworks, tools, and advanced database technologies. Big data can provide important information, which can be used for business decision making. View materialization, which has been widely studied for structured databases or data warehouse, has been extended to big data to enhance efficiency of big data query processing. This paper focuses on the selection of big data views for materialization. The big data views can be identified by extracting a set of query attributes from the set of query workload of an enterprise. The query attributes are interrelated resulting in the creation of alternate access paths for query evaluation. The cost of query processing using big data views involves the integrity of different data types of heterogeneous big data, frequency of queries, change in the size of big data, selected sets of big data materialized views, and updates on big data and these sets of materialized views. The cost of query processing is computed using the stored size of big data views on the DFS system, which is a consistent processing framework of DFS. A big data view selection algorithm that is capable of selecting views from structured, semi-structured, and unstructured data has been proposed in this paper. The proposed algorithm would select big data views that would result in faster processing of most user queries resulting in efficient decision making.
Related Content
|
.
© 2024.
|
|
.
© 2024.
|
|
Bilal Hungund, Shilpa Rastogi.
© 2023.
20 pages.
|
|
Richard S. Segall, Soichiro Takashashi.
© 2023.
31 pages.
|
|
Benjamin Ghansah, Ben-Bright Benuwa, Daniel Danso Essel, Andriana Pokuaa Sarkodie, Mathias Agbeko.
© 2022.
25 pages.
|
|
Muhammad Asif, Hassan Raza, Muhammad Imran Manzoor.
© 2022.
12 pages.
|
|
Osama A. Salman, Gábor Hosszú.
© 2022.
23 pages.
|
|
|