Sciweavers

110 search results - page 3 / 22
» Maintaining Data Cubes under Dimension Updates
Sort
View
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
14 years 5 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
13 years 12 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
IPPS
2003
IEEE
13 years 10 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
MMS
2006
13 years 5 months ago
Update Relevance under the Multiset Semantics of RDBMS
: In order to reduce transmission costs and response time, mobile clients typically cache data locally. But, avoiding the usage of outdated data and maintaining the consistency of ...
Hagen Höpfner
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 6 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...