A join is defined by two names and a numerical expression. More...
#include <qExpr.h>
Inheritance diagram for ibis::deprecatedJoin:
Public Member Functions | |
| deprecatedJoin (const char *n1, const char *n2) | |
| deprecatedJoin (const char *n1, const char *n2, ibis::math::term *x) | |
| virtual deprecatedJoin * | dup () const |
| !< Reorder the expressions tree. More... | |
| const char * | getName1 () const |
| const char * | getName2 () const |
| ibis::math::term * | getRange () |
| const ibis::math::term * | getRange () const |
| virtual uint32_t | nItems () const |
| Count the number of items in the query expression. | |
| virtual void | print (std::ostream &out) const |
| Print out the node in the string form. More... | |
| virtual void | printFull (std::ostream &out) const |
| Print out the full expression. More... | |
| void | setRange (ibis::math::term *t) |
 Public Member Functions inherited from ibis::qExpr | |
| bool | directEval () const |
| Can the expression be directly evaluated? | |
| void | extractDeprecatedJoins (std::vector< const deprecatedJoin * > &) const |
| Extract conjunctive terms of the deprecated joins. | |
| qRange * | findRange (const char *vname) |
| Find the first range condition involving the named variable. | |
| void | getConjunctiveTerms (termTableList &) const |
| Extract the top-level conjunctive terms. More... | |
| qExpr *& | getLeft () |
| Return a pointer to the left child. More... | |
| const qExpr * | getLeft () const |
| Return a const pointer to the left child. | |
| qExpr *& | getRight () |
| Return a pointer to the right child. More... | |
| const qExpr * | getRight () const |
| Return a const pointer to the right child. | |
| virtual void | getTableNames (std::set< std::string > &plist) const |
| Identify the data partitions involved in the query expression. More... | |
| TYPE | getType () const |
| Return the node type. | |
| virtual bool | isConstant () const |
| Is this expression a constant? A constant remains the same not matter which row it is applied to. More... | |
| virtual bool | isSimple () const |
| Is the expression simple? A simple expression contains only range conditions connected with logical operators. More... | |
| bool | isTerminal () const |
| Is this expression a terminal node of an expression tree? | |
| qExpr & | operator= (const qExpr &rhs) |
| Assignment operator. | |
| qExpr () | |
| Default constructor. It generates a node of undefined type. | |
| qExpr (TYPE op) | |
| Construct a node of specified type. Not for implicit type conversion. | |
| qExpr (TYPE op, qExpr *qe1, qExpr *qe2) | |
| Construct a full specified node. More... | |
| qExpr (const qExpr &qe) | |
| Copy Constructor. Deep copy. | |
| double | reorder (const weight &) |
| After reordering, the lightest weight is one the left side of a group of commutable operators. More... | |
| int | separateSimple (ibis::qExpr *&simple, ibis::qExpr *&tail) const |
| Separate an expression tree into two connected with an AND operator. More... | |
| void | setLeft (qExpr *expr) |
| Change the left child. More... | |
| void | setRight (qExpr *expr) |
| Change the right child. More... | |
| void | swap (qExpr &rhs) |
| Swap the content. No exception expected. | |
| virtual | ~qExpr () |
| Destructor. More... | |
Additional Inherited Members | |
| Public Types inherited from ibis::qExpr | |
| enum | COMPARE { OP_UNDEFINED, OP_LT, OP_GT, OP_LE, OP_GE, OP_EQ } |
| Comparison operator supported in RANGE. | |
| typedef std::vector< TTN > | termTableList |
| enum | TYPE { LOGICAL_UNDEFINED, LOGICAL_NOT, LOGICAL_AND, LOGICAL_OR, LOGICAL_XOR, LOGICAL_MINUS, RANGE, DRANGE, STRING, ANYSTRING, KEYWORD, ALLWORDS, COMPRANGE, MATHTERM, DEPRECATEDJOIN, TOPK, EXISTS, ANYANY, LIKE, INTHOD, UINTHOD } |
| Definition of node types. More... | |
| Static Public Member Functions inherited from ibis::qExpr | |
| static std::string | extractTableName (const char *) |
| Extract the data partition name from the column name cn. More... | |
| static void | simplify (ibis::qExpr *&) |
| Attempt to simplify the query expressions. More... | |
| static void | splitColumnName (const char *, std::string &, std::string &) |
| Split the incoming name into data partition name and column name. More... | |
| Protected Member Functions inherited from ibis::qExpr | |
| void | adjust () |
| Adjust the tree to favor the sequential evaluation order. More... | |
| Protected Attributes inherited from ibis::qExpr | |
| qExpr * | left |
| The left child. | |
| qExpr * | right |
| The right child. | |
| TYPE | type |
| The type of node. More... | |
Detailed Description
A join is defined by two names and a numerical expression.
If the numerical expression is not specified, it is a standard equal-join, 'name1 = name2'. If the numerical expression is specified, it is a range-join, 'name1 between name2 - expr and name2 + expr'.
Member Function Documentation
|
inlinevirtual |
!< Reorder the expressions tree.
Duplicate this query expression. Return the pointer to the new object.
Reimplemented from ibis::qExpr.
References ibis::math::term::dup().
|
virtual |
Print out the node in the string form.
The short-form of the print function.
It only prints information about the current node of the query expression tree.
Reimplemented from ibis::qExpr.
Referenced by printFull().
|
inlinevirtual |
Print out the full expression.
The long form of the print function.
It recursively prints out the whole query expression tree, which can be quite long.
Reimplemented from ibis::qExpr.
References print().
The documentation for this class was generated from the following files:
- qExpr.h
- qExpr.cpp
