/* * 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. */ /* * Copyright (C) 2015-present ScyllaDB * * Modified by ScyllaDB */ /* * This file is part of Scylla. * * Scylla is free software: you can redistribute it and/or modify * it under the terms of the GNU Affero General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * Scylla 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 General Public License for more details. * * You should have received a copy of the GNU General Public License * along with Scylla. If not, see . */ #pragma once #include "cql3/statements/raw/select_statement.hh" #include "cql3/cql_statement.hh" #include "cql3/stats.hh" #include #include "transport/messages/result_message.hh" #include "index/secondary_index_manager.hh" namespace service { class client_state; } // namespace service namespace cql3 { class query_processor; namespace selection { class selection; } // namespace selection namespace restrictions { class restrictions; class statement_restrictions; } // namespace restrictions namespace statements { /** * Encapsulates a completely parsed SELECT query, including the target * column family, expression, result count, and ordering clause. * */ class select_statement : public cql_statement { public: using parameters = raw::select_statement::parameters; using ordering_comparator_type = raw::select_statement::ordering_comparator_type; static constexpr int DEFAULT_COUNT_PAGE_SIZE = 10000; protected: static thread_local const lw_shared_ptr _default_parameters; schema_ptr _schema; uint32_t _bound_terms; lw_shared_ptr _parameters; ::shared_ptr _selection; ::shared_ptr _restrictions; ::shared_ptr> _group_by_cell_indices; ///< Indices in result row of cells holding GROUP BY values. bool _is_reversed; ::shared_ptr _limit; ::shared_ptr _per_partition_limit; template using compare_fn = raw::select_statement::compare_fn; using result_row_type = raw::select_statement::result_row_type; /** * The comparator used to orders results when multiple keys are selected (using IN). */ ordering_comparator_type _ordering_comparator; query::partition_slice::option_set _opts; cql_stats& _stats; const ks_selector _ks_sel; bool _range_scan = false; bool _range_scan_no_bypass_cache = false; std::unique_ptr _attrs; protected : virtual future<::shared_ptr> do_execute(service::storage_proxy& proxy, service::query_state& state, const query_options& options) const; friend class select_statement_executor; public: select_statement(schema_ptr schema, uint32_t bound_terms, lw_shared_ptr parameters, ::shared_ptr selection, ::shared_ptr restrictions, ::shared_ptr> group_by_cell_indices, bool is_reversed, ordering_comparator_type ordering_comparator, ::shared_ptr limit, ::shared_ptr per_partition_limit, cql_stats& stats, std::unique_ptr attrs); virtual ::shared_ptr get_result_metadata() const override; virtual uint32_t get_bound_terms() const override; virtual future<> check_access(service::storage_proxy& proxy, const service::client_state& state) const override; virtual void validate(service::storage_proxy&, const service::client_state& state) const override; virtual bool depends_on_keyspace(const sstring& ks_name) const; virtual bool depends_on_column_family(const sstring& cf_name) const; virtual future<::shared_ptr> execute(query_processor& qp, service::query_state& state, const query_options& options) const override; future<::shared_ptr> execute(service::storage_proxy& proxy, lw_shared_ptr cmd, dht::partition_range_vector&& partition_ranges, service::query_state& state, const query_options& options, gc_clock::time_point now) const; struct primary_key { dht::decorated_key partition; clustering_key_prefix clustering; }; future> process_results(foreign_ptr> results, lw_shared_ptr cmd, const query_options& options, gc_clock::time_point now) const; const sstring& keyspace() const; const sstring& column_family() const; query::partition_slice make_partition_slice(const query_options& options) const; ::shared_ptr get_restrictions() const; bool has_group_by() const { return _group_by_cell_indices && !_group_by_cell_indices->empty(); } db::timeout_clock::duration get_timeout(const service::client_state& state, const query_options& options) const; protected: uint64_t do_get_limit(const query_options& options, ::shared_ptr limit, uint64_t default_limit) const; uint64_t get_limit(const query_options& options) const { return do_get_limit(options, _limit, query::max_rows); } uint64_t get_per_partition_limit(const query_options& options) const { return do_get_limit(options, _per_partition_limit, query::partition_max_rows); } bool needs_post_query_ordering() const; virtual void update_stats_rows_read(int64_t rows_read) const { _stats.rows_read += rows_read; } }; class primary_key_select_statement : public select_statement { public: primary_key_select_statement(schema_ptr schema, uint32_t bound_terms, lw_shared_ptr parameters, ::shared_ptr selection, ::shared_ptr restrictions, ::shared_ptr> group_by_cell_indices, bool is_reversed, ordering_comparator_type ordering_comparator, ::shared_ptr limit, ::shared_ptr per_partition_limit, cql_stats &stats, std::unique_ptr attrs); }; class indexed_table_select_statement : public select_statement { secondary_index::index _index; ::shared_ptr _used_index_restrictions; schema_ptr _view_schema; noncopyable_function _get_partition_ranges_for_posting_list; noncopyable_function _get_partition_slice_for_posting_list; public: static constexpr size_t max_base_table_query_concurrency = 4096; static ::shared_ptr prepare(database& db, schema_ptr schema, uint32_t bound_terms, lw_shared_ptr parameters, ::shared_ptr selection, ::shared_ptr restrictions, ::shared_ptr> group_by_cell_indices, bool is_reversed, ordering_comparator_type ordering_comparator, ::shared_ptr limit, ::shared_ptr per_partition_limit, cql_stats &stats, std::unique_ptr attrs); indexed_table_select_statement(schema_ptr schema, uint32_t bound_terms, lw_shared_ptr parameters, ::shared_ptr selection, ::shared_ptr restrictions, ::shared_ptr> group_by_cell_indices, bool is_reversed, ordering_comparator_type ordering_comparator, ::shared_ptr limit, ::shared_ptr per_partition_limit, cql_stats &stats, const secondary_index::index& index, ::shared_ptr used_index_restrictions, schema_ptr view_schema, std::unique_ptr attrs); private: virtual future<::shared_ptr> do_execute(service::storage_proxy& proxy, service::query_state& state, const query_options& options) const override; lw_shared_ptr generate_view_paging_state_from_base_query_results(lw_shared_ptr paging_state, const foreign_ptr>& results, service::storage_proxy& proxy, service::query_state& state, const query_options& options) const; future>> find_index_partition_ranges(service::storage_proxy& proxy, service::query_state& state, const query_options& options) const; future, lw_shared_ptr>> find_index_clustering_rows(service::storage_proxy& proxy, service::query_state& state, const query_options& options) const; future> process_base_query_results( foreign_ptr> results, lw_shared_ptr cmd, service::storage_proxy& proxy, service::query_state& state, const query_options& options, gc_clock::time_point now, lw_shared_ptr paging_state) const; lw_shared_ptr prepare_command_for_base_query(service::storage_proxy& proxy, const query_options& options, service::query_state& state, gc_clock::time_point now, bool use_paging) const; future>, lw_shared_ptr>> do_execute_base_query( service::storage_proxy& proxy, dht::partition_range_vector&& partition_ranges, service::query_state& state, const query_options& options, gc_clock::time_point now, lw_shared_ptr paging_state) const; future> execute_base_query( service::storage_proxy& proxy, dht::partition_range_vector&& partition_ranges, service::query_state& state, const query_options& options, gc_clock::time_point now, lw_shared_ptr paging_state) const; // Function for fetching the selected columns from a list of clustering rows. // It is currently used only in our Secondary Index implementation - ordinary // CQL SELECT statements do not have the syntax to request a list of rows. // FIXME: The current implementation is very inefficient - it requests each // row separately (and, incrementally, in parallel). Even multiple rows from a single // partition are requested separately. This last case can be easily improved, // but to implement the general case (multiple rows from multiple partitions) // efficiently, we will need more support from other layers. // Keys are ordered in token order (see #3423) future>, lw_shared_ptr>> do_execute_base_query( service::storage_proxy& proxy, std::vector&& primary_keys, service::query_state& state, const query_options& options, gc_clock::time_point now, lw_shared_ptr paging_state) const; future> execute_base_query( service::storage_proxy& proxy, std::vector&& primary_keys, service::query_state& state, const query_options& options, gc_clock::time_point now, lw_shared_ptr paging_state) const; virtual void update_stats_rows_read(int64_t rows_read) const override { _stats.rows_read += rows_read; _stats.secondary_index_rows_read += rows_read; } future<::shared_ptr>read_posting_list( service::storage_proxy& proxy, const query_options& options, uint64_t limit, service::query_state& state, gc_clock::time_point now, db::timeout_clock::time_point timeout, bool include_base_clustering_key) const; dht::partition_range_vector get_partition_ranges_for_local_index_posting_list(const query_options& options) const; dht::partition_range_vector get_partition_ranges_for_global_index_posting_list(const query_options& options) const; query::partition_slice get_partition_slice_for_local_index_posting_list(const query_options& options) const; query::partition_slice get_partition_slice_for_global_index_posting_list(const query_options& options) const; bytes compute_idx_token(const partition_key& key) const; }; } }