6274 search results - page 236 / 1255 » From query complexity to computational complexity |
143
click to vote
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
251
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
147
click to vote
SSDBM
2007
IEEE
15 years 11 months ago
2007
IEEE
Applications that query data streams in order to identify trends, patterns, or anomalies can often benefit from comparing the live stream data with archived historical stream dat...
177
click to vote
XSYM
2007
Springer
15 years 11 months ago
2007
Springer
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
138
click to vote
ICDT
2001
ACM
15 years 9 months ago
2001
ACM
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...