Adaptive evaluation of text search queries with blackbox scoring functions
    1.
    发明授权
    Adaptive evaluation of text search queries with blackbox scoring functions 失效
    具有黑盒评分功能的文本搜索查询的自适应评估

    公开(公告)号:US07991771B2

    公开(公告)日:2011-08-02

    申请号:US11561949

    申请日:2006-11-21

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30672

    摘要: Disclosed is an evaluation technique for text search with black-box scoring functions, where it is unnecessary for the evaluation engine to maintain details of the scoring function. Included is a description of a system for dealing with blackbox searching, proofs of correctness, as well experimental evidence showing that the performance of the technique is comparable in efficiency to those techniques used in custom-built engines.

    摘要翻译: 公开了一种用于具有黑匣子评分功能的文本搜索的评估技术,其中评估引擎不需要保持评分功能的细节。 包括处理黑箱搜索的系统的描述,正确性的证明,以及实验证据表明该技术的性能与定制引擎中使用的技术的效率相当。

    Method and apparatus for insuring database data integrity without data recovery logging
    2.
    发明授权
    Method and apparatus for insuring database data integrity without data recovery logging 有权
    确保数据库数据完整性的方法和设备,无需进行数据恢复记录

    公开(公告)号:US06651073B1

    公开(公告)日:2003-11-18

    申请号:US09576667

    申请日:2000-05-23

    IPC分类号: G06F1730

    摘要: Database tables which are to be loaded with large data objects are defined with a special logging attribute that causes the associated database management system to suspend recovery logging for the databases so defined, but to continue with logging control information, such as space management changes. During a two-phase commit operation for a database transaction in a distributed system, at each database all modified data pages are written to disk before the end of the phase 1 commit, if the pages have not been previously written. This and other write operations are monitored for errors. If any of the changed data pages cannot be written to disk successfully before the end the phase 1 commit operation, then the transaction is rolled back at all databases.

    摘要翻译: 要加载大数据对象的数据库表将使用特殊的日志记录属性进行定义,这会使相关联的数据库管理系统挂起对所定义的数据库的恢复日志记录,但要继续记录控制信息,例如空间管理更改。 在分布式系统中的数据库事务的两阶段提交操作期间,如果页面未被写入,则在每个数据库中,所有修改的数据页都将在阶段1提交结束之前写入磁盘。 监视这个和其他写操作的错误。 如果在第一阶段提交操作结束之前,任何已更改的数据页面都无法成功写入磁盘,则事务将在所有数据库中回滚。

    Method and apparatus for efficiently recovering from a failure in a database that includes unlogged objects
    3.
    发明授权
    Method and apparatus for efficiently recovering from a failure in a database that includes unlogged objects 有权
    用于从包括未被记录的对象的数据库中的故障有效地恢复的方法和装置

    公开(公告)号:US06567928B1

    公开(公告)日:2003-05-20

    申请号:US09576303

    申请日:2000-05-23

    IPC分类号: G06F1100

    摘要: Database tables which are to be loaded with large data objects (LOBs) are defined with a special logging attribute value. This attribute value causes the database management system to suspend recovery logging for the databases so defined, but to continue with the logging of control information, such as space management changes. Certain control information recovery log entries have a special status indicator. For LOBs, this status indicator is set to cause the associated LOB entry to be marked as invalid when the log entry is reapplied, for example, during a recovery operation from a media failure. Rather than invalidating the entire table, the database management system will only prevent access to the entries which have been invalidated during the recovery process.

    摘要翻译: 要加载大数据对象(LOB)的数据库表将使用特殊的日志记录属性值进行定义。 此属性值导致数据库管理系统挂起对所定义的数据库的恢复日志记录,但继续记录控制信息,例如空间管理更改。 某些控制信息恢复日志条目具有特殊的状态指示符。 对于LOB,当状态指示符被设置为使得当重新应用日志条目时,例如在从介质故障的恢复操作期间,关联的LOB条目被标记为无效。 数据库管理系统不会使整个表无效,而只会阻止对恢复过程中已被无效的条目的访问。

    System and method for avoiding complete index tree traversals in
