415 search results - page 41 / 83 » Optimal query complexity bounds for finding graphs |
139
click to vote
VLDB
1994
ACM
15 years 7 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...
117
click to vote
RECOMB
2007
Springer
16 years 3 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
137
click to vote
RTSS
1992
IEEE
15 years 7 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
114
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
120
click to vote
DAC
2006
ACM
16 years 4 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...