Sciweavers

213 search results - page 27 / 43
» Parallel Evaluation of Multi-Join Queries
Sort
View
DEBS
2009
ACM
14 years 2 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...
CCGRID
2002
IEEE
14 years 15 days ago
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
Peer-to-peer computing and networking, an emerging model of communication and computation, has recently started to gain significant acceptance. This model not only enables client...
Evangelos P. Markatos
VLDB
2007
ACM
166views Database» more  VLDB 2007»
14 years 1 months ago
To Share or Not To Share?
Intuitively, aggressive work sharing among concurrent queries in a database system should always improve performance by eliminating redundant computation or data accesses. We show...
Ryan Johnson, Nikos Hardavellas, Ippokratis Pandis...
HPDC
2010
IEEE
13 years 8 months ago
Distributing the power of OLAP
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
14 years 10 days ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta