Abstract | ||
---|---|---|
The need to process streaming data, which arrives continuously at high-volume in real-time, arises in a variety of contexts including data produced by experiments, collections of environmental or network sensors, and running simulations. Streaming data can also be formulated as queries or transactions which operate on a large dynamic data store, e.g. a distributed database. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1016/j.jpdc.2014.04.001 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Streaming data,Graph algorithms,Message passing,MPI,Sockets,MapReduce | Streaming algorithm,Computer science,Parallel computing,Models of communication,Dynamic data,Connected component,Distributed database,Analytics,Message passing,Distributed computing,Dense graph | Journal |
Volume | Issue | ISSN |
74 | 8 | 0743-7315 |
Citations | PageRank | References |
3 | 0.42 | 12 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Steven J. Plimpton | 1 | 264 | 22.82 |
Timothy M. Shead | 2 | 3 | 0.42 |