2228 search results - page 85 / 446 » On Database Theory and XML |
100
click to vote
IDEAS
2005
IEEE
15 years 5 months ago
2005
IEEE
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
ADC
2005
Springer
15 years 5 months ago
2005
Springer
XML query caching for XML database-backed Web applications began to be investigated recently. However, the issue of how the cached query results are stored has not been addressed ...
XSYM
2004
Springer
15 years 5 months ago
2004
Springer
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and val...
WIDM
2003
ACM
15 years 5 months ago
2003
ACM
Storage techniques and queries over XML databases are being widely studied. Most works store XML documents in traditional DBMSs in order to take advantage of a well established te...
103
click to vote
XSYM
2010
Springer
14 years 10 months ago
2010
Springer
Keys for XML data trees can uniquely identify nodes based on the data values on some of their subnodes, either in the entire tree or relatively to some selected subtrees. Such keys...