Lower bounds on communication complexity
Information and Computation
SIAM Journal on Computing
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Communication complexity
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Some Results on Tape-Bounded Turing Machines
Journal of the ACM (JACM)
External memory algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Validating streaming XML documents
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Characterizing memory requirements for queries over continuous data streams
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database Management Systems
Data streams: algorithms and applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Locating Matches of Tree Patterns in Forests
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Typing and querying XML documents: some complexity bounds
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
On the Streaming Model Augmented with a Sorting Primitive
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the memory requirements of XPath evaluation over XML streams
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Lower bounds for sorting with few random accesses to external memory
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the memory requirements of XPath evaluation over XML streams
Journal of Computer and System Sciences
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Lower bounds for randomized read/write stream algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Trading off space for passes in graph streaming problems
ACM Transactions on Algorithms (TALG)
Efficient and expressive tree filters
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Streamable fragments of forward XPath
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Database query processing using finite cursor machines
ICDT'07 Proceedings of the 11th international conference on Database Theory
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
We study a clean machine model for external memory and stream processing. We show that the number of scans of the external data induces a strict hierarchy (as long as work space is sufficiently small, e.g., polylogarithmic in the size of the input). We also show that neither joins nor sorting are feasible if the product of the number r(n) of scans of the external memory and the size s(n) of the internal memory buffers is sufficiently small, e.g., of size $o(\sqrt[n]{5})$. We also establish tight bounds for the complexity of XPath evaluation and filtering.