barak/cayley
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

graph/sql: Use an IN clause when optimizing a fixed iterator

Browse source
This commit is contained in:
Barak Michener 2015-11-12 14:46:31 -05:00
parent 7a5e206539
commit 831b14c23e
2 changed files with 42 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

14
graph/sql/sql_link_iterator.go
View file

@ -220,8 +220,18 @@ func (l *SQLLinkIterator) buildWhere() (string, []string) {
var q []string
var vals []string
for _, c := range l.constraints {
q = append(q, fmt.Sprintf("%s.%s_hash = ?", l.tableName, c.dir))
vals = append(vals, hashOf(c.vals[0]))
if len(c.vals) == 1 {
q = append(q, fmt.Sprintf("%s.%s_hash = ?", l.tableName, c.dir))
vals = append(vals, hashOf(c.vals[0]))
} else if len(c.vals) > 1 {
subq := fmt.Sprintf("%s.%s_hash IN ", l.tableName, c.dir)
valslots := strings.Join(strings.Split(strings.Repeat("?", len(c.vals)), ""), ", ")
subq += fmt.Sprintf("(%s)", valslots)
q = append(q, subq)
for _, v := range c.vals {
vals = append(vals, hashOf(v))
}
}
}
for _, i := range l.nodeIts {
t := i.it.tableID()