311 search results - page 26 / 63 » Approximate XML joins |
PODS
2010
ACM
15 years 4 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
118
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Developing cost models for query optimization is significantly harder for XML queries than for traditional relational queries. The reason is that XML query operators are much mor...
DKE
2008
14 years 11 months ago
2008
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
INEX
2005
Springer
15 years 5 months ago
2005
Springer
181
click to vote
ICDE
2005
IEEE
16 years 1 months ago
2005
IEEE
Sequence-based XML indexing aims at avoiding expensive join operations in query processing. It transforms structured XML data into sequences so that a structured query can be answ...