Sciweavers

15317 search results - page 107 / 3064
» Globally Distributed Data
Sort
View
131
Voted
CCR
2006
117views more  CCR 2006»
15 years 4 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
SIGMOD
2010
ACM
184views Database» more  SIGMOD 2010»
15 years 9 months ago
Load-balanced query dissemination in privacy-aware online communities
We propose a novel privacy-preserving distributed infrastructure in which data resides only with the publishers owning it. The infrastructure disseminates user queries to publishe...
Emiran Curtmola, Alin Deutsch, K. K. Ramakrishnan,...
DOLAP
2004
ACM
15 years 9 months ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman
128
Voted
IPPS
2003
IEEE
15 years 9 months ago
Parallel ROLAP Data Cube Construction On Shared-Nothing Multiprocessors
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...
Ying Chen, Frank K. H. A. Dehne, Todd Eavis, Andre...
IOPADS
1997
152views more  IOPADS 1997»
15 years 5 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...