7106 search results - page 838 / 1422 » Restricted Complexity, General Complexity |
278
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
281
click to vote
SIGMOD
2007
ACM
16 years 7 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...
287
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
182
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
205
click to vote
PODS
2007
ACM
16 years 7 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...