Sciweavers

2060 search results - page 198 / 412
» Performability Evaluation of Networked Storage Systems Using...
Sort
View
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
14 years 9 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
WWW
2008
ACM
14 years 10 months ago
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web
Easy reuse and integration of declaratively described information in a distributed setting is one of the main motivations for building the Semantic Web. Despite of this claim, reu...
Simon Schenk, Steffen Staab
ICS
2005
Tsinghua U.
14 years 2 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
SIGCOMM
2004
ACM
14 years 2 months ago
Vivaldi: a decentralized network coordinate system
Large-scale Internet applications can benefit from an ability to predict round-trip times to other hosts without having to contact them first. Explicit measurements are often un...
Frank Dabek, Russ Cox, M. Frans Kaashoek, Robert M...
AINA
2008
IEEE
14 years 3 months ago
Opportunistic Data Dissemination Using Real-World User Mobility Traces
— Opportunistic communication allows humans equipped with mobile devices to exchange information via a wireless link whenever they are nearby. This work examines the performance ...
Andreas Heinemann, Jussi Kangasharju, Max Müh...