Value-based predicate filtering of XML documents
Data & Knowledge Engineering
Effective pruning for XML structural match queries
Data & Knowledge Engineering
CSC: supporting queries on compressed cached XML
ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
Skeleton automata for FPGAs: reconfiguring without reconstructing
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Partitioning XML documents for iterative queries
Proceedings of the 16th International Database Engineering & Applications Sysmposium
Efficient string-based XML stream prefiltering
ADC '12 Proceedings of the Twenty-Third Australasian Database Conference - Volume 124
XLynx—An FPGA-based XML filter for hybrid XQuery processing
ACM Transactions on Database Systems (TODS) - Invited papers issue
| Hi-index | 0.00 |
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient search in flat strings into the second dimension to navigate in tree structured data. We consider the important XML data management task of prefiltering XML documents (also called XML projection) as an application for our approach. Different from existing prefiltering schemes we usually process only fractions of the input and get by with very economical consumption of both main memory and processing time. Our experiments reveal that already on low-complexity problems such as XPath filtering inmemory query engines can experience speed-ups by two orders of magnitude.