116 search results - page 15 / 24 » Efficient Evaluation of XML Middle-ware Queries |
164
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
We propose a framework for integrating data from multiple relational sources into an XML document that both conforms to a given DTD and satisfies predefined XML constraints. The f...
171
click to vote
DASFAA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
249
click to vote
ICDE
2001
IEEE
16 years 7 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
165
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
173
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...