Map of :eq query to a sub-index. This is used to recursively search the set after finding the first match.
Entries that remain after checking all the simple :eq queries. This list will be searched using a linear scan to get final matching with regex or other more complicated query clauses.
Entries that remain after checking all the simple :eq queries.
Entries that remain after checking all the simple :eq queries. This list will be searched using a linear scan to get final matching with regex or other more complicated query clauses.
Map of :eq query to a sub-index.
Map of :eq query to a sub-index. This is used to recursively search the set after finding the first match.
Returns true if the tags match any of the queries in the index.
Finds the set of items that match the provided tags.
Creates a string representation of the index tree.
Creates a string representation of the index tree. Warning: this can be large if many queries are indexed.
(Since version ) see corresponding Javadoc for more information.
Index for quickly matching a set of tags against many query expressions. The intended use-case is for stream processing. If a stream of tagged data points are flowing through the system and we have thousands of queries, then we need efficient ways to:
1. Check if a datapoint is a match to any of the queries. This can be used to quickly filter out data that isn't going to be needed. 2. Figure out which queries or expressions match a given datapoint.
Map of :eq query to a sub-index. This is used to recursively search the set after finding the first match.
Entries that remain after checking all the simple :eq queries. This list will be searched using a linear scan to get final matching with regex or other more complicated query clauses.