The VLDB Journal — The International Journal on Very Large Data Bases
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
ORDPATHs: insert-friendly XML node labels
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Nested intervals tree encoding in SQL
ACM SIGMOD Record
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
A dataguide-based concurrency control protocol for cooperation on XML data
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
This paper provides a technique that enables embedding of path and twig query evaluation in an application server built on top of a small footprint data manager. The technique proposed offers increased flexibility, enabling seamless integration of business rules with low level evaluation facilities. This flexibility compares with that supported by stored procedures in SQL, not available for XML. Our method leverages deferred processing of a Structural Join (SJ) that we modify so as to achieve the minimum number of IO operations. Our recursive composition technique takes advantage of FIFO order processing, what results in a significant performance boost.