Sciweavers

586 search results - page 72 / 118
» From a Stream of Relational Queries to Distributed Stream Pr...
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
14 years 9 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
HPDC
2002
IEEE
14 years 1 months ago
Distributed Computing with Load-Managed Active Storage
One approach to high-performance processing of massive data sets is to incorporate computation into storage systems. Previous work has shown that this active storage model is effe...
Rajiv Wickremesinghe, Jeffrey S. Chase, Jeffrey Sc...
SIGOPS
2010
126views more  SIGOPS 2010»
13 years 7 months ago
Scaling a monitoring infrastructure for the Akamai network
We describe the design of, and experience with, Query, a monitoring system that supports the Akamai EdgePlatform. Query is a foundation of Akamai’s approach to administering its...
Thomas Repantis, Jeff Cohen, Scott Smith, Joel Wei...
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 9 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
ICDE
2007
IEEE
170views Database» more  ICDE 2007»
14 years 10 months ago
Tree-Pattern Similarity Estimation for Scalable Content-based Routing
With the advent of XML as the de facto language for data publishing and exchange, scalable distribution of XML data to large, dynamic populations of consumers remains an important...
Raphaël Chand, Pascal Felber, Minos N. Garofa...