发明名称 EXPRESSION TREE DATA STRUCTURE FOR REPRESENTING A DATABASE QUERY
摘要 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.
申请公布号 US2010169381(A1) 申请公布日期 2010.07.01
申请号 US20080347091 申请日期 2008.12.31
申请人 INTERNATIONAL BUSINESS MACHINES CORPORATION 发明人 FAUNCE MICHAEL S.;SUGINAKA YASUNOBU
分类号 G06F7/08;G06F17/30 主分类号 G06F7/08
代理机构 代理人
主权项
地址