Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Improve the way we reverse iterator for backward queries. #2793

Merged
merged 1 commit into from
Oct 23, 2020
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 21 additions & 8 deletions pkg/chunkenc/memchunk.go
Original file line number Diff line number Diff line change
Expand Up @@ -481,17 +481,30 @@ func (c *MemChunk) Iterator(ctx context.Context, mintT, maxtT time.Time, directi
its = append(its, c.head.iterator(ctx, direction, mint, maxt, lbs, pipeline))
}

iterForward := iter.NewTimeRangedIterator(
iter.NewNonOverlappingIterator(its, ""),
time.Unix(0, mint),
time.Unix(0, maxt),
)

if direction == logproto.FORWARD {
return iterForward, nil
return iter.NewTimeRangedIterator(
iter.NewNonOverlappingIterator(its, ""),
time.Unix(0, mint),
time.Unix(0, maxt),
), nil
}
for i, it := range its {
r, err := iter.NewEntryReversedIter(
iter.NewTimeRangedIterator(it,
time.Unix(0, mint),
time.Unix(0, maxt),
))
if err != nil {
return nil, err
}
its[i] = r
}

for i, j := 0, len(its)-1; i < j; i, j = i+1, j-1 {
its[i], its[j] = its[j], its[i]
}

return iter.NewEntryReversedIter(iterForward)
return iter.NewNonOverlappingIterator(its, ""), nil
}

// Iterator implements Chunk.
Expand Down
30 changes: 21 additions & 9 deletions pkg/storage/lazy_chunk.go
Original file line number Diff line number Diff line change
Expand Up @@ -74,18 +74,30 @@ func (c *LazyChunk) Iterator(
its = append(its, b.Iterator(ctx, dropLabels(c.Chunk.Metric, labels.MetricName), pipeline))
}

// build the final iterator bound to the requested time range.
iterForward := iter.NewTimeRangedIterator(
iter.NewNonOverlappingIterator(its, ""),
from,
through,
)

if direction == logproto.FORWARD {
return iterForward, nil
return iter.NewTimeRangedIterator(
iter.NewNonOverlappingIterator(its, ""),
from,
through,
), nil
}
for i, it := range its {
r, err := iter.NewEntryReversedIter(
iter.NewTimeRangedIterator(it,
from,
through,
))
if err != nil {
return nil, err
}
its[i] = r
}

for i, j := 0, len(its)-1; i < j; i, j = i+1, j-1 {
its[i], its[j] = its[j], its[i]
}

return iter.NewEntryReversedIter(iterForward)
return iter.NewNonOverlappingIterator(its, ""), nil
}

// SampleIterator returns an sample iterator.
Expand Down