Sciweavers

607 search results - page 54 / 122
» Content-Based Routing: Different Plans for Different Data
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 2 days ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
OTM
2005
Springer
15 years 5 months ago
Location-Based Mobile Querying in Peer-to-Peer Networks
Peer-to-peer (P2P) networks are receiving increasing attention in a variety of current applications. In this paper, we concentrate on applications where a mobile user queries peers...
Michel Scholl, Marie Thilliez, Agnès Voisar...
SEKE
2005
Springer
15 years 5 months ago
Recovering Individual Accessing Behaviour from Web Logs
In this paper, we present a new view on the data preparation in web usage mining. We concentrate on recovering individual usage behaviour from accessing records on web site. We de...
Long Wang 0002, Christoph Meinel
IPTPS
2004
Springer
15 years 5 months ago
Comparing the Performance of Distributed Hash Tables Under Churn
A protocol for a distributed hash table (DHT) incurs communication costs to keep up with churn—changes in membership—in order to maintain its ability to route lookups efficie...
Jinyang Li, Jeremy Stribling, Thomer M. Gil, Rober...
ICC
2007
IEEE
15 years 6 months ago
Optimal Distributed Multicast Routing using Network Coding
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
Yi Cui, Yuan Xue, Klara Nahrstedt