High probability parallel transitive-closure algorithms
SIAM Journal on Computing
A lower bound for the nondeterministic space complexity of context-free recognition
Information Processing Letters
Monotone separation of logarithmic space from logarithmic depth
Journal of Computer and System Sciences
Communication complexity
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
External memory algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Fast, small-space algorithms for approximate histogram maintenance
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Reductions in streaming algorithms, with an application to counting triangles in graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Mathematics for the Analysis of Algorithms
Mathematics for the Analysis of Algorithms
Introduction to Algorithms
An Approximate L1-Difference Algorithm for Massive Data Streams
SIAM Journal on Computing
Fully dynamic biconnectivity and transitive closure
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Efficient algorithms for new computational models
Efficient algorithms for new computational models
On the Streaming Model Augmented with a Sorting Primitive
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Graph distances in the streaming model: the value of space
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tribeca: a system for managing large databases of network traffic
ATEC '98 Proceedings of the annual conference on USENIX Annual Technical Conference
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Link analysis for Web spam detection
ACM Transactions on the Web (TWEB)
Estimating PageRank on graph streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Graph Sparsification in the Semi-streaming Model
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Machine models for query processing
ACM SIGMOD Record
Efficient algorithms for large-scale local triangle counting
ACM Transactions on Knowledge Discovery from Data (TKDD)
SUMMA: subgraph matching in massive graphs
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Streaming algorithms for independent sets
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Streaming graph computations with a helpful advisor
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Theoretical Computer Science
Estimating PageRank on graph streams
Journal of the ACM (JACM)
Computing strongly connected components in the streaming model
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Buyback problem: approximate matroid intersection with cancellation costs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On estimating path aggregates over streaming graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Validating XML documents in the streaming model with external memory
Proceedings of the 15th International Conference on Database Theory
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Approximate shortest paths guided by a small index
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Validating XML documents in the streaming model with external memory
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |
Data stream processing has recently received increasing attention as a computational paradigm for dealing with massive data sets. While major progress has been achieved for several fundamental data sketching and statistics problems, there are many problems that seem to be hard in a streaming setting, including most classical graph problems. Relevant examples are graph connectivity and shortest paths, for which linear lower bounds on the "space X passes" product are known. Some recent papers have shown that several graph problems can be solved with one or few passes, if the working memory is large enough to contain all the vertices of the graph. A natural question is whether we can reduce the space usage at the price of increasing the number of passes. Surprisingly, no algorithm with both sublinear space and passes is known for natural graph problems in classical streaming models.Motivated by technological factors of modern storage systems, some authors have recently started to investigate the computational power of less restrictive streaming models. In a FOCS'04 paper, Aggarwal et al. have shown that the use of intermediate temporary streams, combined with the ability to reorder them at each pass for free, yields enough power to solve in polylogarithmic space and passes a variety of problems, including graph connectivity. They leave however as an open question whether problems such as shortest paths can be solved efficiently in this more powerful model.In this paper, we show that the "streaming with sorting" model by Aggarwal et al. can yield interesting results even without using sorting at all: by just using intermediate temporary streams, we provide the first effective space-passes tradeoffs for natural graph problems. In particular, for any space restriction of s bits, we show that single-source shortest paths in directed graphs with small positive integer edge weights can be solved in O((n log3/2 n)/√s) passes. This is the first known streaming algorithm for shortest paths in directed graphs. For undirected connectivity, we devise an O((n log n)/s) passes algorithm. Both problems require Ω(n/s) passes under the restrictions we consider. We also show that the model where intermediate temporary streams are allowed can be strictly more powerful than classical streaming for some problems, while maintaining all of its hardness for others.