NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Highly personalized information delivery to mobile clients
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
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
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)
| Hi-index | 0.00 |
Many algorithms have been proposed for processing multiple XPath Expressions such as Xfilter[5], Yfilter[6], turboXPath[13] and Xtrie[9]. But they do not deal with backward axes. XAOS[2] deals with XPath expressions with forward and backward axes (such as parent and ancestor). But XAOS deals with only one query at a time. As a result a document is parsed q times for a set of q queries, which is a significant cost in terms of time. More over, in a large-scale system, there is bound to be substantial commonality among different queries. In this paper, we present a method called YALXP, which attempts to evaluate multiple queries, with both forward and backward axes, in less number of passes exploiting commonality among the queries. Our method is built upon XAOS algorithm. Our experiments show that YALXP performs better in CPU time and memory than traditional XPath engine Xalan (ODP) – for multiple queries with single DOM construction.