Sciweavers

2020 search results - page 218 / 404
» Speeding up Slicing
Sort
View
HPCA
2006
IEEE
14 years 10 months ago
High performance file I/O for the Blue Gene/L supercomputer
Parallel I/O plays a crucial role for most data-intensive applications running on massively parallel systems like Blue Gene/L that provides the promise of delivering enormous comp...
Hao Yu, Ramendra K. Sahoo, C. Howson, G. Almasi, J...
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
14 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
VLDB
2002
ACM
157views Database» more  VLDB 2002»
14 years 10 months ago
A formal perspective on the view selection problem
The view selection problem is to choose a set of views to materialize over a database schema, such that the cost of evaluating a set of workload queries is minimized and such that ...
Rada Chirkova, Alon Y. Halevy, Dan Suciu
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 10 months ago
Efficient xml data dissemination with piggybacking
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
Chee Yong Chan, Yuan Ni
SIGMOD
2005
ACM
146views Database» more  SIGMOD 2005»
14 years 10 months ago
Predicate Result Range Caching for Continuous Queries
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
Matthew Denny, Michael J. Franklin