会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Intelligent open query cursor management
    • 智能打开查询光标管理
    • US08768904B2
    • 2014-07-01
    • US11622532
    • 2007-01-12
    • Shawn Joseph BaranczykPaul Reuben DayBrian Robert Muras
    • Shawn Joseph BaranczykPaul Reuben DayBrian Robert Muras
    • G06F7/00G06F17/00G06F17/30G06F15/16
    • G06F17/30442
    • An enhanced mechanism for intelligently managing an open query cursor built from a query access plan (AP) by a query optimizer of a database management system (DBMS). In an embodiment, a cursor management system (CMS) detects whether an open query cursor was previously requested for use within another job. If the open query cursor was previously requested, the CMS intelligently manages the query cursor for subsequent use within a different job. For example, the open query cursor may be recycled for subsequent use within the different job. Hence, system resources are not wasted in building and destroying the same cursors for multiple jobs. Alternatively, the query cursor may be pre-built before the cursor is requested for subsequent use within the different job. The CMS may also obtain, release and re-obtain locks for cursors being managed. Alternatively, the job that uses the cursor may obtain the lock.
    • 一种增强的机制,用于智能地管理由数据库管理系统(DBMS)的查询优化器从查询访问计划(AP)构建的打开查询游标。 在一个实施例中,光标管理系统(CMS)检测先前是否请求在另一个作业中使用的打开查询光标。 如果先前请求了打开的查询光标,CMS将智能地管理查询光标,以便后续在不同的作业中使用。 例如,打开的查询光标可以被再循环以用于不同作业中的后续使用。 因此,系统资源不会浪费在构建和销毁多个作业的相同光标上。 或者,可以在请求光标以在后续使用不同作业之前预建查询光标。 CMS还可以获取,释放和重新获取正在管理的游标的锁。 或者,使用光标的作业可以获得锁定。
    • 2. 发明授权
    • Database query optimization using index carryover to subset an index
    • 数据库查询优化使用索引携带来子集索引
    • US08412700B2
    • 2013-04-02
    • US12013036
    • 2008-01-11
    • Paul Reuben DayRandy L. EganRoger Alan Mittelstadt
    • Paul Reuben DayRandy L. EganRoger Alan Mittelstadt
    • G06F15/16G06F17/20
    • G06F17/30442
    • A method, apparatus and program product use a first index associated with a field in a database table to identify a range of records in the database table that includes instances of a first key value in the field and use the identified range of records to subset a second index associated with another field in a database table. The database query identifies the first key value for the field in the database table and the second key value for the other field in the database table. By doing so, information from an index may be carried over and applied to another index to subset the other index, often reducing the quantity of entries that are searched in the other index and improving performance.
    • 方法,装置和程序产品使用与数据库表中的字段相关联的第一索引来标识数据库表中的记录范围,其包括该字段中的第一键值的实例,并使用所识别的记录范围来子集 与数据库表中另一个字段关联的第二个索引。 数据库查询标识数据库表中字段的第一个键值,数据库表中另一个字段的第二个键值。 通过这样做,来自索引的信息可以被转移并应用于另一个索引以对另一个索引进行子集,通常减少在另一个索引中搜索的条目的数量并提高性能。
    • 4. 发明申请
    • INTELLIGENT PRE-STARTED JOB AFFINITY FOR NON-UNIFORM MEMORY ACCESS COMPUTER SYSTEM
    • 针对非统一存储器访问计算机系统的智能预定工作
    • US20120174108A1
    • 2012-07-05
    • US13421141
    • 2012-03-15
    • Paul Reuben DayBrian Robert Muras
    • Paul Reuben DayBrian Robert Muras
    • G06F9/46
    • G06F9/5033
    • A method, apparatus, and program product select a pre-started job from among a plurality of pre-started jobs in which to perform a task in a computer system with a NUMA configuration. An attempt to perform a task is received as a connection. Information associated with the connection is compared to information associated with a plurality of pre-started jobs. In response to comparing the information, it is determined either that a pre-started job was previously used to perform the task or that no pre-started job was previously used to perform the task. In response to either determination, another pre-started job is determined in which to perform the task. The other pre-started job is determined based on affinity with the task, and may be reallocated to perform the task.
    • 一种方法,装置和程序产品从其中在具有NUMA配置的计算机系统中执行任务的多个预先启动的作业中选择预先启动的作业。 作为连接接收到执行任务的尝试。 与连接相关联的信息与与多个预启动作业相关联的信息进行比较。 响应于比较信息,确定先前启动的作业以前用于执行任务或者没有预先启动的作业以前用于执行任务。 响应于任一确定,确定执行任务的另一预先启动的作业。 另一个预先启动的作业是根据与任务的亲和性确定的,并且可以被重新分配以执行该任务。
    • 7. 发明授权
    • Method and meeting scheduler for automated meeting scheduling using delegates, representatives, quorums and teams
    • 使用代表,代表,法定人数和团队自动会议安排的方法和会议日程安排
    • US07925529B2
    • 2011-04-12
    • US11874228
    • 2007-10-18
    • Brian John CragunPaul Reuben Day
    • Brian John CragunPaul Reuben Day
    • G06Q10/00
    • G06Q10/06311G06Q10/063112G06Q10/109G06Q10/1095
    • A method, meeting scheduler and computer program product are provided for automated meeting scheduling using delegates, representatives, quorums, and teams. Meeting settings and invitees data are stored for a meeting. The meeting settings and invitees data includes invitee attendance type, delegates, representatives, quorums, and teams data. A solution time block for automated meeting scheduling including at least a subset of a plurality of selected invitees is identified utilizing the invitee attendance type, delegates, representatives, quorums, and teams data. A selection score is calculated for each potential time block for automated meeting scheduling utilizing the stored meeting settings and invitees data including the invitee attendance type, delegates, representatives, quorums, and teams data. The solution time block for automated meeting scheduling including a subset of a plurality of selected invitees is identified utilizing the calculated selection score.
    • 提供了一种方法,会议调度程序和计算机程序产品,用于使用代表,代表,法定人数和团队进行自动会议安排。 存储会议设置和被邀请者的数据。 会议设置和受邀者数据包括受邀人员出席类型,代表,代表,法定人数和团队数据。 使用被邀请者出席类型,代表,代表,仲裁和团队数据来识别包括多个被选择的受邀者的至少一个子集的自动会议安排的解决时间块。 使用存储的会议设置来计算用于自动会议安排的每个潜在时间块的选择分数,并且邀请包括被邀请人出席类型,代表,代表,仲裁和团队数据的数据。 使用所计算的选择分数来识别包括多个所选被邀请者的子集的自动会议调度的解决时间块。
    • 8. 发明授权
    • Web server apparatus and method for virus checking
    • 用于病毒检查的Web服务器装置和方法
    • US07895340B2
    • 2011-02-22
    • US11619190
    • 2007-01-03
    • Cary Lee BatesPaul Reuben DayJohn Matthew Santosuosso
    • Cary Lee BatesPaul Reuben DayJohn Matthew Santosuosso
    • G06F15/16G06F11/30G06F12/14
    • G06F21/56G06F21/566H04L63/145
    • A web server computer system includes a virus checker and mechanisms for checking e-mails and their attachments, downloaded files, and web sites for possible viruses. The virus checker allows a web server to perform virus checking of different types of information real-time as the information is requested by a web client. In addition, a web client may also request that the server perform virus checking on a particular drive on the web client. If this case, the web server may receive information from the web client drive, scan the information for viruses, and inform the web client whether any viruses were found. In the alternative, the web server may download a client virus checker to the web client and cause the client virus checker to be run on the web client. The preferred embodiments thus eliminate the need for virus checking software to be installed on each web client.
    • Web服务器计算机系统包括病毒检查器和用于检查电子邮件及其附件,下载的文件和可能的病毒的网站的机制。 病毒检查器允许Web服务器根据Web客户端请求的信息实时执行不同类型信息的病毒检查。 另外,web客户端还可以请求服务器对web客户端上的特定驱动器执行病毒检查。 如果是这种情况,Web服务器可能会从Web客户端驱动器接收信息,扫描病毒信息,并通知Web客户端是否发现任何病毒。 或者,Web服务器可以将客户端病毒检查器下载到web客户端,并使客户端病毒检查器在web客户端上运行。 因此,优选实施例免除了要安装在每个web客户端上的病毒检查软件的需要。
    • 9. 发明授权
    • Background index bimapping for faster query performance
    • 背景索引双击以更快的查询性能
    • US07890495B2
    • 2011-02-15
    • US12027067
    • 2008-02-06
    • Paul Reuben DayBrian Robert Muras
    • Paul Reuben DayBrian Robert Muras
    • G06F7/00G06F17/30
    • G06F17/30324G06F17/30336G06F17/30492Y10S707/99931Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99942
    • A database engine and a system running a database engine utilize a dynamic bitmap updating routine to avoid the delay associated with building an entire bitmap. When running a query on a table, the database engine can build a bitmap over a column of the table that helps avoid unnecessary I/O operations to retrieve records. The database engine initializes the bitmap so that all elements have a value of “1”, or active, and proceeds to scan and retrieve the records of the table according to the bitmap using a first process. Any retrieved record is further analyzed to determine if it is part of the result set. Concurrently, a second process is initiated which continually updates the values within the bitmap according to a set of selection criteria. As the first process continues to operate, more and more elements of the bitmap are set to “0”, or inactive, so that the first process can avoid unnecessary I/O operations.
    • 数据库引擎和运行数据库引擎的系统利用动态位图更新例程来避免与构建整个位图相关的延迟。 在表上运行查询时,数据库引擎可以在表的列上构建位图,以帮助避免不必要的I / O操作来检索记录。 数据库引擎初始化位图,使所有元素的值为“1”或活动,然后继续使用第一个进程根据位图扫描和检索表的记录。 进一步分析任何检索的记录,以确定它是否是结果集的一部分。 同时,启动第二过程,其根据一组选择标准不断更新位图内的值。 当第一个进程继续运行时,位图的越来越多的元素被设置为“0”或不活动,以便第一个进程可以避免不必要的I / O操作。