Lore: a database management system for semistructured data
ACM SIGMOD Record
Efficient evaluation of multiple queries on streaming XML data
Proceedings of the eleventh international conference on Information and knowledge management
Query processing of streamed XML data
Proceedings of the eleventh international conference on Information and knowledge management
Proceedings of the 27th International Conference on Very Large Data Bases
27th International Conference on Very Large Data Bases
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
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
VXMLR: A Visual XML-Relational Database System
Proceedings of the 27th International Conference on Very Large Data Bases
Issues in data stream management
ACM SIGMOD Record
YFilter: Efficient and Scalable Filtering of XML Documents
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Efficient management of XML contents over wireless environment by Xstream
Proceedings of the 2004 ACM symposium on Applied computing
RPE query processing and optimization techniques for XML databases
Journal of Computer Science and Technology
Data stream management for historical XML data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Automaton meets algebra: a hybrid paradigm for XML stream processing
Data & Knowledge Engineering - Special issue: ER 2003
Hi-index | 0.00 |
With the extensive use of XML in applications over the Web, efficient query processing over streaming XML has become a core challenge due to one-pass processing and limited resources. Taking advantage of Hole-Filler model for XML fragments, this paper proposes a hybrid structure (FQ-Index) for both the queries and fragments, and proposes an XML fragment processing algorithm to evaluate forward XPath queries over streamed XML fragments. Two optimization rules, dependence pruning and prefix pruning are also developed. Dependence pruning scheme prunes off the dependent operations caused by fragmentation and transforms the queries for XML tag into queries for XML fragments, while prefix pruning scheme prunes off the "redundant" prefix along the path according to the tag structure. The effectiveness of the techniques developed is illustrated with a detailed set of experiments.