com.questdb.query.spi.QueryAllResultSetBuilder Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of questdb-core Show documentation
Show all versions of questdb-core Show documentation
QuestDB is High Performance Time Series Database
/*******************************************************************************
* ___ _ ____ ____
* / _ \ _ _ ___ ___| |_| _ \| __ )
* | | | | | | |/ _ \/ __| __| | | | _ \
* | |_| | |_| | __/\__ \ |_| |_| | |_) |
* \__\_\\__,_|\___||___/\__|____/|____/
*
* Copyright (C) 2014-2016 Appsicle
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License, version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see .
*
******************************************************************************/
package com.questdb.query.spi;
import com.questdb.Partition;
import com.questdb.ex.JournalException;
import com.questdb.misc.Interval;
import com.questdb.misc.Rows;
import com.questdb.query.UnorderedResultSetBuilder;
import com.questdb.std.IntList;
import com.questdb.std.LongList;
import com.questdb.std.ObjList;
import com.questdb.store.IndexCursor;
import com.questdb.store.KVIndex;
public class QueryAllResultSetBuilder extends UnorderedResultSetBuilder {
private final IntList symbolKeys;
private final ObjList filterSymbols;
private final IntList filterSymbolKeys;
final private String symbol;
private KVIndex index;
private KVIndex[] searchIndices;
public QueryAllResultSetBuilder(Interval interval, String symbol, IntList symbolKeys, ObjList filterSymbols, IntList filterSymbolKeys) {
super(interval);
this.symbol = symbol;
this.symbolKeys = symbolKeys;
this.filterSymbols = filterSymbols;
this.filterSymbolKeys = filterSymbolKeys;
}
@Override
public Accept accept(Partition partition) throws JournalException {
super.accept(partition);
this.index = partition.open().getIndexForColumn(symbol);
// check if partition has at least one symbol value
if (symbolKeys.size() > 0) {
for (int i = 0, sz = symbolKeys.size(); i < sz; i++) {
if (index.contains(symbolKeys.getQuick(i))) {
int n = filterSymbols.size();
searchIndices = new KVIndex[n];
for (int k = 0; k < n; k++) {
searchIndices[k] = partition.getIndexForColumn(filterSymbols.getQuick(k));
}
return Accept.CONTINUE;
}
}
return Accept.SKIP;
}
return Accept.BREAK;
}
@Override
public void read(long lo, long hi) {
for (int i = 0, sz = symbolKeys.size(); i < sz; i++) {
int symbolKey = symbolKeys.getQuick(i);
if (index.contains(symbolKey)) {
if (searchIndices.length > 0) {
for (int k = 0; k < searchIndices.length; k++) {
if (searchIndices[k].contains(filterSymbolKeys.getQuick(k))) {
LongList searchLocalRowIDs = searchIndices[k].getValues(filterSymbolKeys.getQuick(k));
IndexCursor cursor = index.cursor(symbolKey);
while (cursor.hasNext()) {
long localRowID = cursor.next();
if (localRowID < lo) {
break;
}
if (localRowID <= hi && searchLocalRowIDs.binarySearch(localRowID) >= 0) {
result.add(Rows.toRowID(partition.getPartitionIndex(), localRowID));
}
}
}
}
} else {
IndexCursor cursor = index.cursor(symbolKey);
result.ensureCapacity((int) cursor.size());
while (cursor.hasNext()) {
long localRowID = cursor.next();
if (localRowID >= lo && localRowID <= hi) {
result.add(Rows.toRowID(partition.getPartitionIndex(), localRowID));
}
}
}
}
}
}
}