2018-12-13 14:47:20 -05:00
---
layout: doc_page
title: "Search Queries"
---
2018-11-13 12:38:37 -05:00
<!--
~ Licensed to the Apache Software Foundation (ASF) under one
~ or more contributor license agreements. See the NOTICE file
~ distributed with this work for additional information
~ regarding copyright ownership. The ASF licenses this file
~ to you 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.
-->
2015-05-05 17:07:32 -04:00
# Search Queries
2018-12-12 23:42:12 -05:00
2015-05-05 17:07:32 -04:00
A search query returns dimension values that match the search specification.
```json
{
"queryType": "search",
"dataSource": "sample_datasource",
"granularity": "day",
"searchDimensions": [
"dim1",
"dim2"
],
"query": {
"type": "insensitive_contains",
"value": "Ke"
},
"sort" : {
"type": "lexicographic"
},
"intervals": [
"2013-01-01T00:00:00.000/2013-01-03T00:00:00.000"
]
}
```
There are several main parts to a search query:
|property|description|required?|
|--------|-----------|---------|
2019-04-19 18:52:26 -04:00
|queryType|This String should always be "search"; this is the first thing Apache Druid (incubating) looks at to figure out how to interpret the query.|yes|
2015-05-05 17:07:32 -04:00
|dataSource|A String or Object defining the data source to query, very similar to a table in a relational database. See [DataSource ](../querying/datasource.html ) for more information.|yes|
|granularity|Defines the granularity of the query. See [Granularities ](../querying/granularities.html ).|yes|
|filter|See [Filters ](../querying/filters.html ).|no|
2019-02-28 21:10:39 -05:00
|limit| Defines the maximum number per Historical process (parsed as int) of search results to return. |no (default to 1000)|
2015-05-05 17:07:32 -04:00
|intervals|A JSON Object representing ISO-8601 Intervals. This defines the time ranges to run the query over.|yes|
|searchDimensions|The dimensions to run the search over. Excluding this means the search is run over all dimensions.|no|
|query|See [SearchQuerySpec ](../querying/searchqueryspec.html ).|yes|
2016-07-29 18:44:16 -04:00
|sort|An object specifying how the results of the search should be sorted.< br /> Possible types are "lexicographic" (the default sort), "alphanumeric", "strlen", and "numeric".< br /> See [Sorting Orders ](./sorting-orders.html ) for more details.|no|
2015-05-05 17:07:32 -04:00
|context|See [Context ](../querying/query-context.html )|no|
The format of the result is:
```json
[
{
"timestamp": "2012-01-01T00:00:00.000Z",
"result": [
{
"dimension": "dim1",
2016-03-15 20:22:18 -04:00
"value": "Ke$ha",
"count": 3
2015-05-05 17:07:32 -04:00
},
{
"dimension": "dim2",
2016-03-15 20:22:18 -04:00
"value": "Ke$haForPresident",
"count": 1
2015-05-05 17:07:32 -04:00
}
]
},
{
"timestamp": "2012-01-02T00:00:00.000Z",
"result": [
{
"dimension": "dim1",
2016-03-15 20:22:18 -04:00
"value": "SomethingThatContainsKe",
"count": 1
2015-05-05 17:07:32 -04:00
},
{
"dimension": "dim2",
2016-03-15 20:22:18 -04:00
"value": "SomethingElseThatContainsKe",
"count": 2
2015-05-05 17:07:32 -04:00
}
]
}
]
```
2017-01-10 21:04:20 -05:00
### Implementation details
#### Strategies
Search queries can be executed using two different strategies. The default strategy is determined by the
2019-01-30 22:41:07 -05:00
"druid.query.search.searchStrategy" runtime property on the Broker. This can be overridden using "searchStrategy" in the
2017-01-10 21:04:20 -05:00
query context. If neither the context field nor the property is set, the "useIndexes" strategy will be used.
- "useIndexes" strategy, the default, first categorizes search dimensions into two groups according to their support for
bitmap indexes. And then, it applies index-only and cursor-based execution plans to the group of dimensions supporting
bitmaps and others, respectively. The index-only plan uses only indexes for search query processing. For each dimension,
it reads the bitmap index for each dimension value, evaluates the search predicate, and finally checks the time interval
and filter predicates. For the cursor-based execution plan, please refer to the "cursorOnly" strategy. The index-only
plan shows low performance for the search dimensions of large cardinality which means most values of search dimensions
are unique.
- "cursorOnly" strategy generates a cursor-based execution plan. This plan creates a cursor which reads a row from a
queryableIndexSegment, and then evaluates search predicates. If some filters support bitmap indexes, the cursor can read
only the rows which satisfy those filters, thereby saving I/O cost. However, it might be slow with filters of low selectivity.
- "auto" strategy uses a cost-based planner for choosing an optimal search strategy. It estimates the cost of index-only
and cursor-based execution plans, and chooses the optimal one. Currently, it is not enabled by default due to the overhead
of cost estimation.
#### Server configuration
The following runtime properties apply:
|Property|Description|Default|
|--------|-----------|-------|
|`druid.query.search.searchStrategy`|Default search query strategy.|useIndexes|
#### Query context
The following query context parameters apply:
|Property|Description|
|--------|-----------|
|`searchStrategy`|Overrides the value of `druid.query.search.searchStrategy` for this query.|