Subject Oriented Data Partitioning – A Proposed Data Warehousing Schema

Goal: Load balancing policies often map workloads on virtual machines, and are being sought to achieve their goals by creating an almost equal level of workload on any virtual machine. In this research, a hybrid load balancing algorithm is proposed with the aim of reducing response time and processing time.
 Design / Methodology / Approach: The proposed algorithm performs load balancing using a table including the status indicators of virtual machines and the task list allocated to each virtual machine. The evaluation results of response time and processing time in data centers from four algorithms, ESCE, Throttled, Round Robin and the proposed algorithm is done.
 Results: The overall response time and data processing time in the proposed algorithm data center are shorter than other algorithms and improve the response time and data processing time in the data center. The results of the overall response time for all algorithms show that the response time of the proposed algorithm is 12.28%, compared to the Round Robin algorithm, 9.1% compared to the Throttled algorithm, and 4.86% of the ESCE algorithm.
 Limitations of the investigation: Due to time and technical limitations, load balancing has not been achieved with more goals, such as lowering costs and increasing productivity.
 Practical implications: The implementation of a hybrid load factor policy can improve the response time and processing time. The use of load balancing will cause the traffic load between virtual machines to be properly distributed and prevent bottlenecks. This will be effective in increasing customer responsiveness. And finally, improving response time increases the satisfaction of cloud users and increases the productivity of computing resources.
 Originality/Value: This research can be effective in optimizing the existing algorithms and will take a step towards further research in this regard.

One of the important aspects in management and acceleration of processes, operations in databases and data warehouses is ETL processes, the process of extracting, transforming and loading data. These processes without optimizing, a realization data warehouse project is costly, complex, and time-consuming. This paper provides an overview and research of methods for optimizing the performance of ETL processes; that the most important indicator of ETL system's operation is the time and speed of data processing is shown. The issues of the generalized structure of ETL process flows are considered, the architecture of ETL process optimization is proposed, and the main methods of parallel data processing in ETL systems are presented, those methods can improve its performance. The most relevant today of the problem is performance of ETL processes for data warehouses is considered in detail.

A company, majorly company that active in commercial (profit orientation) need to analyze their sales performance. By analyzing sales performance, company can increase their sales performance. One of method to analyze sales performance is by collecting historical data that relates to sales and then process that data so that produce information that show company sales performance. A data warehouse is a set of data that has characteristic subject oriented, time variant, integrated, and nonvolatile that help company management in processing of decision making. Design of data warehouse is started from collecting data that relate to sales such as product, customer, sales area, sales transaction, etc. After collecting the data, next is data extraction and transformation. Data extraction is a process f or selecting data that will be loaded into data warehouse. Data transformation is making some change to the data afte r extracted to be more consistent. After transformation processing, data are loaded into data warehouse. Data in data warehouse is processed by OLAP (On Line Analytical Processing) to produce information. Information that are produced from data processing by OLAP are chart and query reporting. Chart reporting are sales chart based on cement type, sales chart based on sales area, sales chart based on plant, monthly and year ly sales chart, and chart based on customer feedback. Query reporting are sales based on cement type, sales area, plant and customer. Keywords: Data warehouse; OLAP; Sales performance analysis; Ready mix market

