Sciweavers

2210 search results - page 293 / 442
» Decision Support By Learning-On-Demand
Sort
View
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
15 years 10 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
15 years 10 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
15 years 10 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
IWMM
1998
Springer
130views Hardware» more  IWMM 1998»
15 years 10 months ago
Comparing Mostly-Copying and Mark-Sweep Conservative Collection
Many high-level language compilers generate C code and then invoke a C compiler for code generation. To date, most of these compilers link the resulting code against a conservativ...
Frederick Smith, J. Gregory Morrisett
PPOPP
1997
ACM
15 years 10 months ago
The Interaction of Parallel Programming Constructs and Coherence Protocols
Some of the most common parallel programming idioms include locks, barriers, and reduction operations. The interaction of these programming idioms with the multiprocessor's c...
Ricardo Bianchini, Enrique V. Carrera, Leonidas I....