中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

48 records (took 0.017 seconds)

    Method of returning data during insert statement processing
    1.
    发明授权
    Method of returning data during insert statement processing 有权
    插入语句处理期间返回数据的方法

    公开(公告)号：US07711730B2

    公开(公告)日：2010-05-04

    申请号：US10744633

    申请日：2003-12-22

    Applicant: Margaret A. Bernal ,  Karelle L. Cornwell ,  Hsuiying Y. Cheng ,  Yao-Ching S. Chen ,  Christopher J. Crone ,  Fen-Ling Lin ,  James W. Pickel ,  Yumi K. Tsuji ,  Julie A. Watts

    Inventor： Margaret A. Bernal ,  Karelle L. Cornwell ,  Hsuiying Y. Cheng ,  Yao-Ching S. Chen ,  Christopher J. Crone ,  Fen-Ling Lin ,  James W. Pickel ,  Yumi K. Tsuji ,  Julie A. Watts

    IPC: G06F7/00 ,  G06F17/30

    CPC classification number: G06F17/30595 ,  G06F17/30463

    Abstract: A method for generating an execution plan for updating and retrieving data from a database in a single process includes: receiving a statement by a server to update a database with a first set of data and to retrieve a second set of data from the database; building a first execution plan to update the database with the first set of data; building a second execution plan to retrieve the second set of data from the database; and building a single execution plan including a combination of the first and second execution plans. The single execution plan allows for the updating and retrieval of data with a single crossing of an interface between a client and the database. By performing both functions in this manner, the efficiency of performing such tasks on the database is significantly increased.

    Abstract translation: 一种用于生成用于在单个进程中从数据库更新和检索数据的执行计划的方法包括：由服务器接收用第一组数据更新数据库的语句，并从数据库中检索第二组数据; 构建第一个执行计划，用第一组数据更新数据库; 构建第二个执行计划以从数据库中检索第二组数据; 并构建包括第一和第二执行计划的组合的单个执行计划。 单个执行计划允许通过客户端和数据库之间的接口的单个​​交叉来更新和检索数据。 通过以这种方式执行这两个功能，在数据库上执行这样的任务的效率显着增加。

    OFF-LOADING STAR JOIN OPERATIONS TO A STORAGE SERVER
    2.
    发明申请
    OFF-LOADING STAR JOIN OPERATIONS TO A STORAGE SERVER 失效
    将负载明星加入到存储服务器中

    公开(公告)号：US20090094258A1

    公开(公告)日：2009-04-09

    申请号：US11866907

    申请日：2007-10-03

    Applicant: YING-LIN CHEN ,  You-Chin Fuh ,  Wei Han ,  Fen-Ling Lin ,  Inderpal Singh Narang ,  Lin Qiao ,  Vijayshankar Raman ,  Kouhorng Allen Yang

    Inventor： YING-LIN CHEN ,  You-Chin Fuh ,  Wei Han ,  Fen-Ling Lin ,  Inderpal Singh Narang ,  Lin Qiao ,  Vijayshankar Raman ,  Kouhorng Allen Yang

    IPC: G06F7/00

    CPC classification number: G06F17/30498

    Abstract: A method, storage server, and computer readable medium for off-loading star-join operations from a host information processing system to a storage server. At least a first and second set of keys from a first and second dimension table, respectively are received from a host system. Each of the first and second set of keys is associated with at least one fact table. A set of locations associated with a set of foreign key indexes are received from the host system. A set of fact table indexes are traversed. At least a first set of Row Identifiers (“RIDs”) associated with the first set of keys and at least a second set of RIDs associated with the second set of keys are identified. An operation is performed on the first and second sets of RIDs to identify an intersecting set of RIDs. The intersecting set of RIDs are then stored.

    Abstract translation: 一种用于从主机信息处理系统到存储服务器的卸载星形连接操作的方法，存储服务器和计算机可读介质。 分别从主机系统接收来自第一和第二维度表的至少第一和第二组密钥。 第一组和第二组中的每一个与至少一个事实表相关联。 从主机系统接收与一组外键索引相关联的一组位置。 遍历一组事实表索引。 识别与第一组密钥相关联的至少第一组行标识符（“RID”）和与第二组密钥相关联的至少第二组RID。 对第一和​​第二组RID执行操作以识别RID的交叉集合。 然后存储相交的RID集合。

    Efficient XML schema validation of XML fragments using annotated automaton encoding
    3.
    发明授权
    Efficient XML schema validation of XML fragments using annotated automaton encoding 失效
    使用注释自动机编码的XML片段的高效XML模式验证

    公开(公告)号：US07437374B2

    公开(公告)日：2008-10-14

    申请号：US10774594

    申请日：2004-02-10

    Applicant: Yao-Ching Stephen Chen ,  Fen-Ling Lin ,  Ning Wang ,  Guogen Zhang

    Inventor： Yao-Ching Stephen Chen ,  Fen-Ling Lin ,  Ning Wang ,  Guogen Zhang

    IPC: G06F17/30

    CPC classification number: G06F17/2725 ,  G06F17/2229 ,  G06F17/2247 ,  Y10S707/99942 ,  Y10S707/99943

    Abstract: An XML schema is compiled into an annotated automaton encoding, which includes a parsing table for structural information and annotation for type information. The representation is extended to include a mapping from schema types to states in a parsing table. To validate a fragment against a schema type, it is necessary simply to determine the state corresponding to the schema type, and start the validation process from that state. When the process returns to the state, fragment validation has reached successful completion. This approach is more efficient than a general tree representation. Only the data representation of the schema information is handled, making it much easier than manipulating validation parser code generated by a parser generator. In addition, only one representation is needed for schema information for both document and fragment validation. This approach also provides a basis for incremental validation after update.

    Abstract translation: XML模式被编译成带注释的自动机编码，其包括用于结构信息的解析表和类型信息的注释。 该表示扩展为包括从模式类型到解析表中的状态的映射。 要根据模式类型验证片段，只需确定与模式类型相对应的状态，并从该状态启动验证过程。 当进程返回到状态时，片段验证已经成功完成。 这种方法比一般的树表示效率更高。 只处理模式信息的数据表示，使得它比操纵解析器生成器生成的验证解析器代码容易得多。 此外，文档和片段验证的模式信息只需要一个表示。 这种方法还为更新后的增量验证提供了基础。

    Method and apparatus for generating dynamic and hybrid sparse indices for workfiles used in SQL queries
    6.
    发明授权
    Method and apparatus for generating dynamic and hybrid sparse indices for workfiles used in SQL queries 失效
    用于生成用于SQL查询的工作文件的动态和混合稀疏索引的方法和装置

    公开(公告)号：US5758145A

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

    申请号：US393803

    申请日：1995-02-24

    Applicant: Gautam Bhargava ,  Paramesh Sampatrai Desai ,  Piyush Goel ,  Peter Hoa ,  Fen-Ling Lin ,  Balakrishna Raghavendra Iyer ,  Jerry Mukai ,  William Samuel Perlman ,  Hong Sang Tie

    Inventor： Gautam Bhargava ,  Paramesh Sampatrai Desai ,  Piyush Goel ,  Peter Hoa ,  Fen-Ling Lin ,  Balakrishna Raghavendra Iyer ,  Jerry Mukai ,  William Samuel Perlman ,  Hong Sang Tie

    IPC: G06F17/30

    CPC classification number: G06F17/30327 ,  Y10S707/99931 ,  Y10S707/99932 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99936 ,  Y10S707/99937

    Abstract: A method, apparatus and article for manufacture for generating static, dynamic and hybrid sparse indices for use with workfiles used by SQL queries in a relational database management system. A workfile and a sparse index structure are temporarily created in the computer during execution of the query by the computer. The workfile stores intermediate relations resulting from execution of a portion of the SQL query, wherein the intermediate relations comprise sorted rows for an inner table referenced in the SQL query. The sparse index structure contains one or more entries indicating at least an approximate location for at least some of the rows in the workfile. As one or more rows from an outer table referenced in the SQL query are retrieved, the entries of the sparse index structure are searched for a closest matching entry for each retrieved row. The sorted workfile is then scanned for a row matching each retrieved row using the closest matching entry from the sparse index structure as a starting position. The sparse index structure is then updated with an entry corresponding to the row from the sorted workfile matching the retrieved row from the outer table.

    Abstract translation: 一种用于生成静态，动态和混合稀疏索引的方法，装置和制品，用于在关系数据库管理系统中用于SQL查询的工作文件。 在计算机执行查询期间，在计算机中临时创建工作文件和稀疏索引结构。 工作文件存储由执行SQL查询的一部分而产生的中间关系，其中中间关系包括在SQL查询中引用的内部表的排序行。 稀疏索引结构包含一个或多个条目，至少指示工作文件中至少一些行的近似位置。 当从SQL查询中引用的外部表中的一行或多行被检索到时，搜索稀疏索引结构的条目以获取每个检索行的最接近的匹配条目。 然后，使用距离稀疏索引结构最接近的匹配条目作为起始位置，扫描排序的工作文件，使其与每个检索到的行相匹配的行。 然后使用与来自外部表的检索到的行匹配的排序工作文件中的行对应的条目来更新稀疏索引结构。

Patent Agency Ranking