A data warehouse stores lots of materialized views to provide an efficient decision-support or OLAP queries. The view-selection problem addresses to select a fittest set of materialized views from a variety of MVPPs (Yang, 1997) forms a challenge in data warehouse research. In this paper, we present genetic algorithm to choose materialized views. We also use experiments to demonstrate the power...

introduction: cleaner productions in textile industry is achieved by reducing water and chemicals’ consumption, saving energy, reducing production of air pollution and solid wastes, reducing toxicity and noise pollution through many solutions. the purpose of the present research was to apply strengths, weaknesses, opportunities, threats (swot) and quality systems planning matrix (qspm) techniqu...

Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...

Many studies focus on inventory systems to analyze different real-world situations. This paper considers a two-echelon supply chain that includes one warehouse and one retailer with stochastic demand and an up-to-level policy. The retailer’s lead time includes the transportation time from the warehouse to the retailer that is unknown to the retailer. On the other hand, the warehouse is unaware ...

A finite time horizon inventory problem for a deteriorating item having two separate warehouses, one is a own warehouse (OW) of finite dimension and other a rented warehouse (RW), is developed with interval-valued lead-time under inflation and time value of money. Due to different preserving facilities and storage environment, inventory holding cost is considered to be different in different wa...

In this paper, we introduce the Steiner Bi-objective Shortest Path Problem. This problem is defined on a directed graph G=(V,A), with subset T?V of terminals. Arcs are labeled travel time and cost. The goal to find complete set efficient paths between every pair nodes in T. motivation behind stems from data preprocessing for vehicle routing problems. We propose solution method based labeling ap...

Often corporations need tools that increase the power of decisions in a competitive market. Facing that, several companies does not have resources to buy the commercial systems because of the high costs. This problem can be extended to other segments like government and universities. This work is dedicated to a feasibility study of a low cost platform to data warehouse to supply these customers...

Four workers at a seed supply warehouse in Chiba Prefecture, Japan, complained of ocular irritation on the job. Pesticide-coated seeds were stored in the warehouse but no significant amount of pesticide was detected in the air inside the warehouse. To identify the cause of the ocular irritation and to determine an appropriate solution to the problem, the authors used thermal desorption gas chro...

Since the requirement of data warehouse is increasing, it is necessary to develop eflcient mechanisms for data warehouses incorporating various kinds of database systems. Essentially, materialized views are used for data warehouses and various methods for relational databases have been developed. In this paper, we will first discuss a method to realize materialized views for object-on’ented dat...