Sciweavers

4085 search results - page 795 / 817
» Benchmarking Data Mining Algorithms
Sort
View
PLDI
2009
ACM
14 years 8 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
14 years 7 months ago
Column-stores vs. row-stores: how different are they really?
There has been a significant amount of excitement and recent work on column-oriented database systems ("column-stores"). These database systems have been shown to perfor...
Daniel J. Abadi, Samuel Madden, Nabil Hachem
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 7 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
DATE
2006
IEEE
84views Hardware» more  DATE 2006»
14 years 1 months ago
Vulnerability analysis of L2 cache elements to single event upsets
Memory elements are the most vulnerable system component to soft errors. Since memory elements in cache arrays consume a large fraction of the die in modern microprocessors, the p...
Hossein Asadi, Vilas Sridharan, Mehdi Baradaran Ta...
SIGMOD
1998
ACM
124views Database» more  SIGMOD 1998»
13 years 12 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