aboutsummaryrefslogtreecommitdiffstats
path: root/contrib/clickhouse/src/TableFunctions/TableFunctionDictionary.cpp
blob: f0060acb4119a959388e443156d33f7064a3822f (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
#include <TableFunctions/TableFunctionDictionary.h>

#include <Parsers/ASTLiteral.h>

#include <DataTypes/DataTypeArray.h>
#include <DataTypes/DataTypeString.h>
#include <DataTypes/DataTypesNumber.h>

#include <Interpreters/Context.h>
#include <Interpreters/ExternalDictionariesLoader.h>
#include <Interpreters/evaluateConstantExpression.h>

#include <Storages/StorageDictionary.h>
#include <Storages/checkAndGetLiteralArgument.h>

#include <TableFunctions/TableFunctionFactory.h>

namespace DB
{

namespace ErrorCodes
{
    extern const int LOGICAL_ERROR;
    extern const int NUMBER_OF_ARGUMENTS_DOESNT_MATCH;
}

void TableFunctionDictionary::parseArguments(const ASTPtr & ast_function, ContextPtr context)
{
    // Parse args
    ASTs & args_func = ast_function->children;

    if (args_func.size() != 1)
        throw Exception(ErrorCodes::LOGICAL_ERROR, "Table function ({}) must have arguments.", quoteString(getName()));

    ASTs & args = args_func.at(0)->children;

    if (args.size() != 1)
        throw Exception(ErrorCodes::NUMBER_OF_ARGUMENTS_DOESNT_MATCH, "Table function ({}) requires 1 arguments", quoteString(getName()));

    for (auto & arg : args)
        arg = evaluateConstantExpressionOrIdentifierAsLiteral(arg, context);

    dictionary_name = checkAndGetLiteralArgument<String>(args[0], "dictionary_name");
}

ColumnsDescription TableFunctionDictionary::getActualTableStructure(ContextPtr context, bool /*is_insert_query*/) const
{
    const ExternalDictionariesLoader & external_loader = context->getExternalDictionariesLoader();
    std::string resolved_name = external_loader.resolveDictionaryName(dictionary_name, context->getCurrentDatabase());
    auto load_result = external_loader.load(resolved_name);
    if (load_result)
    {
        /// for regexp tree dictionary, the table structure will be different with dictionary structure. it is:
        /// - id. identifier of the tree node
        /// - parent_id.
        /// - regexp. the regular expression
        /// - keys. the names of attributions of dictionary structure
        /// - values. the values of each attribution
        const auto dictionary = std::static_pointer_cast<const IDictionary>(load_result);
        if (dictionary->getTypeName() == "RegExpTree")
        {
            return ColumnsDescription(NamesAndTypesList({
                {"id", std::make_shared<DataTypeUInt64>()},
                {"parent_id", std::make_shared<DataTypeUInt64>()},
                {"regexp", std::make_shared<DataTypeString>()},
                {"keys", std::make_shared<DataTypeArray>(std::make_shared<DataTypeString>())},
                {"values", std::make_shared<DataTypeArray>(std::make_shared<DataTypeString>())}
            }));
        }
    }

    /// otherwise, we get table structure by dictionary structure.
    auto dictionary_structure = external_loader.getDictionaryStructure(dictionary_name, context);
    return ColumnsDescription(StorageDictionary::getNamesAndTypes(dictionary_structure));

}

StoragePtr TableFunctionDictionary::executeImpl(
    const ASTPtr &, ContextPtr context, const std::string & table_name, ColumnsDescription, bool is_insert_query) const
{
    StorageID dict_id(getDatabaseName(), table_name);
    auto dictionary_table_structure = getActualTableStructure(context, is_insert_query);

    auto result = std::make_shared<StorageDictionary>(
        dict_id, dictionary_name, std::move(dictionary_table_structure), String{}, StorageDictionary::Location::Custom, context);

    return result;
}

void registerTableFunctionDictionary(TableFunctionFactory & factory)
{
    factory.registerFunction<TableFunctionDictionary>();
}

}