Sciweavers

1675 search results - page 106 / 335
» Implementing Data Cubes Efficiently
Sort
View
TON
2002
86views more  TON 2002»
13 years 9 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar
DCC
2006
IEEE
14 years 9 months ago
Data Compression with Restricted Parsings
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
John T. Robinson, Luis Alfonso Lastras-Monta&ntild...
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 10 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...
CPAIOR
2008
Springer
13 years 12 months ago
Optimal Deployment of Eventually-Serializable Data Services
Abstract. Replication is a fundamental technique for increasing throughput and achieving fault tolerance in distributed data services. However, its implementation may induce signif...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
ICSE
2004
IEEE-ACM
14 years 10 months ago
A Hybrid Architectural Style for Distributed Parallel Processing of Generic Data Streams
Immersive, interactive applications grouped under the concept of Immersipresence require on-line processing and mixing of multimedia data streams and structures. One critical issu...
Alexandre R. J. François