Sciweavers

210 search results - page 34 / 42
» Complex Group-By Queries for XML
Sort
View
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 6 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...
JACM
2008
91views more  JACM 2008»
13 years 6 months ago
On the minimization of XPath queries
XML queries are usually expressed by means of XPath expressions identifying portions of the selected documents. An XPath expression defines a way of navigating an XML tree and ret...
Sergio Flesca, Filippo Furfaro, Elio Masciari
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 7 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 26 days ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
ICDE
2006
IEEE
152views Database» more  ICDE 2006»
14 years 8 months ago
A Complete and Efficient Algebraic Compiler for XQuery
As XQuery nears standardization, more sophisticated XQuery applications are emerging, which often exploit the entire language and are applied to non-trivial XML sources. We propos...
Christopher Re, Jérôme Siméon,...