6274 search results - page 186 / 1255 » From query complexity to computational complexity |
161
click to vote
PODS
2008
ACM
16 years 4 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...
139
click to vote
DEXA
2000
Springer
15 years 8 months ago
2000
Springer
The relational model, as proposed by Codd, contained the concept of relations as tables composed of tuples of single valued attributes taken from a domain. In most of the early lit...
217
click to vote
SIGMOD
2007
ACM
16 years 4 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...
206
click to vote
AMR
2008
Springer
15 years 6 months ago
2008
Springer
Retrieving music from large digital databases is a demanding computational task. The cost for indexing and searching depends not only on the computational effort of measuring music...
155
click to vote
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...