Sciweavers

2463 search results - page 349 / 493
» Compressing Pattern Databases
Sort
View
VLDB
2004
ACM
92views Database» more  VLDB 2004»
14 years 3 months ago
Write-Optimized B-Trees
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
Goetz Graefe
DOLAP
2003
ACM
14 years 3 months ago
Hierarchical dwarfs for the rollup cube
The data cube operator exemplifies two of the most important aspects of OLAP queries: aggregation and dimension hierarchies. In earlier work we presented Dwarf, a highly compress...
Yannis Sismanis, Antonios Deligiannakis, Yannis Ko...
WEBDB
2010
Springer
173views Database» more  WEBDB 2010»
14 years 3 months ago
Manimal: Relational Optimization for Data-Intensive Programs
The MapReduce distributed programming framework is very popular, but currently lacks the optimization techniques that have been standard with relational database systems for many ...
Michael J. Cafarella, Christopher Ré
SIGMOD
1998
ACM
124views Database» more  SIGMOD 1998»
14 years 2 months ago
An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees
The Relational On-Line Analytical Processing (ROLAP) is emerging as thedominant approach in data warehousing with decision support applications. In order to enhance query performa...
Yannis Kotidis, Nick Roussopoulos
SIGMOD
1997
ACM
172views Database» more  SIGMOD 1997»
14 years 2 months ago
An Array-Based Algorithm for Simultaneous Multidimensional Aggregates
Computing multiple related group-bys and aggregates is one of the core operations of On-Line Analytical Processing (OLAP) applications. Recently, Gray et al. [GBLP95] proposed the...
Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton