Communication complexity
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
External memory algorithms
Space lower bounds for distance approximation in the data stream model
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
Characterizing memory requirements for queries over continuous data streams
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Information Statistics Approach to Data Stream and Communication Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
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
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
YFilter: Efficient and Scalable Filtering of XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Tight Lower Bounds for the Distinct Elements Problem
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Optimal space lower bounds for all frequency moments
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
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
The VLDB Journal — The International Journal on Very Large Data Bases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Optimizing cursor movement in holistic twig joins
Proceedings of the 14th ACM international conference on Information and knowledge management
Randomized computations on large data sets: tight lower bounds
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
AFilter: adaptable XML filtering with prefix-caching suffix-clustering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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
Efficient algorithms for evaluating xpath over streams
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Machine models and lower bounds for query processing
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
SPEX: Streamed and Progressive Evaluation of XPath
IEEE Transactions on Knowledge and Data Engineering
Online evaluation of regular tree queries
Nordic Journal of Computing
Journal of Functional Programming
Semantics based buffer reduction for queries over XML data streams
ADC '08 Proceedings of the nineteenth conference on Australasian database - Volume 75
ACM Computing Surveys (CSUR)
Lower bounds for processing data with few random accesses to external memory
Journal of the ACM (JACM)
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Efficient algorithms for descendant-only tree pattern queries
Information Systems
Fast XML document filtering by sequencing twig patterns
ACM Transactions on Internet Technology (TOIT)
Worst-case optimal algorithm for XPath evaluation over XML streams
Journal of Computer and System Sciences
Processing XPath queries with forward and downward axes over XML streams
Proceedings of the 13th International Conference on Extending Database Technology
Evaluating xpath queries on XML data streams
BNCOD'07 Proceedings of the 24th British national conference on Databases
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Memory lower bounds for XPath evaluation over XML streams
Journal of Computer and System Sciences
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
The complexity of querying external memory and streaming data
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A survey on XML streaming evaluation techniques
The VLDB Journal — The International Journal on Very Large Data Bases
Hi-index | 0.00 |
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the document stream. In many cases, these buffers grow very large and constitute a major memory bottleneck. In this paper, we identify two broad classes of evaluation problems that independently necessitate the use of large memory buffers in evaluation of queries over XML streams: (1) full-fledged evaluation (as opposed to just filtering) of queries with predicates; (2) evaluation (whether full-fledged or filtering) of queries with "multi-variate" predicates.We prove quantitative lower bounds on the amount of memory required in each of these scenarios. The bounds are stated in terms of novel document properties that we define. We show that these scenarios, in combination with query evaluation over recursive documents, cover the cases in which large buffers are required. Finally, we present algorithms that match the lower bounds for an important fragment of XPath.