CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Query Processing in Distributed Data Warehouse using Proposed Dynamic Task Dependency Scheduling Algorithm

by S. Krishnaveni, M. Hemalatha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 55 - Number 8
Year of Publication: 2012
Authors: S. Krishnaveni, M. Hemalatha
10.5120/8774-2711

S. Krishnaveni, M. Hemalatha . Query Processing in Distributed Data Warehouse using Proposed Dynamic Task Dependency Scheduling Algorithm. International Journal of Computer Applications. 55, 8 ( October 2012), 16-22. DOI=10.5120/8774-2711

@article{ 10.5120/8774-2711,
author = { S. Krishnaveni, M. Hemalatha },
title = { Query Processing in Distributed Data Warehouse using Proposed Dynamic Task Dependency Scheduling Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { October 2012 },
volume = { 55 },
number = { 8 },
month = { October },
year = { 2012 },
issn = { 0975-8887 },
pages = { 16-22 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume55/number8/8774-2711/ },
doi = { 10.5120/8774-2711 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:57:40.741850+05:30
%A S. Krishnaveni
%A M. Hemalatha
%T Query Processing in Distributed Data Warehouse using Proposed Dynamic Task Dependency Scheduling Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 55
%N 8
%P 16-22
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A data warehouse is an electronic storage of huge amounts of data. It is also a system for retrieving and managing a data. In distributed data warehouse, data can be shared across multiple data repositories. Each may belong to one or more organizations. Query sorting is the problem of formatting the number of queries to be selected together. Reducing the usual completion period of a random order is a common concern. In this paper we propose Dynamic Task Dependency Scheduling (DTDS) Algorithm for query scheduling. Here our proposed algorithm takes the arrival time, size and also it considers the query dependency from the given query. It is also adaptable for all distributed data warehouse systems. Performance results show that the proposed algorithm gives less processing time and minimum query cost compared to others.

References
  1. Akinde, M. O. , Bhlen, M. H. , Johnson, T. , Lakshmanan, L. V. S. , Srivastava, D. , 2003. Efficient OLAP query processing in distributed data warehouses. Information Systems 28, 111-135.
  2. Tompkins, J. A. , White, J. A. , Bozer, Y. A. , Tanchoco, J. M. A. T. , 2003. Facilities Planning. John Wiley & Sons, New York, chap. 7, 432-444.
  3. Petersen, C. G. , 1997. An Evaluation of Order Picking Routing Policies. International Journal of Operations & Production Management 17 (11), 1098–1111.
  4. Raksha Sharma, Vishnu Kant Soni, Manoj Kumar Mishra, Prachet Bhuyan, 2010. A Survey of Job Scheduling and Resource Management in Grid Computing. World Academy of Science, Engineering and Technology 64, 461-466.
  5. Vijay Subramani, Rajkumar Kettimuthu, Srividya Srinivasan, Sadayappan, P. , 2002. Distributed Job Scheduling on Computational Grids using Multiple Simultaneous Requests. 11th IEEE International Symposium on High Performance Distributed Computing, 359-366.
  6. Claus Bitten, Joern Gehring, Uwe Schwiegelshohn, Ramin Yahyapour, 2000. The NRW-Metacomputer-Building Block for a Worldwide Computational Grid. 9th Heterogeneous Computing Workshop, 31-40.
  7. Carsten Ernemann, Volker Hamscher, Uwe Schwiegelshohn, Ramin Yahyapour, 2002. On Advantageous of Grid Computing for Parallel Job Scheduling. 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid, 39-46.
  8. Hongzhang Shan, Leonid Oliker, Rupak Biswas, 2003. Job Superscheduler Architecture and Performance in Computational Grid Environments. ACM/IEEE Conference on Supercomputing, 44-58.
  9. Santoso, J. , van Albada, G. D. , Nazief, B. A. A. , Sloot, P. M. A. , 2000. Hierarchical Job Scheduling for Clusters of Workstations. 6th Annual Conference of the Advanced School for Computing and Imaging, 99-105.
  10. Ng Wai Keat, Ang Tan Fong, Ling Teck Chaw, Liew Chee Sun, 2006. Scheduling Framework for Bandwidth-Aware Job Grouping-Based Scheduling in Grid Computing. Malaysian Journal of Computer Science 19 (2), 117-126.
  11. Homer Wu, Chong Yen Lee, Wuu Yee chen, Tsang Lee, 2007. A Job schedule Model Based on Grid Environment. 1st IEEE International Conference on Complex, Intelligent and Software Intensive System, 43-52.
  12. Somasundaram, K. , Radhakrishnan, S. , Gomathynayagam, M. , 2007. Efficient Utilization of Computing Resources using Highest Response Next Scheduling in Grid. Asian Journal of Information Technology 6 (5), 544-547.
  13. Diana Moise, Izabela Moise, Florin Pop, Valentin Cristea, 2008. Resource CoAllocation for Scheduling Tasks with Dependencies in Grid. International Workshop on High Performance in Grid Middleware, 41-48.
  14. Somasundaram, K. , Radhakrishnan, S. , 2008. Node Allocation in Grid Computing using Optimal Resource Constraint (ORC) Scheduling. International Journal of Computer Science and Network Security 8 (6), 309-313.
  15. Quan Liu, Yeqing Liao, 2009. Grouping-Based Fine-grained Job Scheduling in Grid Computing. 1st IEEE International Workshop on Education Technology and Computer Science, 556-559.
  16. Yeqing Liao, Quan Liu, 2009. Research on Fine-grained Job Scheduling in Grid Computing. International Journal of Information Engineering and Electronic Business, 9-16.
  17. Vishnu Kant Soni, Raksha Sharma, Manoj Kumar Mishra, 2010. Grouping-Based Job Scheduling Model in Grid Computing. World Academy of Science, Engineering and Technology 65, 781-784.
  18. Grace Mary Kanaga, E. , Valarmathi, M. L. , Juliet A Murali, 2010. Agent Based Patient Scheduling Using Heuristic Algorithm. International Journal on Computer Science and Engineering 2, 69-75.
  19. Roodbergen, K. J. , De Koster, R. , 2001. Routing Methods for Warehouses with Multiple Cross Aisles. International Journal of Production Research 39 (9), 1865–1883.
  20. Roodbergen, K. J. , 2001. Layout and Routing Methods for Warehouses. Ph. D. Thesis. Erasmus Research Institute of Management (ERIM), Erasmus University Rotterdam, The Netherlands.
  21. Chau, K. W. , Ying Cao, Anson, M. , Jianping Zhang, 2002. Application of Data Warehouse and Decision Support System in Construction Management. Automation in Construction 12 (2), 213-224.
  22. Gademann, N. , van de Velde, S. , 2005. Order Batching to Minimize Total Travel Time in a Parallel-Aisle Warehouse. IIE Transactions 37, 63-75.
  23. Tho Le-Duc, Rene´ M. B. M. de Koster, 2007. Travel Time Estimation and Order Batching in a 2-block Warehouse. European Journal of Operational Research 176, 374–388.
  24. Ali Allahverdi, Ng, C. T. , Cheng, T. C. E. , Mikhail Y. Kovalyov, 2008. A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research 187, 985–1032.
  25. Sheng Yuan Hsu, Liu, C. H. , 2009. Improving the Delivery Efficiency of the Customer Order Scheduling Problem in a Job Shop. Computers & Industrial Engineering 57, 856–866.
  26. Sebastian Henn, Gerhard Wäscher, 2012. Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems. European Journal of Operational Research, Accepted manuscript, 1-31.
Index Terms

Computer Science
Information Sciences

Keywords

Data Warehouse Random Scheduling (RS) Optimal Resource Constraints (ORC) Grouping based Fine-grained Job Scheduling (GFJS) Heuristic Algorithm (HA) Dynamic Task Dependency Scheduling (DTDS)

Powered by PhDFocusTM