MySQL
8.4.0
Source Code Documentation
node_map.h
Go to the documentation of this file.
1
/* Copyright (c) 2020, 2024, Oracle and/or its affiliates.
2
3
This program is free software; you can redistribute it and/or modify
4
it under the terms of the GNU General Public License, version 2.0,
5
as published by the Free Software Foundation.
6
7
This program is designed to work with certain software (including
8
but not limited to OpenSSL) that is licensed under separate terms,
9
as designated in a particular file or component or in included license
10
documentation. The authors of MySQL hereby grant you an additional
11
permission to link the program and your derivative works with the
12
separately licensed software that they have either included with
13
the program or referenced in the documentation.
14
15
This program is distributed in the hope that it will be useful,
16
but WITHOUT ANY WARRANTY; without even the implied warranty of
17
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18
GNU General Public License, version 2.0, for more details.
19
20
You should have received a copy of the GNU General Public License
21
along with this program; if not, write to the Free Software
22
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */
23
24
#ifndef SQL_JOIN_OPTIMIZER_NODE_MAP_H
25
#define SQL_JOIN_OPTIMIZER_NODE_MAP_H 1
26
27
#include <stdint.h>
28
29
namespace
hypergraph
{
30
31
/**
32
Since our graphs can never have more than 61 tables, node sets and edge lists
33
are implemented using 64-bit bit sets. This allows for a compact
34
representation and very fast set manipulation; the algorithm does a fair
35
amount of intersections and unions. If we should need extensions to larger
36
graphs later (this will require additional heuristics for reducing the search
37
space), we can use dynamic bit sets, although at a performance cost (we'd
38
probably templatize off the NodeMap type).
39
*/
40
using
NodeMap
= uint64_t;
41
42
}
// namespace hypergraph
43
44
#endif
// SQL_JOIN_OPTIMIZER_NODE_MAP_H
hypergraph
Definition:
hypergraph.cc:30
hypergraph::NodeMap
uint64_t NodeMap
Since our graphs can never have more than 61 tables, node sets and edge lists are implemented using 6...
Definition:
node_map.h:40
sql
join_optimizer
node_map.h
Generated by
1.9.2