Mobile Information Systems
DOI: 10.1007/0-387-22874-8_13
|View full text |Cite
|
Sign up to set email alerts
|

Finite Segmentation for XML Caching

Abstract: XML data processing often relies on basic relations between two XML fragments like containment, subset, difference and intersection. Fast calculation of such relations based only on the representing XPath expression is known to be a major challenge. Recently XML patterns have been introduced to model and identify handy subclasses of XPath. We present the concept of ST-pattem segments that uses sets of adapted tree pattems in order to describe a finite and complete partitioning of the XML document's data space.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 15 publications
(1 reference statement)
0
1
0
Order By: Relevance
“…[5,8]. We follow these approaches, as we use them for identifying frequently accessed tree patterns in order to generate a database fragmentation that fits many queries, as described in [13].…”
Section: Related Workmentioning
confidence: 99%
“…[5,8]. We follow these approaches, as we use them for identifying frequently accessed tree patterns in order to generate a database fragmentation that fits many queries, as described in [13].…”
Section: Related Workmentioning
confidence: 99%