利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

56 条记录 (耗时 0.021 秒)

    System and method for defining shapes with which to mine time sequences in computerized databases
    1.
    发明授权
    System and method for defining shapes with which to mine time sequences in computerized databases 失效
    用于定义在计算机化数据库中挖掘时间序列的形状的系统和方法

    公开(公告)号：US5878412A

    公开(公告)日：1999-03-02

    申请号：US947067

    申请日：1997-10-08

    申请人： Rakesh Agrawai ,  Giuseppe Psaila ,  Edward L. Wimmers ,  Mohamed Zait

    发明人： Rakesh Agrawai ,  Giuseppe Psaila ,  Edward L. Wimmers ,  Mohamed Zait

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30548 ,  G06F17/30327 ,  G06F17/30539 ,  Y10S707/99936 ,  Y10S707/99937

    摘要： A system and method including a computer shape definition language are disclosed for defining shapes and mining time sequences that resemble the shapes. The system and method include provisions for establishing a user-defined alphabet that in turn establishes a set of elemental shapes. The system also includes simple yet powerful operators for combining the elemental shapes to define a desired time sequence shape. Moreover, intervals of actual time sequences are mapped into corresponding transition sequences using the alphabet, and the transition sequences are stored in a hierarchical index structure for easily accessing the transition sequences. The index structure is entered with the desired time sequence shape, and the index structure is traversed to identify maximal actual transition sequences which conform to the desired time sequence shape, within user-definable blurry criteria.

    摘要翻译： 公开了一种包括计算机形状定义语言的系统和方法，用于定义类似于形状的形状和挖掘时间序列。 该系统和方法包括用于建立用户定义的字母表的规定，其又建立一组基本形状。 该系统还包括用于组合元素形状以定义期望的时间序列形状的简单而强大的操作符。 此外，使用字母表将实际时间序列的间隔映射到对应的转换序列中，并且将转换序列存储在层次索引结构中以便于访问转换序列。 以期望的时间序列形状输入索引结构，并且遍历索引结构以在用户可定义的模糊标准内识别符合期望时间序列形状的最大实际转换序列。

    Parallel partition-wise aggregation
    4.
    发明授权
    Parallel partition-wise aggregation 有权
    并行分区聚合

    公开(公告)号：US07779008B2

    公开(公告)日：2010-08-17

    申请号：US11060260

    申请日：2005-02-16

    申请人： Benoit Dageville ,  Bhaskar Ghosh ,  Rushan Chen ,  Thierry Cruanes ,  Mohamed Zait

    发明人： Benoit Dageville ,  Bhaskar Ghosh ,  Rushan Chen ,  Thierry Cruanes ,  Mohamed Zait

    IPC分类号： G06F17/30

    CPC分类号： G06F9/4494

    摘要： Techniques are provided for performing a parallel aggregation operation on data that resides in a container, such as a relational table. During generation of the execution plan for the operation, it is determined whether partition-wise aggregation should be performed, based on the grouping keys involved in the aggregation and the partition keys used to partition the container. If partition-wise aggregation is to be performed, then the assignments given to the slave processes that are assigned to scan a container are made on a partition-wise basis. The scan slaves themselves may perform full or partial aggregation (depending on whether they are the only scan slaves assigned to the partition). If the scan slaves perform no aggregation, or only partial aggregation, then the scan slaves redistribute the data items to aggregation slaves that are local to the scan slaves.

    摘要翻译： 提供了用于对驻留在诸如关系表的容器中的数据执行并行聚合操作的技术。 在生成操作的执行计划时，基于聚合中涉及的分组密钥和用于分区容器的分区密钥，确定是否应该执行分区聚合。 如果要执行分区聚合，则分配给分配给扫描容器的从属进程的分配是以分区方式进行的。 扫描从站本身可以执行完全或部分聚合（取决于它们是否是分配给分区的唯一扫描从站）。 如果扫描从站不执行聚合或仅执行部分聚合，则扫描从站将数据项重新分配到扫描从站本地的聚合从站。

    EXTENDED CURSOR SHARING
    5.
    发明申请
    EXTENDED CURSOR SHARING 有权
    扩展光标共享

    公开(公告)号：US20090037404A1

    公开(公告)日：2009-02-05

    申请号：US11831951

    申请日：2007-07-31

    申请人： Allison W. Lee ,  Mohamed Zait

    发明人： Allison W. Lee ,  Mohamed Zait

    IPC分类号： G06F7/04

    CPC分类号： G06F17/30463 ,  G06F17/30471 ,  Y10S707/99933

    摘要： Techniques for sharing cursors are provided. When a new query is issued, a database server determines whether the new query is semantically equivalent to a previous query. If so, then database server computes statistics associated with the new query. Based on the statistics, the database server determines whether compiling the new query would produce an execution plan that satisfies certain criteria. If so, then the cursor is used to execute the new query. In another approach, one cursor sharing technique (CST) is used to determine which cursor to use to execute a first set of semantically-equivalent queries. Statistics are gathered during execution of the first set of queries. The database server determines, based on the statistics, when to switch from using the first CST to a different CST. The different CST is used to determine which cursor to use to execute a second set of queries that are semantically-equivalent to the first set.

    摘要翻译： 提供了共享光标的技术。 当发出新的查询时，数据库服务器确定新查询在语义上等同于先前的查询。 如果是这样，则数据库服务器计算与新查询关联的统计信息。 基于统计信息，数据库服务器确定是否编译新查询将产生满足某些条件的执行计划。 如果是这样，那么游标用于执行新的查询。 在另一种方法中，使用一个游标共享技术（CST）来确定用于执行第一组语义等效查询的游标。 在第一组查询执行期间收集统计信息。 数据库服务器根据统计信息确定何时从使用第一个CST切换到另一个CST。 不同的CST用于确定哪个游标用于执行第二组查询语义上等同于第一组查询。

    Join factorization of union/union all queries
    6.
    发明申请
    Join factorization of union/union all queries 有权
    加入联盟/联盟所有查询的因式分解

    公开(公告)号：US20070219969A1

    公开(公告)日：2007-09-20

    申请号：US11716010

    申请日：2007-03-08

    申请人： Hong Su ,  Rafi Ahmed ,  Allison Lee ,  Mohamed Zait ,  Thierry Cruanes

    发明人： Hong Su ,  Rafi Ahmed ,  Allison Lee ,  Mohamed Zait ,  Thierry Cruanes

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30466 ,  Y10S707/99932

    摘要： Under a type of query transformation referred to herein as join factorization, the branches of an UNION/UNION ALL query that join a common table are combined to reduce accesses to the common table. The transformation can be expressed as (T1 join T2) union all (T1 join T3)=T1 join (T2 union all T3), where T1, T2 and T3 are three tables. A given query may be rewritten in many alternate ways using join factorization. Evaluating each alternative can be expensive. Therefore, the alternatives are generated and evaluated in a way that minimizes the cost of evaluating the alternatives.

    摘要翻译： 在这里称为连接因式分解的一种类型的查询变换中，加入公共表的UNION / UNION ALL查询的分支被组合以减少对公共表的访问。 转换可以表示为（T1连接T2）联合全部（T1连接T3）= T1连接（T2联合全T3），其中T1，T2和T3是三个表。 给定的查询可以使用连接因式分解以许多替代方式重写。 评估每个替代品可能是昂贵的。 因此，以最小化评估替代品的成本的方式生成和评估替代方案。

    Method and mechanism for database partitioning
    9.
    发明申请
    Method and mechanism for database partitioning 有权
    数据库分区的方法和机制

    公开(公告)号：US20050038784A1

    公开(公告)日：2005-02-17

    申请号：US10952390

    申请日：2004-09-27

    申请人： Mohamed Zait ,  Benoit Dageville

    发明人： Mohamed Zait ,  Benoit Dageville

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

    CPC分类号： G06F17/30312 ,  G06F17/30492 ,  Y10S707/99932 ,  Y10S707/99942

    摘要： The present invention is directed to a method and mechanism for partitioning using information not directly located in the object being partitioned. According to an embodiment of the invention, foreign key-primary key relationships are utilized to create join conditions between multiple database tables to implement partitioning of a database object. Also, disclosed are methods and mechanisms to perform partition pruning.

    摘要翻译： 本发明涉及一种使用不直接位于被划分的对象中的信息进行分区的方法和机制。 根据本发明的实施例，利用外键 - 主键关系来创建多个数据库表之间的连接条件以实现数据库对象的分区。 此外，公开了执行分割修剪的方法和机制。

    SQL execution plan baselines
    10.
    发明授权
    SQL execution plan baselines 有权

    公开(公告)号：US09058356B2

    公开(公告)日：2015-06-16

    申请号：US12188678

    申请日：2008-08-08

    申请人： Dinesh Das ,  Cetin Ozbutun ,  Hong Su ,  Mohamed Zait ,  Yali Zhu ,  Mohamed Ziauddin ,  Peter Belknap ,  Khaled Yagoub

    发明人： Dinesh Das ,  Cetin Ozbutun ,  Hong Su ,  Mohamed Zait ,  Yali Zhu ,  Mohamed Ziauddin ,  Peter Belknap ,  Khaled Yagoub

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

    摘要： Approaches, techniques, and mechanisms are disclosed for maintaining a set of baseline query plans for a database command. Except in rare circumstances, a database server may only execute a command according to a baseline plan, even if the database server predicts that a different plan has a lower cost. The set of baseline plans are plans that, for one reason or another, have been determined to provide acceptable actual performance in at least one execution context. When the database server receives a request to execute a particular command, the database server, if possible, always executes the command according to the lowest predicted cost baseline plan. The database server may evolve the plan baseline to include additional plans by generating and testing new plans in response to new requests to execute the database command, or as part of a query optimization or tuning process.