Various models and approaches have been proposed for mapping XML data into relational tables recently.

presents interesting challenges. LegoDB is a cost-based XML-to-relational mapping engine that addresses this problem. It explores a space of possible mappings and selects the best mapping for a given application (defined by an XML Schema, XML data statistics, and an XML query workload). LegoDB leverages

to select an appropriate set of materialized views and indices, which minimizes total query response time, given a limited storage space. A judicious choice in this selection must be cost-driven and based on a workload which represents a set of users ' queries on the data warehouse. In this chapter, we

The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that the views t into a prespeci ed storage constraint. The two main applications of the view selection problem

and robust estimates can be achieved, with limited space, and at a miniscule computational cost. These techniques have been implemented in the context of the TIMBER native XML database [22] at the University of Michigan. 1

We present a new, automated approach to selecting the cloud storage service that best matches each dataset of a given application. Our approach relies on a machine readable description of the capabilities (features, performance, cost, etc.) of each storage system, which is processed together

Abstract: This paper presents the design of DataCube, a P2P data persistent platform. This platform exploits the properties of cluster-based peer-to-peer structured overlays altogether with a hybrid redundancy schema (a compound of light replication and rateless erasure coding) to guarantee durable

, a user behavior in the mobile environments should be considered. In another aspect of web data uses, we are often connecting to the web with the wired broadband networks. Before traveling with the mobile devices that are limited in the storage space and the power, carrying out the web data

that under these conditions, firms will enter the market until prices are driven down to "zero economic rents in the long run," meaning that accounting profits will only be enough to cover the cost of capital. We say that "new entrants compete away any economic rents," and that the number

an available storage structure that most closely provides the desired access characteristics. We use explicit replication of schema objects to reduce the access cost along certain paths, and analyze the trade-offs between increased update overhead and improved retrieval access. Finally, we give an algorithm