Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Embedded Everywhere: A Research Agenda for Networked Systems of Embedded Computers
Query processing of streamed XML data
Proceedings of the eleventh international conference on Information and knowledge management
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
Efficient filtering of XML documents with XPath expressions
The VLDB Journal — The International Journal on Very Large Data Bases
WWW '03 Proceedings of the 12th international conference on World Wide Web
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
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
Abstracts of invited industrial track presentations
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
Raindrop: a uniform and layered algebraic framework for XQueries on XML streams
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Light-weight xPath processing of XML stream with deterministic automata
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Path sharing and predicate evaluation for high-performance XML filtering
ACM Transactions on Database Systems (TODS)
PRIX: Indexing And Querying XML Using Prüfer Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Implementing a scalable XML publish/subscribe system using relational database systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Processing XML streams with deterministic automata and stream indexes
ACM Transactions on Database Systems (TODS)
Bloom Filter-Based XML Packets Filtering for Millions of Path Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
ACM Transactions on Database Systems (TODS)
FiST: scalable XML document filtering by sequencing twig patterns
VLDB '05 Proceedings of the 31st international conference on Very large data bases
FAR: Face-aware routing for mobicast in large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
Mobile Telemedicine Sensor Networks with Low-Energy Data Query and Network Lifetime Considerations
IEEE Transactions on Mobile Computing
AFilter: adaptable XML filtering with prefix-caching suffix-clustering
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Cache-Conscious Automata for XML Filtering
IEEE Transactions on Knowledge and Data Engineering
XPath query processing improvements
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
| Hi-index | 0.00 |
In this paper, we consider the problem of filtering a continuous stream of XML data efficiently against a large number of branch XPath queries. Several approaches have been proposed, and many of them improve their run-time efficiencies by sharing some paths between branch queries. This paper further improves the run-time effiencies by classifying and grouping semantically equivalent twig patterns, and identifying the common paths that are shared between these groups. Query structure matching is done at index compilation phase, and the paths shared between these groups of queries are processed once. Experiments show that our proposal is efficient and scalable compared to previous work.