552 search results - page 57 / 111 » On the Complexity of Join Predicates |
169
Voted
SIGSOFT
2010
ACM
14 years 10 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
177
Voted
SLOGICA
2011
14 years 7 months ago
2011
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
100
Voted
PEPM
2010
ACM
15 years 9 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
109
click to vote
CSCW
2010
ACM
15 years 9 months ago
2010
ACM
People are often required to catch up on information they have missed in meetings, because of lateness or scheduling conflicts. Catching up is a complex cognitive process where pe...
101
click to vote
PVLDB
2010
14 years 11 months ago
2010
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...