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

don't replace unless strictly better

Browse source
This commit is contained in:
Barak Michener 2015-04-19 14:59:22 -04:00
parent 4e311177f1
commit b90ba7cd77
1 changed files with 6 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

6
graph/mongo/quadstore_iterator_optimize.go
View file

@ -63,6 +63,7 @@ func (qs *QuadStore) optimizeAndIterator(it *iterator.And) (graph.Iterator, bool
newAnd.AddSubIterator(it) newAnd.AddSubIterator(it)
} }
} }
mongostats := firstmongo.Stats()
lset := []graph.LinkageSet{ lset := []graph.LinkageSet{
{ {
@ -75,6 +76,11 @@ func (qs *QuadStore) optimizeAndIterator(it *iterator.And) (graph.Iterator, bool
for _, it := range it.SubIterators() { for _, it := range it.SubIterators() {
if it.Type() == graph.LinksTo { if it.Type() == graph.LinksTo {
lto := it.(*iterator.LinksTo) lto := it.(*iterator.LinksTo)
// Is it more effective to do the replacement, or let the mongo check the linksto?
ltostats := lto.Stats()
if (ltostats.ContainsCost+mongostats.NextCost)*mongostats.Size > (ltostats.NextCost+mongostats.ContainsCost)*ltostats.Size {
continue
}
newLto := NewLinksTo(qs, lto.SubIterators()[0], "quads", lto.Direction(), lset) newLto := NewLinksTo(qs, lto.SubIterators()[0], "quads", lto.Direction(), lset)
newAnd.AddSubIterator(newLto) newAnd.AddSubIterator(newLto)
ltocount++ ltocount++