sequential and almost sequential index probes
    4.
    发明授权
    System and method for avoiding complete index tree traversals in sequential and almost sequential index probes 失效
    用于避免在顺序和几乎顺序的索引探针中完整的索引树遍历的系统和方法

    公开(公告)号:US5748952A

    公开(公告)日:1998-05-05

    申请号:US438558

    申请日:1995-05-10

    IPC分类号: G06F17/30

    摘要: The present invention provides a system and method for utilizing the proximity of keys in sequential or near sequential index probes to avoid complete index tree traversal. Page information from three pages (LAST, PARENT and NEXT) are stored in separate information fields within an Index Lookaside Buffer. The LAST information field contains information on the most recent leaf page accessed during an index probe in a read key or an insert key operation, the PARENT information field contains information on the parent page of the most recently accessed leaf page described in the LAST information field, and the NEXT information field contains information on the most recent leaf page accessed during a fetch-next key or delete key operation. On a subsequent index probe, the LAST, NEXT and PARENT information fields are sequentially analyzed to determine if the search key is contained within the leaf page described by the LAST or NEXT information fields or if the search key is contained within one of the leaf pages pointed to by the parent page described by the PARENT information field. If none of the LAST, NEXT or PARENT information fields identify the leaf page containing the search key then the default root-to-leaf traversal would commence.

    摘要翻译: 本发明提供一种用于利用顺序或近序列索引探针中的密钥接近以避免完整的索引树遍历的系统和方法。 来自三个页面(LAST,PARENT和NEXT)的页面信息存储在索引后备缓冲区中的单独的信息字段中。 LAST信息字段包含在读取键或插入键操作期间在索引探测期间访问的最新叶子页面的信息,PARENT信息字段包含在LAST信息字段中描述的最近访问的叶子页面的父页面上的信息 ,并且NEXT信息字段包含在获取下一个键或删除键操作期间访问的最新叶子页面的信息。 在随后的索引探针中,顺序地分析LAST,NEXT和PARENT信息字段以确定搜索关键字是否包含在由LAST或NEXT信息字段描述的叶子页内,或者如果搜索关键字包含在叶子页之一内 由PARENT信息字段描述的父页指向。 如果LAST,NEXT或PARENT信息字段中没有一个标识包含搜索关键字的叶子页面,则将开始默认的从根到叶遍历。

    Managing a temporal key property in a database management system
    5.
    发明授权
    Managing a temporal key property in a database management system 有权
    管理数据库管理系统中的临时密钥属性

    公开(公告)号:US09104713B2

    公开(公告)日:2015-08-11

    申请号:US13253879

    申请日:2011-10-05

    IPC分类号: G06F17/30 G06F15/16

    摘要: Embodiments provide an approach for efficiently searching a temporal key index as well as enforcing key distinctiveness property in a database table corresponding to the index. For example, by addressing time range overlaps in an index having a sort order for temporal keys, a database management tool of a server system may efficiently process client requests while enforcing a temporal key property in the database table.

    摘要翻译: 实施例提供了一种用于有效地搜索时间密钥索引以及在与索引相对应的数据库表中实施密钥特征属性的方法。 例如,通过在具有用于时间密钥的排序顺序的索引中寻址时间范围重叠,服务器系统的数据库管理工具可以在强制数据库表中的时间密钥属性的同时有效地处理客户端请求。

    Parallelizing I/O processing of index insertions during insertion of data into a database

    公开(公告)号:US09104712B2

    公开(公告)日:2015-08-11

    申请号:US13421935

    申请日:2012-03-16

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30336 G06F17/30345

    摘要: Database elements are inserted into a database object by processing each of a plurality of operations in a sequential order within a first processing round to insert the database elements into the database objects, where processing for at least one operation in the order becomes suspended due to a resource request, and where at least one successive operation is initiated in response to suspension of one or more prior operations to enable prefetching of information for processing the operations. Each suspended operation is re-processed with the prefetched information in one or more additional processing rounds until processing of the operations is completed.

    Rejecting rows when scanning a collision chain
    7.
    发明授权
    Rejecting rows when scanning a collision chain 有权
    扫描碰撞链时拒绝行

    公开(公告)号:US08903831B2

    公开(公告)日:2014-12-02

    申请号:US13248800

    申请日:2011-09-29

    申请人: Robert W. Lyle

    发明人: Robert W. Lyle

    IPC分类号: G06F17/30

    摘要: Provided are techniques for rejecting rows while locating a target row. For a row that is stored in a hash space, a row filter value is generated for that row, and the row filter value is stored with the row. While trying to locate the target row in a collision chain in the hash space, a row filter value is calculated for the target row. For the row in the collision chain, the stored row filter value of the row in the collision chain is compared with the computed row filter value of the target row. In response to determining that the stored row filter value does not match the computed row filter value, it is determined that the row in the collision chain is not the target row.

    摘要翻译: 提供了在定位目标行时拒绝行的技术。 对于存储在散列空间中的行,将为该行生成行过滤器值,并且行过滤器值与行一起存储。 在尝试在散列空间中的碰撞链中定位目标行时,将为目标行计算行过滤器值。 对于碰撞链中的行,将碰撞链中行的存储行过滤器值与目标行的计算行过滤器值进行比较。 响应于确定存储的行过滤器值与计算的行过滤器值不匹配,确定碰撞链中的行不是目标行。

    INDEXING TIMESTAMP WITH TIME ZONE VALUE
    8.
    发明申请
    INDEXING TIMESTAMP WITH TIME ZONE VALUE 有权
    用时区索引TIMESTAMP

    公开(公告)号:US20130013617A1

    公开(公告)日:2013-01-10

    申请号:US13177606

    申请日:2011-07-07

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30336

    摘要: Techniques are described for processing a query to produce query results, the query specifying at least a first timestamp value. Embodiments receive the query for processing and access a database index containing a plurality of database keys. The database index contains one or more database index keys, each of which includes at least a timestamp value and a time zone value. Embodiments compare the first timestamp value specified in the query with a portion of one the database index keys to locate at least a portion of the query results. More specifically, the compared portion of the database index key excludes the time zone value. The located portion of the query results is then retrieved.

    摘要翻译: 描述了用于处理查询以产生查询结果的技术,所述查询指定至少第一时间戳值。 实施例接收用于处理和访问包含多个数据库密钥的数据库索引的查询。 数据库索引包含一个或多个数据库索引关键字,每个索引关键字至少包含时间戳值和时区值。 实施例将查询中指定的第一个时间戳值与数据库索引键的一部分进行比较,以查找查询结果的至少一部分。 更具体地,数据库索引关键字的比较部分排除时区值。 然后检索查询结果的位置部分。

    Latch mechanism for concurrent computing environments

    公开(公告)号:US07013463B2

    公开(公告)日:2006-03-14

    申请号:US09894215

    申请日:2001-06-27

    IPC分类号: G06F9/46

    CPC分类号: G06F9/52

    摘要: A system, method and computer readable medium containing programming structions for an improved latch mechanism for use in a programming environment running concurrent tasks is disclosed. According to one aspect of the present invention, a latch is provided to a first task which is requesting access to a resource. After such access, the first task holds the latch, which is also released from the first task. The first task holding the latch marks the latch stealable, and if the latch is not marked stolen by another task, the first task can mark the latch unstealable. In another embodiment of the present invention, if the first task is provided a latch marked stealable, the resource associated with the stealable latch will be placed in a consistent state before the first task accesses the resource.

    Performing index scans in a database
    10.
    发明授权
    Performing index scans in a database 有权
    在数据库中执行索引扫描

    公开(公告)号:US09087087B2

    公开(公告)日:2015-07-21

    申请号:US13224623

    申请日:2011-09-02

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30306

    摘要: Methods and apparatus, including computer program products, implementing and using techniques for performing an index scan in a database system. A sequence of pages visited during an index scan are dynamically tracked. The tracking includes tracking the number of page accesses requiring a wait for input or output. It is determined whether prefetching of an object is desirable. The determination being made at least in part based on the number of page accesses requiring a wait for input or output. If prefetching is desirable, a prefetching method is selected among a set of available prefetching methods. An effectiveness of the selected prefetching method is continuously monitored by tracking the sequence of pages accessed and available access methods. A different prefetching method is selected from the set of available prefetching methods if the different prefetching method has a better effectiveness for a portion of the index that is being scanned.

    摘要翻译: 方法和装置,包括计算机程序产品,在数据库系统中执行索引扫描的实现和使用技术。 在索引扫描期间访问的页面序列被动态跟踪。 跟踪包括跟踪需要等待输入或输出的页面访问次数。 确定对象的预取是否期望。 该确定至少部分地基于需要等待输入或输出的页面访问的数量进行。 如果期望预取,则在一组可用预取方法中选择预取方法。 通过跟踪访问页面的顺序和可用的访问方法来连续监视所选预取方法的有效性。 如果不同的预取方法对于正在扫描的索引的一部分具有更好的有效性,则从可用预取方法集合中选择不同的预取方法。