Sciweavers

1390 search results - page 104 / 278
» Self-Sizing of Clustered Databases
Sort
View
ICDE
2011
IEEE
217views Database» more  ICDE 2011»
14 years 5 months ago
Partitioning techniques for fine-grained indexing
— Many data-intensive websites use databases that grow much faster than the rate that users access the data. Such growing datasets lead to ever-increasing space and performance o...
Eugene Wu 0002, Samuel Madden
SIGMOD
1997
ACM
135views Database» more  SIGMOD 1997»
15 years 6 months ago
High-Performance Sorting on Networks of Workstations
We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sortin...
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau,...
VLDB
1997
ACM
103views Database» more  VLDB 1997»
15 years 6 months ago
Incremental Organization for Data Recording and Warehousing
Data warehouses and recording systems typically have a large continuous stream of incoming data, that must be stored in a manner suitable for future access. Access to stored recor...
H. V. Jagadish, P. P. S. Narayan, S. Seshadri, S. ...
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 5 months ago
Memory-Contention Responsive Hash Joins
In order to maximize systemperformancein environments with fluctuating memory contention, memory-intensive algorithms such as hash join must gracefully adapt to variations in avai...
Diane L. Davison, Goetz Graefe
SDM
2003
SIAM
183views Data Mining» more  SDM 2003»
15 years 3 months ago
ApproxMAP: Approximate Mining of Consensus Sequential Patterns
Conventional sequential pattern mining methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivi...
Hye-Chung Kum, Jian Pei, Wei Wang 0010, Dean Dunca...