利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

35 条记录 (耗时 0.016 秒)

    MANAGING DATA QUERIES
    1.
    发明公开
    MANAGING DATA QUERIES 审中-公开
    VERWALTUNG VON DATENABFRAGEN

    公开(公告)号：EP2705446A2

    公开(公告)日：2014-03-12

    申请号：EP12721999.6

    申请日：2012-04-30

    申请人： Ab Initio Technology LLC

    发明人： SCHECHTER, Ian ,  ALLIN, Glenn John

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30463 ,  G06F17/30398 ,  G06F17/30436 ,  G06F17/30477 ,  G06F17/30958

    摘要： In one aspect, in general, a method of generating a dataflow graph representing a database query includes receiving a query plan from a plan generator, the query plan representing operations for executing a database query on at least one input representing a source of data, producing a dataflow graph from the query plan, wherein the dataflow graph includes at least one node that represents at least one operation represented by the query plan, and includes at least one link that represents at least one dataflow associated with the query plan, and altering one or more components of the dataflow graph based on at least one characteristic of the at least one input representing the source of data.

    摘要翻译： 一方面，通常，生成表示数据库查询的数据流图的方法包括从计划生成器接收查询计划，所述查询计划表示用于对表示数据源的至少一个输入执行数据库查询的操作，产生 来自所述查询计划的数据流图，其中所述数据流图包括表示由所述查询计划表示的至少一个操作的至少一个节点，并且包括表示与所述查询计划相关联的至少一个数据流的至少一个链接，并且改变一个 基于表示所述数据源的所述至少一个输入的至少一个特征，所述数据流图的多个或多个组件。

    POINT-IN-TIME QUERY METHOD AND SYSTEM
    2.
    发明公开
    POINT-IN-TIME QUERY METHOD AND SYSTEM 审中-公开
    方法和系统时间查询

    公开(公告)号：EP2030125A2

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

    申请号：EP07783994.2

    申请日：2007-05-21

    申请人： Mark Logic Corporation

    发明人： LINDBLAD, Christopher

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30436 ,  G06F17/30923

    摘要： Embodiments of the present invention include storing a plurality of subtrees in a database, the plurality of subtrees representing one or more structured documents. At least one subtree has a birth timestamp indicating a time at which the at least one subtree was created. If a subtree has been obsoleted, the subtree has a death timestamp indicating a time at which the subtree was obsoleted. Embodiments further include receiving a database query comprising a query string and a query timestamp, the query timestamp indicating a historical time for which the query is to apply, and determining an intermediate result list of subtrees. The intermediate result list is filtered to generate a final result list responsive to the database query, the filtering comprising removing subtrees that do not have a birth timestamp, have a birth timestamp later than the query timestamp, or have a death timestamp earlier than the query timestamp.

    Method and system for query processing in a relational database
    4.
    发明公开
    Method and system for query processing in a relational database 失效
    在einer关系数据库中的Verfahren und System zur Abfrageverarbeitung

    公开(公告)号：EP0855656A2

    公开(公告)日：1998-07-29

    申请号：EP98300378.1

    申请日：1998-01-20

    申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION

    发明人： Agarwal, Ramesh Chandra ,  Jhingran, Anant Deep ,  Malkemus, Timothy Ray ,  Padmanabhan, Sriram Kolijivadi

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30436 ,  G06F17/30457 ,  G06F17/30501

    摘要： A method and system is presented for constructing and applying a query processing tree to a relational database. The method/system comprises an automated approach for building a vector block of records using data in multiple input records derived from the relational database and then applying at least one vector operator of the query processing tree to the vector block of records. The approach can also include creating the query processing tree to have multiple vector operators. When applying the query processing tree, multiple vector blocks of records may be employed at the same vector operator or different vector operators. A vector descriptor control block associated with a vector block of records is employed to transfer control of the vector block of records from a first vector operator to a second vector operator in the query processing tree. The at least one vector operator in the query processing tree can comprise a table scan operator, a predicate operator, a sort operator, an aggregation operator, a join operator or a math operator.

    摘要翻译： 提出了一种构建和应用查询处理树到关系数据库的方法和系统。 该方法/系统包括使用从关系数据库导出的多个输入记录中的数据构建记录向量块然后将查询处理树的至少一个向量运算符应用到记录向量块的自动化方法。 该方法还可以包括创建查询处理树以具有多个向量运算符。 当应用查询处理树时，可以在相同向量运算符或不同向量运算符上采用多个记录向量块。 使用与记录的向量块相关联的向量描述符控制块来将查询向量运算符中的记录向量块的控制传送到查询处理树中的第二向量运算符。 查询处理树中的至少一个向量运算符可以包括表扫描运算符，谓词运算符，分类运算符，聚合运算符，连接运算符或数学运算符。

    Database management system with improved indexed accessing
    5.
    发明公开
    Database management system with improved indexed accessing 失效
    Datenbankverwaltungssystem mit verbicultem Indexzugriff

    公开(公告)号：EP0747839A1

    公开(公告)日：1996-12-11

    申请号：EP96108883.8

    申请日：1996-06-03

    申请人： TANDEM COMPUTERS INCORPORATED

    发明人： Leslie, Harry A. ,  Birdsall, David W. ,  Jain, Rohit N. ,  Yaghmai, Hedieh

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30436 ,  G06F17/30321 ,  G06F17/30471 ,  Y10S707/99932 ,  Y10S707/99933

    摘要： A database management system (DBMS) provided with a multi-dimensional improved indexed accessing capability using keyed index searching. Individual search keys are constructed from general expression statements created in the DBMS compiler from search queries supplied to the DBMS. Each key column represents another dimension, and both ranges and IN lists can be specified in the search query and used as the predicate values in multiple columns. Missing predicate values in the search query are interpreted as a specification of the minimum and maximum values for the associated search key column.
    During compile time, the DBMS compiler produces general expressions to be used by the DBMS executor during run time to create the search keys. The DBMS compiler evaluates search queries by associating predicates with clusters and disjunct numbers assigned to each individual disjunct in the search query expression. The DBMS executor uses the general expression from the compiler and eliminates any conflicts among same column predicates, removes redundancies in predicate values and disjuncts and reduces the number of records to be accessed to the minimum required to complete the search query. The individual search keys are generated in the same order as the index to which the search pertains (i.e., increasing or decreasing order).

    摘要翻译： 数据库管理系统（DBMS）使用键控索引搜索提供了多维改进的索引访问能力。 单个搜索关键字是从DBMS编译器中创建的通用表达式语句构建的，该语句由提供给DBMS的搜索查询构成。 每个键列表示另一个维度，并且可以在搜索查询中指定两个范围和IN列表，并将其用作多列中的谓词值。 搜索查询中的缺失谓词值被解释为相关搜索关键字列的最小值和最大值的规范。 在编译期间，DBMS编译器会在运行时生成DBMS执行程序使用的一般表达式来创建搜索关键字。 DBMS编译器通过将谓词与搜索查询表达式中分配给每个单独分离的群集和分离数相关联来评估搜索查询。 DBMS执行程序使用编译器的通用表达式，消除了同一列谓词之间的任何冲突，消除了谓词值和分离中的冗余，并将要访问的记录数减少到完成搜索查询所需的最低限度。 各个搜索关键字的生成顺序与搜索所依赖的索引（即增加或减少的顺序）相同。

    Methods and systems for validating input data
    7.
    发明公开
    Methods and systems for validating input data 审中-公开
    Verfahren und Systeme zur Validierung von Eingabedaten

    公开(公告)号：EP2521049A1

    公开(公告)日：2012-11-07

    申请号：EP12160070.4

    申请日：2012-03-19

    申请人： The Boeing Company

    发明人： Li, Mingyan ,  Wang, Changzhou

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

    CPC分类号： G06F17/30436 ,  G06F21/554

    摘要： Methods and systems for use in validating input data in a computing system. Input data associated with a destination software application, such as a database, is received at a computing system. The input data is forwarded to an intermediate software application, such as a web application. When the input includes one or more patterns, a query produced by the intermediate software application based on the input data is validated, such as by comparing the structure of the query to one or more expected query structures. If the validation succeeds, the query is forwarded to the destination software application. Otherwise, the query is discarded.

    摘要翻译： 用于验证计算系统中输入数据的方法和系统。 在计算系统处接收与诸如数据库的目的地软件应用相关联的输入数据。 输入数据被转发到诸如web应用之类的中间软件应用程序。 当输入包括一个或多个模式时，基于输入数据由中间软件应用产生的查询被验证，诸如通过将查询的结构与一个或多个期望的查询结构相比较来进行验证。 如果验证成功，则将查询转发到目标软件应用程序。 否则，查询将被丢弃。

    VERFAHREN ZUM STEUERN EINES RELATIONALEN DATENBANKSYSTEMS
    8.
    发明公开
    VERFAHREN ZUM STEUERN EINES RELATIONALEN DATENBANKSYSTEMS 审中-公开
    VERFAHREN ZUM STEUERN EINES RELATEDEN DATENBANKSYSTEMS

    公开(公告)号：EP2021952A1

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

    申请号：EP07701305.0

    申请日：2007-02-06

    申请人： Mediareif Möstl & Reif Kommunikations- und Informationstechnologien OEG

    发明人： MÖSTL, Matthias

    IPC分类号： G06F17/30

    CPC分类号： G06F17/30404 ,  G06F17/30433 ,  G06F17/30436 ,  G06F17/30587

    摘要： The invention relates to a relational database system, wherein a request statement which is to be serviced and which comprises key words is initially analysed using a recursive transition network (RTN) and is converted into control commands. Said method comprises the following steps: the RTN is defined in a presetting step by forming RTN modules which are independent from one another, by means of an internal, oriented decision graph and optionally at least one recursive call function; one reference group, which is independent from the RTN modules and the elements thereof referring to the remaining decision graphs released from the first decision graph thereof, is formed; a reference execution step is used and the remaining decision graph that can prescribe the recursive call function, is transversed and an optimum access plan for the relational database system is generated.

    摘要翻译： 本发明涉及一种关系数据库系统，其中要被服务并且包括关键字的请求语句最初使用递归转换网络（RTN）被分析并被转换成控制命令。 所述方法包括以下步骤：在预设步骤中通过形成彼此独立的RTN模块，借助于内部的，定向的决策图和可选的至少一个递归调用函数来定义RTN; 形成一个独立于RTN模块及其元素的参考组，其参考从其第一个决策图释放的剩余决策图; 使用参考执行步骤，并且可以规定递归调用函数的其余决策图被横截，并且生成用于关系数据库系统的最佳访问计划。