1148 search results - page 97 / 230 » Using a relational database for scalable XML search |
216
click to vote
ICDE
2001
IEEE
16 years 5 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...
110
click to vote
WWW
2002
ACM
16 years 4 months ago
2002
ACM
We present an algorithm for translating XSLT programs into SQL. Our context is that of virtual XML publishing, in which a single XML view is defined from a relational database, an...
126
click to vote
INEX
2004
Springer
15 years 9 months ago
2004
Springer
We describe the INEX 2004 participation of the Informatics Institute of the University of Amsterdam. We completely revamped our XML retrieval system, now implemented as a mixture l...
127
click to vote
BXML
2004
15 years 5 months ago
2004
: Whenever transformation of data is used to bridge the gap of different data formats, and a query is given in the destination format, query reformulation can speed up the transfor...
133
click to vote
WEBDB
2004
Springer
15 years 9 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...