91 search results - page 4 / 19 » Scalable computation of acyclic joins |
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
Most of the existing reachability indices perform well on small- to medium- size graphs, but reach a scalability bottleneck around one million vertices/edges. As graphs become inc...
JAVA
2001
Springer
14 years 1 days ago
2001
Springer
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
EUROPAR
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is...