136 search results - page 9 / 28 » Optimization and Dataflow Algorithms for Nested Tree Queries |
155
Voted
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
IANDC
2011
14 years 4 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
We present a formal framework for capturing the provenance of data appearing in XQuery views of XML. Building on previous work on relations and their (positive) query languages, w...
161
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...