blob: 4771e3eddd72f565e919e62c55d70b2c76fab2dc [file] [log] [blame]
* 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
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
#include <map>
#include <memory>
#include <string>
#include <vector>
#include "query_optimizer/expressions/AttributeReference.hpp"
#include "query_optimizer/expressions/ExpressionUtil.hpp"
#include "query_optimizer/logical/Logical.hpp"
#include "utility/Macros.hpp"
#include "utility/StringUtil.hpp"
namespace quickstep {
class CatalogDatabase;
class ParseString;
namespace optimizer {
namespace resolver {
/** \addtogroup QueryResolver
* @{
* @brief Manages name scopes and resolves identifiers (e.g. relation and
* attribute names) in a parse tree.
class NameResolver {
* @brief Constructor.
* @param parent_resolver The NameResolver inherited from the outer query.
* NULL if there is no outer query.
explicit NameResolver(const NameResolver *parent_resolver = nullptr)
: parent_resolver_(parent_resolver) {}
* @brief Adds the attributes of the relation produced by \p logical
* into the name scope.
* @exception Throws a SqlError if the relation name already exists.
* @note Does not take ownership of \p parse_rel_name.
* @param parse_rel_name The parse node of the relation name. Cannot be NULL.
* @param logical The logical operator that outputs the relation.
void addRelation(
const ParseString *parse_rel_name,
const logical::LogicalPtr &logical);
* @brief Returns the AttributeReference with the given attribute name and
* relation name.
* @exception Throws a SqlError if the relation/attribute is not found or the
* attribute name is ambiguous.
* @note Does not take ownership of the two arguments.
* @param parse_attr_node The parser node for the attribute name. Cannot be
* @param parse_rel_node The parser node for the relation name. Maybe NULL.
* @return The AttributeReference.
expressions::AttributeReferencePtr lookup(
const ParseString *parse_attr_node,
const ParseString *parse_rel_node) const;
* @brief Combines the name scopes in the current name resolver and in \p other.
* The ownership of <relations_> in \p other will be transferred to the
* current name resolver.
* @param other The name resolver to be merged into this resolver.
void merge(NameResolver *other);
* @return All AttributeReferences in the current name scope.
std::vector<expressions::AttributeReferencePtr> getVisibleAttributeReferences() const;
* @brief Determines whether \p name is an internal name.
* All internal names are empty.
* @param name The string name to check.
* @return True if \p name is an internal name.
static bool IsInternalName(const std::string &name) { return name.empty(); }
* @brief Generates an internal alias from \p name.
* @param name The base string to compose the internal alias.
* @return An internal alias.
static std::string GenerateInternalAlias(const std::string &name) {
return std::string("$").append(name);
* @return Get the index in the NameResolver for the next relation.
std::size_t nextScopedRelationPosition() const {
return relations_.size();
* @brief Make the output attributes of all the relations with indices between
* start_relation_id and end_relation_id (excluded) to be nullable.
* @param start_relation_id The starting index of the relation for which
* the nullability of output attributes should be changed.
* @param end_relation_id The ending relation index.
void makeOutputAttributesNullable(std::size_t start_relation_id,
std::size_t end_relation_id) {
for (std::size_t idx = start_relation_id; idx < end_relation_id; ++idx) {
relations_[idx]->attributes =
* @brief Info of a relation and its visible attributes in the name scope.
struct RelationInfo {
explicit RelationInfo(const ParseString &parse_relation_name_in,
const logical::LogicalPtr &logical_in)
: parse_relation_name(parse_relation_name_in),
attributes(logical->getOutputAttributes()) {
int current_attribute_index = 0;
for (const expressions::AttributeReferencePtr &attribute : attributes) {
if (!IsInternalName(attribute->attribute_name())) {
const std::string lower_attr_name =
if (name_to_attribute_index_map.find(lower_attr_name) !=
name_to_attribute_index_map.end()) {
// Use -1 to indicate an ambiguous attribute name.
name_to_attribute_index_map[lower_attr_name] = -1;
} else {
name_to_attribute_index_map[lower_attr_name] =
// Finds an attribute with the value of <parse_attr_node> from the current
// relation. Returns NULL if no attribute with the given name is found.
expressions::AttributeReferencePtr findAttributeByName(const ParseString *parse_attr_node) const;
const ParseString &parse_relation_name;
logical::LogicalPtr logical;
std::vector<expressions::AttributeReferencePtr> attributes;
// Map from attribute name to the index in <attributes>.
// For an ambiguous attribute, the value is -1.
std::map<std::string, int> name_to_attribute_index_map;
const NameResolver *parent_resolver_;
* @brief Relation info in the name scope.
std::vector<std::unique_ptr<RelationInfo>> relations_;
* @brief Map from relation name to relation info.
std::map<std::string, const RelationInfo *> rel_name_to_rel_info_map_;
/** @} */
} // namespace resolver
} // namespace optimizer
} // namespace quickstep