Research in data warehousing and OLAP has produced important technologies for the design, management and use of information systems for decision support. Much of the interest and success in this area can be attributed to the need for software and tools to improve data management and analysis given the large amounts of information that are being accumulated in corporate as well as scientific databases.However, even though the high maturity of these technologies, new data needs or applications currently run at companies not only demand more capacity, but also new methods, models, techniques or architectures to satisfy these new needs. Some of the hot topics in data warehouses (DWs) include distributed DWs, advanced OLAP for business intelligence, web warehouses, DWs for new applications such as XML documents, stream data, spatial or GIS data or biomedical data. Moreover, there are other aspects very developed in other software areas such as security or quality, which still remain uncovered by current design methods or technologies for DWs.Like the previous successful DOLAP workshops held in conjunction with CIKMs, the eighth edition of the Workshop on Data Warehousing and OLAP (DOLAP'05) aims to synergistically connect the research community and industry practitioners. It provides an international forum where both researchers and practitioners can share their findings in theoretical foundations, current methodologies, and practical experiences. This year, DOLAP'05 will be specially focused on new research directions and emerging application domains in the areas of data warehousing and OLAP.This year, we received papers from 18 different countries distributed over all continents such as The Netherlands, France, Spain, Israel, Korea, USA, Canada and Argentine. We received 31 submissions and, after a careful review, only 12 papers were selected by the Program Committee, making an acceptance rate of 38.7%.These proceedings contain the papers selected for presentation at the workshop. The accepted papers were presented in 5 sessions: (i) querying OLAP databases, (ii) data warehouse models, (iii, iv) data warehouse design, and (v) query processing and view maintenance. A keynote address was given by Jens Lechtenburger on Schema transformations. We hope that these proceedings will serve as a valuable reference for data warehousing and OLAP researchers and practitioners.

Cloud computing provides distributed computing resources such as servers, storage and applications to the end users through data centers. The data centers are geographically located at different locations. The client applications or requests being serviced by cloud service providers on “pay per use”. So, different pricing models are adapted to compute the cost and revenue of the data centers. The cost of VM is computed depending on its placement in the data centers through broker policies. So, the broker policies have a significant role in evaluating the cost of the VM which directly impacts on revenue of the service provider. In the computing competition, the VM cost should be minimized by which service demand will be maximized. Moreover, the response time and processing time of the data centers need to be minimized to posses commendatory Quality of Service. In this work, we propose a new service broker policy to minimize the total cost. The total cost considers the VM cost and the data transfer cost. The proposed mechanism also reduces the response time and data processing time of the data centers. The proposed policy is simulated in Cloud Analyst. We examine the performance of the proposed mechanism with ten different scenarios. Finally, we compare performance results with respect to VM cost, data transfer cost, total cost, processing time and response time of data centers with the existing policies and observe better than these.

Data warehousing accounts for a significant fraction of database use today. As XML becomes ever more popular, more and more XML data finds its way into data warehouse repositories. This paper examines the modeling mismatch between the tree structure of XML data model and the multidimensional model of a typical data warehouse, and proposes an XML warehouse model based on the multi-colored trees (MCT) logical data model that resolves the modeling issue naturally. Furthermore, this data model ameliorates some well-known modeling limitations of the XML data warehouse. To cope with ad-hoc OLAP queries, we extend bit-map join indices to the XML context. We then tackle the difference between the bit-map and the stack-based structural join processing paradigm popular in XML query processing, permitting both styles of query processing to be used seamlessly in consort to evaluate queries. We demonstrate experimentally the benefit of bit-map join indices for typical queries, and particularly those with low cardinality or high selectivity.

The Extract-Transform-Load (ETL) process in data warehousing involves extracting data from source databases, transforming it into a form suitable for research and analysis, and loading it into a data warehouse. ETL processes can use complex transformations involving sources and targets that use different schemas, databases, and technologies, which make ETL implementations fault-prone. In this paper, we present an approach for validating ETL processes using automated balancing tests that check for various types of discrepancies between the source and target data. We formalize three categories of properties, namely, completeness, consistency, and syntactic validity that must be checked during testing. Our approach uses the rules provided in the ETL specifications to generate source-to-target mappings, from which balancing test assertions are generated for each property. We evaluated the approach on a real-world health data warehouse project and revealed 11 previously undetected faults. Using mutation analysis, we demonstrated that our auto-generated assertions can detect faults in the data inside the target data warehouse.

Development of a Dashboard to Improve Safety in the Imaging Setting

The availability of large-scale multitasked parallel architectures introduces the following processor assignment problem. We are given a long sequence of data sets, each of which is to undergo processing by a collection of tasks whose intertask data dependencies form a series-parallel partial order. Each individual task is potentially parallelizable, with a known experimentally determined execution signature. Recognizing that data sets can be pipelined through the task structure, the problem is to find a "good" assignment of processors to tasks. Two objectives interest us: minimal response time per data set, given a throughput requirement, and maximal throughput, given a response time requirement. Our approach is to decompose a series-parallel task system into its essential "serial" and "parallel" components; our problem admits the independent solution and recomposition of each such component. We provide algorithms for the series analysis, and use an algorithm due to Krishnamurti and Ma for the parallel analysis. For a p processor system and a series-parallel precedence graph with n constituent tasks, we give a O(np/sup 2/) algorithm that finds the optimal assignment (over a broad class of assignments) for the response time optimization problem; we find the assignment optimizing the constrained throughput in O(np/sup 2/ log p) time. These techniques are applied to a task system in computer vision.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Progressive online aggregation in a distributed stream system

Introduction to special issue on selected papers from IFIP networking conference 2022

Efficient utilization of resources is one of the reasons of popularity of semantic cache. The authors presented detailed survey with comprehensive criteria for efficient query processing. The criteria include size of data, retrieval time, and processing time of data. The size of data directly effects the retrieval time as well as the processing time. Processing and retrieval time are also dependent upon the faster semantic content matching process. The listed results identify the weaknesses in the existing caching techniques of query processing on the basis of defined criteria.

Objectives: To enlighten the issues and challenges of Load Balancing Algorithm (LBA) for cloud computing environment. In this study the authors proposed a LBA for cloud computing server. Methods/Statistical Analysis: The numerous LBAs are compared with objective, merit, demerit and challenges of the LBA in terms of parameters such as performance, response time, scalability, overhead and many more. This study facilitates identification of efficient LBA for optimizes resource use, minimum response time, maximum throughput and avoidance of overload. Findings: The load balancer is permitted in most instances to provide support continuity as well as dealing with extra traffic. Consequently the useful load balancing algorithms required to find inexpensive resource usage by provisioning of resources to cloud users. The use of proposed algorithm is to improve the overhead and load imbalance factor of the system. Application: The Load Balancing (LB) is a vital feature of cloud computing environment. The economical LB algorithm assures cost effective resource usage by provisioning of resources to cloud users on demand schedule in pay-as-you-say-manner. The LB may actually provide assistance prioritizing users by using suitable scheduling requirements and also it is crucial part in cloud computing for maintaining the work load across various systems over the network and gives minimum processing time, minimum response time and ignores the workload.

Large amounts of data are generated daily, according to the wide usage of social media websites and scientific data. These data need to be stored and analyzed to help decision makers but the traditional database concepts are insufficient. Data warehouse and OLAP are useful technologies in the storage and analysis of big data. Using MapReduce will help to save processing time, using cloud computing will help in saving resources and storage. In this paper, we propose a system that integrates the OLAP and MapReduce over cloud (considering workload balance) in order to enhance the performance of query processing over big data. The proposed system is applied to large amounts of data stored in cubes located in a Peer-to-peer cloud; this process is done using an allocation approach to save resources and query processing times. The proposed system achieves enhancements as time saving in query processing and in resources usage.

To integrate various Linked Datasets, data warehousing and live query processing provide two extremes for optimized response time and quality respectively. The first approach provides very fast responses but with low-quality because changes of original data are not immediately reflected on materialized data. The second approach provides accurate responses but it is notorious for long response times. A hybrid SPARQL query processor provides a middle ground between two specified extremes by splitting the triple patterns of SPARQL query between live and local processors based on a predetermined coherence threshold specified by the administrator. Considering quality requirements while splitting the SPARQL query, enables the processor to eliminate the unnecessary live execution and releases resources for other queries. This requires estimating the quality of response provided with current materialized data, compare it with user requirements and determine the most selective sub-queries which can boost the response quality up to the specified level with least computational complexity. In this work, we propose solutions for estimating the freshness of materialized data, as one dimension of the quality, by extending cardinality estimation techniques. Experimental results show that we can estimate the freshness of materialized data with a low error rate.KeywordsFreshness estimationHybrid SPARQL QueryingRDF Data WarehouseView Materialization