51 search results - page 7 / 11 » Rewriting and Evaluating Tree Queries with XPath |
144
click to vote
ICDE
2004
IEEE
15 years 11 months ago
2004
IEEE
We describe and evaluate a query minimization technique that applies to XQueries, which are nested, perform arbitrary joins, and freely mix bag and set semantics. These features c...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Popular XML languages, like XPath, use “treepattern” queries to select nodes based on their structural characteristics. While many processing methods have already been propose...
EDBT
2011
ACM
14 years 1 months ago
2011
ACM
This demonstration paper presents a probabilistic XML data merging tool, that represents the outcome of semi-structured document integration as a probabilistic tree. The system is...
161
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
152
Voted
ICDE
2003
IEEE
15 years 11 months ago
2003
IEEE
In order to publish a nested XML document from flat relational data, multiple SQL queries are often needed. The efficiency of publishing relies on how fast these queries can be ev...