Representing and querying XML with incomplete information
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Accelerating XPath location steps
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
APEX: an adaptive path index for XML data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient synchronization for mobile XML data
Proceedings of the eleventh international conference on Information and knowledge management
XML Fragment Caching for Small Mobile Internet Devices
Revised Papers from the NODe 2002 Web and Database-Related Workshops on Web, Web-Services, and Database Systems
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mining Frequent Quer Patterns from XML Queries
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Caching XML Web Services for Mobility
Queue - Wireless
Testing Intersection of XPath Expressions under DTDs
IDEAS '04 Proceedings of the International Database Engineering and Applications Symposium
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Mixed mode XML query processing
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Query processing for high-volume XML message brokering
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.00 |
As in a centralized environment, XML data processing in a peer-to-peer environment relies on basic relations between two XML fragments such as containment, subset, difference and intersection. Fast calculation of such relations based only on logical expressions like XPath is known to be a major challenge. Recently XML patterns have been introduced to model and to identify handy subclasses of XPath. We introduce a model for XML data based on their DTDs, tailored to the needs of distributed data processing. In order to meet the required granularity for data processing, our model combines concepts of tree patterns and search trees to represent XML fragments. Besides the given overview and properties of our search tree pattern model, we give an introductive example of the usage of such patterns in a peer-to-peer XML caching environment. It enables a peer's cache manager to partially contribute to other peer's requests. Identifying suitable and flexible classes of our newly introduced search tree patterns, we show that our model supports fast and resource preserving logical XML data processing, and we show how such classes can be tailored to a specific application domain and how access focus changes to XML data can be adapted.