Sciweavers

334 search results - page 38 / 67
» Distributed complex event processing with query rewriting
Sort
View
IPTPS
2005
Springer
14 years 2 months ago
Brushwood: Distributed Trees in Peer-to-Peer Systems
There is an increasing demand for locality-preserving distribution of complex data structures in peer-to-peer systems. Current systems either do not preserve object locality or su...
Chi Zhang, Arvind Krishnamurthy, Randolph Y. Wang
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
13 years 22 days ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...
PODC
2005
ACM
14 years 2 months ago
Routing complexity of faulty networks
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
ER
2001
Springer
136views Database» more  ER 2001»
14 years 1 months ago
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...
Dimitri Theodoratos, Theodore Dalamagas, Alkis Sim...
P2P
2005
IEEE
104views Communications» more  P2P 2005»
14 years 2 months ago
Range Queries in Trie-Structured Overlays
Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of...
Anwitaman Datta, Manfred Hauswirth, Renault John, ...