公开(公告)号：US20060287979A1

公开(公告)日：2006-12-21

申请号：US11156500

申请日：2005-06-17

申请人： Thomas Beavin ,  Mengchu Cai ,  Yao-Ching Chen ,  Hsiuying Cheng ,  Fen-Ling Lin ,  Irene Liu ,  Jerry Mukai ,  Demai Ni ,  Yoichi Tsuji ,  Li Xia ,  Ying Zeng

发明人： Thomas Beavin ,  Mengchu Cai ,  Yao-Ching Chen ,  Hsiuying Cheng ,  Fen-Ling Lin ,  Irene Liu ,  Jerry Mukai ,  Demai Ni ,  Yoichi Tsuji ,  Li Xia ,  Ying Zeng

IPC分类号： G06F17/30

CPC分类号： G06F17/30436 ,  G06F17/30442 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99943

摘要： Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.

摘要翻译： 提供了确定查询包括至少一个可以相关或解相关的子查询的技术。 生成表示相关和解相关形式的子查询的查询的内部表示，其中内部表示包括至少一个虚拟表。

公开(公告)号：US20060106758A1

公开(公告)日：2006-05-18

申请号：US10990834

申请日：2004-11-16

申请人： Yao-Ching Chen ,  Irene Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

发明人： Yao-Ching Chen ,  Irene Liu ,  Demai Ni ,  Guogen Zhang ,  Qinghua Zou

IPC分类号： G06F17/00

CPC分类号： G06F17/30595 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99936

摘要： A method generates hierarchical path index keys for single and multiple indexes with one scan of a document. Each data node of the document is scanned and matches to query nodes are identified. A data node matches a query node if the three conditions hold: if it is not the root step, there is a match for the query node in the previous step of the query; the data node matches the query node of the current step; and the edges of the data and query nodes match. A sub-tree of a data node can be skipped if the data node is not matched and its level is less than the fixed levels of the query. The matched data node is then placed in the match stacks corresponding to the match query nodes. The method uses transitivity properties among matching units to reduce the number of states that need to be tracked and to improve the evaluation of path expressions significantly.

摘要翻译： 一种方法是通过文档的一次扫描为单索引和多索引生成分层路径索引键。 对文档的每个数据节点进行扫描，并与查询节点进行匹配。 如果三个条件成立，则数据节点与查询节点相匹配：如果不是根步骤，则查询前一步骤中的查询节点匹配; 数据节点匹配当前步骤的查询节点; 数据和查询节点的边缘匹配。 如果数据节点不匹配且其级别小于查询的固定级别，则可以跳过数据节点的子树。 然后将匹配的数据节点放置在与匹配查询节点相对应的匹配堆栈中。 该方法使用匹配单位之间的传递属性来减少需要跟踪的状态数量，并显着提高路径表达式的评估。

公开(公告)号：US20050114307A1

公开(公告)日：2005-05-26

申请号：US10720252

申请日：2003-11-25

申请人： Ruiping Li ,  Irene Liu ,  Lee-Chin Liu ,  Guogen Zhang

发明人： Ruiping Li ,  Irene Liu ,  Lee-Chin Liu ,  Guogen Zhang

IPC分类号： G06F7/00 ,  G06F17/30

CPC分类号： G06F17/30457 ,  Y02D10/45 ,  Y10S707/99932 ,  Y10S707/99933

摘要： A heuristic approach is used to order materialized view (MW) candidates in a list based on descending order of their reduction power. A query (e.g., SQL query) is then matched with the MVs in the list order, wherein searching is stopped as soon as good enough matching has been found. The query is matched with materialized views in the ordered list by identifying a materialized view candidate as follows: identifying an MV that is not locked by a REFRESH process; identifying a matching MV that does not require a regroup; identifying a matching MV that does not require a rejoin; identifying a matching MV that does not require a residual join; or identifying an MV with largest reduction power from the list of candidates.

摘要翻译： 使用启发式方法根据其降低功率的降序对列表中的物化视图（MW）候选进行排序。 然后，查询（例如，SQL查询）以列表顺序与MV匹配，其中一旦找到足够好的匹配，就停止搜索。 该查询与有序列表中的物化视图匹配，通过识别物化视图候选如下：识别未被REFRESH进程锁定的MV; 识别不需要重组的匹配MV; 识别不需要重新加入的匹配MV; 识别不需要残留连接的匹配MV; 或从候选列表中识别具有最大减少功率的MV。