Google Scholar

##plugins.themes.academic_pro.article.sidebar##

Published
Apr 25, 2015
Download
PDF
Statistic
Read Counter : 29 Download : 27

Downloads

Download data is not yet available.

##plugins.themes.academic_pro.article.main##

Abstract

In this paper we study update scheduling problem in streaming data warehouse, streaming data Warehouse combines the benefits of traditional data warehouses and data stream systems. In this problem jobs Corresponds to the processes which a load the new data in to the table, and main is aim is to minimize data staleness. Also it handle the challenges faced by streaming warehouse such as view hierarchies, preempt updates, data consistency and heterogeneity of update jobs caused by different arrival times and size of data. The scheduling metric is considered as staleness of data, we study the paper which explains how to schedule view updates in streams and transactions in soft real time database system, where two definitions of staleness are used one is MA (Maximum Age) and another is UU (unapplied Update). Four algorithms are examined for scheduling transactions And installing updates in soft real time database systems. Deadlines are very close To each other, SJF algorithm is used to schedule task within a group. Hence total execution time is minimized.

Keywords: about Ascendible quantizing, Data Stream management system, streaming data warehouse, QoD(Quality of Data),Strategy.

##plugins.themes.academic_pro.article.details##

Author Biographies

Subba Reddy, MLR Institute of Technology, Dundigal, Hyderabad, Telangana

Assistant Professor,  CSE Department

Vikram Shinde, MLR Institute of Technology, Dundigal, Hyderabad, Telangana

CSE Department
How to Cite
Reddy, S., & Shinde, V. (2015). Ascendible Quantizing of Streaming Data Warehouse. International Journal of Emerging Trends in Science and Technology, 2(04). Retrieved from http://igmpublication.org/ijetst.in/index.php/ijetst/article/view/649

References

1. Lukasz Golab, Theodore Johnson, and Vladislav Shkapenyuk,” “Scalable Scheduling of Updates in Streaming Data Warehouses”,”IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 24, NO. 6, JUNE 2012”
2. Li, Wenming, “Group-EDF - a new approach and an efficient non-preemptive algorithm for soft real-time systems”. Doctor of Philosophy (Computer Science), August 2006, 123 pp., 6
3. B. Adelberg, H. Garcia-Molina, and B. Kao, “Applying Update Streams in a Soft Real-Time Database System,” Proc. ACM SIGMOD Int’l Conf. Management of Data, pp. 245-256, 1995.
4. Qingchun Jiang, Sharma Chakravarthy,” Scheduling Strategies for a Data Stream Management System”.
5. M.H. Bateni, L. Golab, M.T. Hajiaghayi, and H. Karloff,“Scheduling to Minimize Staleness and Stretch in Real-timeData Warehouses,” Proc. 21st Ann. Symp. Parallelism inAlgorithms and Architectures (SPAA), pp. 29-38, 2009.
6. B. Babcock, S. Babu, M. Datar, and R. Motwani, “Chain:Operator Scheduling for Memory Minimization in DataStream Systems,” Proc. ACM SIGMOD Int’l Conf.Management of Data, pp. 253-264, 2003.tables, 49 illustrations, references, 48 titles.