公开(公告)号：US20110320431A1

公开(公告)日：2011-12-29

申请号：US12823132

申请日：2010-06-25

申请人： Thomas E. Jackson ,  Stuart M. Bowers ,  Brian S. Aust ,  Chris D. Karkanias ,  Allen L. Brown, JR. ,  David G. Campbell

发明人： Thomas E. Jackson ,  Stuart M. Bowers ,  Brian S. Aust ,  Chris D. Karkanias ,  Allen L. Brown, JR. ,  David G. Campbell

IPC分类号： G06F17/30

CPC分类号： G06F16/24534 ,  G06F16/242

摘要： Described herein is using type information with a graph of nodes and predicates, in which the type information may be used to determine validity of (type check) a query to be executed against the graph. In one aspect, each node has a type, and each predicate indicates a valid relationship between two types of nodes. A type checking mechanism uses the type information to determine whether a query is valid, which may be the entire query prior to query processing/compilation time, or as the query is being composed by a user. One or more valid predicates for a given node may be discovered based upon the node type, such as discovered to assist the user during query composition. Also described is using the type information to optimize the query.

摘要翻译： 这里描述的是使用具有节点和谓词的图形的类型信息，其中可以使用类型信息来确定对图表执行的查询（类型检查）的有效性。 在一个方面，每个节点具有类型，并且每个谓词指示两种类型的节点之间的有效关系。 类型检查机制使用类型信息来确定查询是否有效，其可以是查询处理/编译时间之前的整个查询，或者由查询由用户组成。 可以基于节点类型来发现给定节点的一个或多个有效谓词，例如在查询组合期间被发现以辅助用户。 还描述了使用类型信息优化查询。