Invention Grant
US08239406B2 Expression tree data structure for representing a database query 失效
用于表示数据库查询的表达式树数据结构

Expression tree data structure for representing a database query
Abstract:
A method, apparatus and program product are provided for representing a database query expression including a plurality of predicates related to one another by at least one logical relation. A list of operands is generated from the database query expression, where each operand is representative of a predicate. Each operand is mapped into an operand map. A data structure is generated based upon the generated list of operands, where the data structure includes a plurality of nodes. Each node includes an operand identifier that identifies at least one operand based upon the operand map. Each node defines a first logical relation between those predicates in the database query expression that are represented by operands identified by the operand identifier for such node. The nodes are arranged relative to one another in the data structure to define at least a second logical relation among predicates in the database query expression.
Public/Granted literature
Information query
Patent Agency Ranking
0/0