Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Introduction to algorithms
XMill: an efficient compressor for XML data
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Mesh-based content routing using XML
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Processing XML Streams with Deterministic Automata
ICDT '03 Proceedings of the 9th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Efficient Filtering of XML Documents for Selective Dissemination of Information
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
WebFilter: A High-throughput XML-based Publish and Subscribe System
Proceedings of the 27th International Conference on Very Large Data Bases
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
Stream processing of XPath queries with predicates
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
Building a large annotated corpus of English: the penn treebank
Computational Linguistics - Special issue on using large corpora: II
Fast structural query with application to chinese treebank sentence retrieval
Proceedings of the 2004 ACM symposium on Document engineering
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
Distributed XML Stream Filtering System with High Scalability
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimizing XPath queries on streaming XML data
ADC '07 Proceedings of the eighteenth conference on Australasian database - Volume 63
Efficient processing of branch queries for high-performance XML filtering
Proceedings of the 2nd international conference on Scalable information systems
XML-document-filtering automaton
Proceedings of the VLDB Endowment
Schema-conscious filtering of XML documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A development of hash-lookup trees to support querying streaming XML
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient XQuery join processing in publish/subscribe systems
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Hi-index | 0.00 |
Several applications based on XML stream processing have recently emerged, such as those for air traffic control and the selective dissemination of information (SDI). Their common need is to process a large number of XPath expressions in continuous XML streams at high throughput.This paper proposes four techniques for XPath expression processing based on Deterministic Finite Automata (DFA) for two purposes: to improve the memory usage efficiency of the automata and to support the processing of branching XPath expressions. The first technique, called n-DFA, clusters the given XPath expressions into n clusters to reduce the number of DFA states. The second, called shared NFA state table, lets the Non-Deterministic Finite Automata (NFA) state set be shared among the DFA states. Our experiments show that memory usage in an 8-DFA can, with the shared NFA state table, be reduced to 1/40th that of the original 1-DFA. The optimized NFA conversion and general XPath expression processing algorithm techniques contribute to the processing of branching XPath expressions efficiently; overall performance is better than is possible with earlier approaches.