7e36109b3c
This API (unexported) will estimate the amount of memory needed to execute
a search query over an index before the collector begins data collection.
Sample estimates for certain queries:
{Size: 10, BenchmarkUpsidedownSearchOverhead}
ESTIMATE BENCHMEM
TermQuery 4616 4796
MatchQuery 5210 5405
DisjunctionQuery (Match queries) 7700 8447
DisjunctionQuery (Term queries) 6514 6591
ConjunctionQuery (Match queries) 7524 8175
Nested disjunction query (disjunction of disjunctions) 10306 10708
…
91 lines
2.6 KiB
Go
91 lines
2.6 KiB
Go
// Copyright (c) 2014 Couchbase, Inc.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
package scorer
|
|
|
|
import (
|
|
"fmt"
|
|
"reflect"
|
|
|
|
"github.com/blevesearch/bleve/search"
|
|
"github.com/blevesearch/bleve/size"
|
|
)
|
|
|
|
var reflectStaticSizeDisjunctionQueryScorer int
|
|
|
|
func init() {
|
|
var dqs DisjunctionQueryScorer
|
|
reflectStaticSizeDisjunctionQueryScorer = int(reflect.TypeOf(dqs).Size())
|
|
}
|
|
|
|
type DisjunctionQueryScorer struct {
|
|
options search.SearcherOptions
|
|
}
|
|
|
|
func (s *DisjunctionQueryScorer) Size() int {
|
|
return reflectStaticSizeDisjunctionQueryScorer + size.SizeOfPtr
|
|
}
|
|
|
|
func NewDisjunctionQueryScorer(options search.SearcherOptions) *DisjunctionQueryScorer {
|
|
return &DisjunctionQueryScorer{
|
|
options: options,
|
|
}
|
|
}
|
|
|
|
func (s *DisjunctionQueryScorer) Score(ctx *search.SearchContext, constituents []*search.DocumentMatch, countMatch, countTotal int) *search.DocumentMatch {
|
|
var sum float64
|
|
var childrenExplanations []*search.Explanation
|
|
if s.options.Explain {
|
|
childrenExplanations = make([]*search.Explanation, len(constituents))
|
|
}
|
|
|
|
var locations []search.FieldTermLocationMap
|
|
for i, docMatch := range constituents {
|
|
sum += docMatch.Score
|
|
if s.options.Explain {
|
|
childrenExplanations[i] = docMatch.Expl
|
|
}
|
|
if docMatch.Locations != nil {
|
|
locations = append(locations, docMatch.Locations)
|
|
}
|
|
}
|
|
|
|
var rawExpl *search.Explanation
|
|
if s.options.Explain {
|
|
rawExpl = &search.Explanation{Value: sum, Message: "sum of:", Children: childrenExplanations}
|
|
}
|
|
|
|
coord := float64(countMatch) / float64(countTotal)
|
|
newScore := sum * coord
|
|
var newExpl *search.Explanation
|
|
if s.options.Explain {
|
|
ce := make([]*search.Explanation, 2)
|
|
ce[0] = rawExpl
|
|
ce[1] = &search.Explanation{Value: coord, Message: fmt.Sprintf("coord(%d/%d)", countMatch, countTotal)}
|
|
newExpl = &search.Explanation{Value: newScore, Message: "product of:", Children: ce}
|
|
}
|
|
|
|
// reuse constituents[0] as the return value
|
|
rv := constituents[0]
|
|
rv.Score = newScore
|
|
rv.Expl = newExpl
|
|
if len(locations) == 1 {
|
|
rv.Locations = locations[0]
|
|
} else if len(locations) > 1 {
|
|
rv.Locations = search.MergeLocations(locations)
|
|
}
|
|
|
|
return rv
|
|
}
|