Name
Abstract | ||
|---|---|---|
The problem of efficiently evaluating XPath and XQuery queries has become increasingly significant since more and more XML data is stored in its native form. We propose a novel optimisation technique for XML queries that is based on the semantic properties exhibited by XML data. In sharp contrast to previous studies on selectivity estimation we propose to specify bounds on the number of element nodes in an XML tree that form the root of isomorphic subtrees. It turns out that efficient reasoning about these constraints provides effective means to predict the number of XPath and XQuery query answers, to predict the number of updates using the XQuery update facility, to predict the number of en(de)cryptions using XML encryption, and to optimise XML queries. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/DEXA.2007.176 | DEXA Workshops |
Keywords | Field | DocType |
native form,xml encryption,query,constraints,xml,xml query optimisation,xml query,xquery query,xquery update facility,xml tree,xml data,xquery query answer,effective mean,efficient reasoning,selectivity,optimisation,tree data structures | Data mining,XML Encryption,Streaming XML,Computer science,XQuery Update Facility,XML validation,XML database,XPath,XML tree,Database,XQuery | Conference |
ISBN | Citations | PageRank |
0-7695-2932-1 | 0 | 0.34 |
References | Authors | |
12 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sven Hartmann | 1 | 62 | 9.60 |
| Sebastian Link | 2 | 462 | 39.59 |