DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. From the point of view of a data warehouse system its part of collecting and receiving information from other systems is crucial for all subsequent business intelligence ...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
To preserve private information while providing thorough analysis is one of the significant issues in OLAP systems. One of the challenges in it is to prevent inferring the sensitiv...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
In heterogeneous data warehousing environments, autonomous data sources are integrated into a materialized integrated database. The schemas of the data sources and the integrated ...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. Data warehouse architectural choices and optimization techniques are critical to decision support query performance. To facilitate these choices, the performance of the d...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when querie...
DAWAK
2005
Springer
14 years 5 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...