Merge branch 'master' into bench

This commit is contained in:
Ben Johnson 2021-01-29 12:46:26 -07:00 committed by GitHub
commit ea653eb9a4
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
3 changed files with 68 additions and 29 deletions

View file

@ -555,11 +555,22 @@ func (e *executor) execute(ctx context.Context, qcx *Qcx, index string, q *pql.Q
// about the positive values, because only positive values
// are valid column IDs. So we don't actually eat top-level
// pre calls.
err := e.handlePreCallChildren(ctx, qcx, index, call, shards, opt)
if err != nil {
return nil, err
if call.Name == "Count" {
// Handle count specially, skipping the level directly underneath it.
for _, child := range call.Children {
err := e.handlePreCallChildren(ctx, qcx, index, child, shards, opt)
if err != nil {
return nil, err
}
}
} else {
err := e.handlePreCallChildren(ctx, qcx, index, call, shards, opt)
if err != nil {
return nil, err
}
}
var v interface{}
var err error
// Top-level calls don't need to precompute cross-index things,
// because we can just pick whatever index we want, but we
// still need to handle them. Since everything else was
@ -4628,28 +4639,21 @@ func (e *executor) executeCount(ctx context.Context, qcx *Qcx, index string, c *
child := c.Children[0]
// If the child is precomputed, we'll bypass mapreduce, ignore
// shards, and just count the number of bits.
if child.Name == "Precomputed" {
count := uint64(0)
for _, irow := range child.Precomputed {
switch row := irow.(type) {
case *Row:
for _, seg := range row.segments {
count += seg.n
}
case SignedRow:
for _, seg := range row.Pos.segments {
count += seg.n
}
for _, seg := range row.Neg.segments {
count += seg.n
}
default:
return 0, errors.Errorf("unexpected precomputed value type inside count: %+v", row)
}
// If the child is distinct/similar, execute it directly here and count the result.
if child.Type == pql.PrecallGlobal {
result, err := e.executeCall(ctx, qcx, index, child, shards, opt)
if err != nil {
return 0, err
}
switch row := result.(type) {
case *Row:
return row.Count(), nil
case SignedRow:
return row.Pos.Count() + row.Neg.Count(), nil
default:
return 0, errors.Errorf("cannot count result of type %T from call %q", row, child.String())
}
return count, nil
}
// Execute calls in bulk on each remote node and merge.
@ -6572,6 +6576,9 @@ func (e *executor) translateResult(ctx context.Context, index string, idx *Index
if field.Keys() {
rslt := result.Pos
if rslt == nil {
return &SignedRow{Pos: &Row{}}, nil
}
other := &Row{Attrs: rslt.Attrs}
for _, segment := range rslt.Segments() {
keys, err := e.Cluster.translateIndexIDs(context.Background(), field.ForeignIndex(), segment.Columns())

View file

@ -5397,6 +5397,19 @@ func TestExecutor_ForeignIndex(t *testing.T) {
pilosa.OptFieldKeys(),
)
// stepchild/other field needs to have usesKeys=true
crashSchemaJson := `{"indexes": [{"name": "stepparent","createdAt": 1611247966371721700,"options": {"keys": true,"trackExistence": true},"shardWidth": 1048576},{"name": "stepchild","createdAt": 1611247953796662800,"options": {"keys": true,"trackExistence": true},"shardWidth": 1048576,"fields": [{"name": "parent_id","createdAt": 1611247953797265700,"options": {"type": "int","base": 0,"bitDepth": 28,"min": -9223372036854776000,"max": 9223372036854776000,"keys": false,"foreignIndex": "stepparent"}},{"name": "other","createdAt": 1611247953796814000,"options": {"type": "int","base": 0,"bitDepth": 17,"min": -9223372036854776000,"max": 9223372036854776000,"keys": true,"foreignIndex": ""}}]}]}`
crashSchema := &pilosa.Schema{}
err := json.Unmarshal([]byte(crashSchemaJson), &crashSchema)
if err != nil {
t.Fatalf("json unmarshall: %v", err)
}
err = c.GetNode(0).API.ApplySchema(context.Background(), crashSchema, false)
if err != nil {
t.Fatalf("applying JSON schema: %v", err)
}
// Populate parent data.
c.Query(t, "parent", fmt.Sprintf(`
Set("one", general=1)
@ -5442,6 +5455,12 @@ func TestExecutor_ForeignIndex(t *testing.T) {
t.Fatalf("unexpected keys: %v", row.Keys)
}
crash := c.Query(t, "stepchild", `Distinct(Row(parent_id=3), field=other)`).Results[0].(pilosa.SignedRow)
if !sameStringSlice(crash.Pos.Keys, []string{}) {
// empty result; error condition does not require data
t.Fatalf("unexpected columns: %v", crash.Pos.Keys)
}
eq := c.Query(t, "child", `Row(parent_id=="one")`).Results[0].(*pilosa.Row)
if !reflect.DeepEqual(eq.Columns(), []uint64{1, ShardWidth}) {
t.Fatalf("unexpected columns: %v", eq.Columns())
@ -6818,6 +6837,8 @@ func TestMissingKeyRegression(t *testing.T) {
func TestVariousQueries(t *testing.T) {
for _, clusterSize := range []int{1, 3, 4, 7} {
t.Run(fmt.Sprintf("%d-node", clusterSize), func(t *testing.T) {
t.Parallel()
variousQueries(t, clusterSize)
})
}
@ -6897,8 +6918,7 @@ func variousQueries(t *testing.T, clusterSize int) {
{Val: 0, Key: "userE"},
})
// Create and populate "affinity" int field with negative, positive, zero and null values.
// Create and populate "net_worth" int field with positive values.
c.CreateField(t, "users", pilosa.IndexOptions{Keys: true, TrackExistence: true}, "net_worth", pilosa.OptFieldTypeInt(-100000000, 100000000))
c.ImportIntKey(t, "users", "net_worth", []test.IntKey{
{Val: 1, Key: "userA"},
@ -7032,6 +7052,15 @@ toronto,2,11
},
csvVerifier: "-10\n-5\n0\n5\n10\n",
},
{
query: "Count(Distinct(field=affinity))",
qrVerifier: func(t *testing.T, resp pilosa.QueryResponse) {
if resp.Results[0].(uint64) != 5 {
t.Errorf("wrong number of values: %+v", resp.Results[0])
}
},
csvVerifier: "5\n",
},
{
query: "Distinct(Row(affinity>=0),field=affinity)",
qrVerifier: func(t *testing.T, resp pilosa.QueryResponse) {

View file

@ -274,14 +274,17 @@ type callStackElem struct {
type CallType byte
const (
// Normal calls can be executed per shard.
// PrecallNone calls can be executed per shard.
PrecallNone = CallType(iota)
// PreCallGlobal indicates a call which must be run globally *before*
// PrecallGlobal indicates a call which must be run globally *before*
// distributing the call to other shards. Example: A Distinct query,
// where every shard could potentially produce results for any shard,
// so you have to produce the results up front.
// These are processed directly when inside of a count operation.
PrecallGlobal
// PreCallPerNode indicates a call which needs to be run per-shard
// PrecallPerNode indicates a call which needs to be run per-shard
// in a way that lets it be done on each shard, but where it should
// be done prior to spawning per-shard goroutines. Example:
// A cross-index query, where each local shard may or may not need