Titlebook: Data Warehousing and Knowledge Discovery; 7th International Co A Min Tjoa,Juan Trujillo Conference proceedings 2005 Springer-Verlag Berlin

放縱

Nadia Magnenat-Thalmann,Daniel Thalmann.e. conceptual modelling), the more willing we are in achieving a data warehouse (DW) of a high quality. From our point of view, there is a lack of more objective indicators (metrics) to guide the designer in accomplishing an outstanding model that allows us to guarantee the quality of these data wa

泥土謙卑

讓步

Antoine Leclercq,S. Akkouche,E. GalinThis challenge is due to the several choices of partitioning star or snowflake schemas. Data partitioning is beneficial if and only if the fact table is fragmented based on the partitioning schemas of dimension tables. This may increase the number of fragments of the fact tables dramatically and mak

縮影

Martijn Kragtwijk,Anton Nijholt,Job Zwierstegrate data from distributed, heterogeneous data sources. Incrementally maintaining the integrated data is one of the problems being addressed in data warehousing research. This paper presents an incremental view maintenance approach based on schema transformation pathways. Our approach is not limi

重力

Antoine Leclercq,S. Akkouche,E. Galinat aim at leveraging the optimization capabilities of most RDBMSs. However, relational query languages like SQL are not expressive enough to specify an important class of data transformations that produce several output tuples for a single input tuple. This class of data transformations is required

Narcissist

胖人手藝好

https://doi.org/10.1007/978-3-7091-9435-5, when compared to the traditional data warehouses, the cost of view materialization is more expensive with respect to both computation and space. This is because the spatial data is typically larger in size, which leads to high maintenance cost, and the spatial operations are more expensive to proc

表主動(dòng)

General Animation and Simulation Platformis still a fully materialized data cube. In this paper, we present an improved structure PMC, which allow us to partially materialize cells in a QC-Trees. There is a sharp contrast between our partially materialization algorithm and other extensively studied materialized view selection algorithms. I

glowing

Ronen Barzel,John R. Hughes,Daniel N. Woodnly restricted to such applications but are also very useful in OLAP applications. In this paper, we introduce . queries in OLAP data cubes motivated by an online advertisement tracking data warehouse application. These queries aggregate information over a specified range and then return the ranked

CRUDE

Computer Animation and Simulation ’96ggregate list contains aggregates, calculated from the data stored in the database. In our approach, once created, the aggregates are materialized for further use. The list structure contains a table divided into pages. We present three different page-filling algorithms used when the list is browsed