Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
Stream processing of XPath queries with predicates
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient Filtering of XML Documents with XPath Expressions
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
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
Buffering in query evaluation over XML streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
An Efficient XPath Query Processor for XML Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A transducer-based XML query processor
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The BEA/XQRL streaming XQuery processor
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
Efficient evaluation of generalized path pattern queries on XML data
Proceedings of the 17th international conference on World Wide Web
Value-based predicate filtering of XML documents
Data & Knowledge Engineering
ACM Computing Surveys (CSUR)
Evaluating partial tree-pattern queries on XML streams
Proceedings of the 17th ACM conference on Information and knowledge management
Eager Evaluation of Partial Tree-Pattern Queries on XML Streams
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Ordered Backward XPath Axis Processing against XML Streams
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
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
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Efficient XQuery join processing in publish/subscribe systems
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Efficient evaluation of generalized tree-pattern queries on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient filtering of XML documents with XPath expressions containing ancestor axis
WAIM'10 Proceedings of the 11th international conference on Web-age information management
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
Chimera: stream-oriented XML filtering/querying engine
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part II
XML filtering with XPath expressions containing parent and ancestor axes
Information Sciences: an International Journal
Eager XPath evaluation over XML streams
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
A survey on XML streaming evaluation techniques
The VLDB Journal — The International Journal on Very Large Data Bases
A study on parallelizing XML path filtering using accelerators
ACM Transactions on Embedded Computing Systems (TECS)
Hi-index | 0.00 |
In this paper we address the problem of evaluating XPath queries over streaming XML data. We consider a practical XPath fragment called Univariate XPath, which includes the commonly used '/' and '//' axes and allows *-node tests and arbitrarily nested predicates. It is well known that this XPath fragment can be efficiently evaluated in O(|D||Q|) time in the non-streaming environment, where |D| is the document size and |Q| is the query size. However, this is not necessarily true in the streaming environment, since streaming algorithms have to satisfy stricter requirement than non-streaming algorithms, in that all data must be read sequentially in one pass. Therefore, it is not surprising that state-of-the-art stream-querying algorithms have higher time complexity than O(|D||Q|). In this paper we revisit the XPath stream-querying problem, and show that Univariate XPath can be efficiently evaluated in O|D||Q|) time in the streaming environment. Specifically, we propose two O(|D||Q|)-time stream-querying algorithms, LQ and EQ, which are based on the lazy strategy and on the eager strategy, respectively. To the best of our knowledge, LQ and EQ are the first XPath stream-querying algorithms that achieve O(|D||Q|) time performance. Further, our algorithms achieve O(|D||Q|) time performance without trading off space performance. Instead, they have better buffering-space performance than state-of-the-art stream-querying algorithms. In particular, EQ achieves optimal buffering-space performance. Our experimental results show that our algorithms have not only good theoretical complexity but also considerable practical performance advantages over existing algorithms.