Sciweavers

12714 search results - page 232 / 2543
» Designing Data Warehouses
Sort
View
CODES
2000
IEEE
15 years 11 months ago
Storage requirement estimation for data intensive applications with partially fixed execution ordering
In this paper, we propose a novel storage requirement estimation methodology for use in the early system design phases when the data transfer ordering is only partly fixed. At tha...
Per Gunnar Kjeldsberg, Francky Catthoor, Einar J. ...
ER
1998
Springer
127views Database» more  ER 1998»
15 years 11 months ago
Rumor: Mobile Data Access Through Optimistic Peer-to-Peer Replication
1 Rumor is an optimistically replicated le system designed for use in mobile computers. Rumor uses a peer model that allows opportunistic update propagation among any sites replica...
Richard G. Guy, Peter L. Reiher, David Ratner, Mic...
ICDE
2007
IEEE
105views Database» more  ICDE 2007»
16 years 8 months ago
Oscar: A Data-Oriented Overlay For Heterogeneous Environments
Quite a few data-oriented overlay networks have been designed in recent years. These designs often (implicitly) assume various homogeneity which seriously limit their usability in...
Sarunas Girdzijauskas, Anwitaman Datta, Karl Abere...
HIPEAC
2007
Springer
16 years 1 months ago
Leveraging High Performance Data Cache Techniques to Save Power in Embedded Systems
Voltage scaling reduces leakage power for cache lines unlikely to be referenced soon. Partitioning reduces dynamic power via smaller, specialized structures. We combine approaches,...
Major Bhadauria, Sally A. McKee, Karan Singh, Gary...
PATMOS
2004
Springer
16 years 17 days ago
Delay Evaluation of High Speed Data-Path Circuits Based on Threshold Logic
The main result is the development, and delay comparison based on Logical Effort, of a number of high speed circuits for common arithmetic and related operations using threshold l...
Peter Celinski, Derek Abbott, Sorin Cotofana