Sciweavers

115 search results - page 6 / 23
» Benchmarking Spatial Data Warehouses
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 9 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
DOLAP
2004
ACM
14 years 1 months ago
Experimental evidence on partitioning in parallel data warehouses
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...
Pedro Furtado
JIB
2010
149views more  JIB 2010»
13 years 2 months ago
Visualization and Analysis of a Cardio Vascular Disease- and MUPP1-related Biological Network combining Text Mining and Data War
t techniques to create such a network associated with an abstract cell environment is discussed in order to gain insights into the functional as well as spatial interrelationships....
Björn Sommer, Evgeny S. Tiys, Benjamin Kormei...
DAWAK
2005
Springer
14 years 1 months ago
Efficient Compression of Text Attributes of Data Warehouse Dimensions
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
Jorge Vieira, Jorge Bernardino, Henrique Madeira
SBBD
2001
119views Database» more  SBBD 2001»
13 years 9 months ago
The Dimension-Join: A New Index for Data Warehouses
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
Pedro Bizarro, Henrique Madeira