会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 91. 发明授权
    • Partial query caching
    • 部分查询缓存
    • US07676453B2
    • 2010-03-09
    • US10830510
    • 2004-04-22
    • Cetin Ozbutun
    • Cetin Ozbutun
    • G06F7/00G06F17/30
    • G06F17/30457Y10S707/99933
    • When a query is performed an execution plan is formed, which is made up of a plurality of plan operators. Before executing any given plan operator, a storage area is checked. If a results set has been stored corresponding to the plan operator, then the cached results set is used instead of the executing the plan operator. If no results set exists that corresponds to the particular plan operator, the plan operator is executed, and the results set that is output may be stored for use by another plan operator of another execution plan.
    • 当执行查询时,形成由多个计划运算符组成的执行计划。 在执行任何给定的计划运算符之前,检查存储区域。 如果对应于计划运算符存储结果集,则使用缓存的结果集而不是执行计划运算符。 如果没有与特定计划运算符相对应的结果集,则执行计划运算符,并且输出的结果集可以存储供另一计划运算符使用。
    • 93. 发明申请
    • Method and Apparatus for Extracting Information From a Database
    • 从数据库提取信息的方法和装置
    • US20100017436A1
    • 2010-01-21
    • US12504695
    • 2009-07-17
    • Hakan WOLGE
    • Hakan WOLGE
    • G06F17/30
    • G06F17/3048G06F17/30457
    • Information is extracted from a database using a computer-implemented method that involves a sequential chain of main calculations, in which a first main calculation (P1) operates a first selection item (S1) on a data set (R0) that represents the database to produce a first result (R1), and a second main calculation (P2) operates a second selection item (S2) on the first result (R1) to produce a second result (R2). The first and second results (R1, R2) are cached in computer memory (10) for re-use in subsequent iterations of the method, thereby reducing the need to execute the first and/or second main calculations (P1, P2) for extracting the information. The caching involves calculating a first selection identifier value (ID1) as a function of at least the first selection item (S1), and a second selection identifier value (ID3) as a function of at least the second selection item (S2) and the first result (R1), and storing the first selection identifier value (ID1) and the first result (R1), and the second selection identifier value (ID3) and the second result (R2), respectively, as associated objects in a data structure (12). Each of the identifier values are generated as a statistically unique digital fingerprint by a hash function (f). The re-use involves calculating the first and second selection identifier values (ID1, ID3) during a subsequent iteration and accessing the data structure (12) to potentially retrieve the first and/or second result (R1, R2).
    • 使用涉及主计算的顺序链的计算机实现的方法从数据库中提取信息,其中第一主计算(P1)在表示数据库的数据集(R0)上操作第一选择项(S1) 产生第一结果(R1),并且第二主计算(P2)对第一结果(R1)操作第二选择项目(S2)以产生第二结果(R2)。 第一和第二结果(R1,R2)被缓存在计算机存储器(10)中,以在该方法的后续迭代中重新使用,从而减少执行用于提取的第一和/或第二主计算(P1,P2)的需要 信息。 缓存涉及根据至少第一选择项目(S1)计算第一选择标识符值(ID1),以及作为至少第二选择项目(S2)的函数的第二选择标识符值(ID3)和 第一结果(R1),并分别存储第一选择标识符值(ID1)和第一结果(R1)和第二选择标识符值(ID3)和第二结果(R2)作为数据结构中的关联对象 (12)。 通过散列函数(f)将每个标识符值生成为统计唯一的数字指纹。 重用涉及在后续迭代期间计算第一和第二选择标识符值(ID1,ID3)并访问数据结构(12)以潜在地检索第一和/或第二结果(R1,R2)。
    • 94. 发明申请
    • Relational database management system (RDBMS) employing a relational datastore and a multi-dimensional database (MDDB) for serving query statements from client machines
    • 使用关系数据存储和多维数据库(MDDB)的关系数据库管理系统(RDBMS)用于从客户机提供查询语句
    • US20090271379A1
    • 2009-10-29
    • US12455664
    • 2009-06-04
    • Reuven BakalashGuy ShakedJoseph Caspi
    • Reuven BakalashGuy ShakedJoseph Caspi
    • G06F17/30G06F7/00
    • G06F17/30592G06F17/30457G06F17/30477G06F17/30489G06F17/3061Y10S707/954Y10S707/957Y10S707/99932Y10S707/99934Y10S707/99935Y10S707/99943
    • A relational database management system (RDBMS) for servicing query statements from one or more client machines, using a relational data store and a multi-dimensional database (MDDB). The RDBMS includes a query interface which is adapted to receive query statements from the client machines, and to generate one or more query requests. The RDBMS includes a query handling mechanism which receives each request from the query interface, extracts a set of dimensions associated with the request, uses the dimensions to retrieve aggregated fact data from the MDDB, and forwards retrieved aggregated fact data to the query processing mechanism for subsequent processing. When the query processing mechanism of the RDBMS determines that servicing one or more query requests requires data stored in the relational tables, then the query handling mechanism automatically routes the requests to the relational data tables, so that data can be accessed from the relational tables and forwarded to the query processing mechanism for use in servicing the requests, in a manner transparent to the client machine. When the query processing mechanism determines that servicing one or more query requests requires aggregated data from the MDDB, then the query handling mechanism automatically routes the requests to the MDDB, so that data can be accessed from the MDDB and forwarded to the query processing mechanism for use in servicing the requests, in a manner transparent to the client machine.
    • 用于使用关系数据存储和多维数据库(MDDB)从一个或多个客户端机器处理查询语句的关系数据库管理系统(RDBMS)。 RDBMS包括一个查询接口,适用于从客户机接收查询语句,并生成一个或多个查询请求。 RDBMS包括查询处理机制,从查询接口接收每个请求,提取与请求相关联的维度集合,使用维度从MDDB检索汇总事实数据,并将检索到的汇总事实数据转发到查询处理机制 后续处理。 当RDBMS的查询处理机制确定服务一个或多个查询请求需要存储在关系表中的数据时,查询处理机制自动将请求路由到关系数据表,从而可以从关系表访问数据, 以对客户端机器透明的方式转发到用于服务请求的查询处理机制。 当查询处理机制确定服务一个或多个查询请求需要来自MDDB的聚合数据时,查询处理机制自动将请求路由到MDDB,从而可以从MDDB访问数据并将其转发到查询处理机制 用于以对客户端机器透明的方式来处理请求。
    • 96. 发明申请
    • METHOD OF FINDING CANDIDATE SUB-QUERIES FROM LONGER QUERIES
    • 从长期查询中查找候选子问题的方法
    • US20090089266A1
    • 2009-04-02
    • US11863045
    • 2007-09-27
    • Sreenivas GollapudiRina Panigrahy
    • Sreenivas GollapudiRina Panigrahy
    • G06F17/30
    • G06F17/30693G06F17/30457
    • A method is disclosed for identifying queries stored in a log which are semantically related to an input query that may include a large number of terms. A set of one or more subsequences are generated for each query stored in the log, and these sets of subsequences are stored in a lookup table. A set of one or more subsequences are also generated for the input query. The subsequences in the lookup table and of the input query are generated by hashing of the respective query terms to a value between 0 and 1 using a known technique of min-hashing. The present system then constructs the subsequences of the query using the k-min hashes of the query, where k is an integer based on the number of terms in the query.
    • 公开了一种用于识别存储在日志中的查询与可能包括大量项目的输入查询语义相关的查询的方法。 为存储在日志中的每个查询生成一组或多个子序列,并将这些子序列存储在查找表中。 还为输入查询生成一组或多个子序列。 查询表和输入查询中的子序列通过使用最小哈希算法的已知技术将相应的查询项散列为0到1之间的值来生成。 本系统然后使用查询的k-min哈希构建查询的子序列,其中k是基于查询中的项数的整数。
    • 98. 发明授权
    • Two-phase commit with queryable caches
    • 两阶段提交可查询的缓存
    • US07401084B1
    • 2008-07-15
    • US09881505
    • 2001-06-14
    • Bipul Binit SinhaAmit GaneshLakshminarayanan Chidambaran
    • Bipul Binit SinhaAmit GaneshLakshminarayanan Chidambaran
    • G06F17/30
    • G06F17/30575G06F17/30457
    • An optimization of the two-phase commit protocol employed in distributed systems. Each cohort component of the distributed system augments messages that are accessible to the coordinator component with state information indicating whether the cohort is read-only with regard to a transaction that the coordinator is coordinating. The coordinator retains the most recent state information. The coordinator reads the retained state information for the cohorts and when the transaction terminates, the coordinator reads the retained state information. Where the cohort's state is read-only, the coordinator simply sends an abort message instead of performing the full two-phase commit protocol with regard to the read-only cohort. In the trees of distributed system components that are defined by transactions, any cohort which has children in the tree is a local coordinator for its children. The general technique of cohorts augmenting messages accessible to a coordinator with state information that is relevant to an action to be performed by the coordinator and the coordinator acting in accordance with state retained from the messages has other uses as well.
    • 分布式系统中采用的两阶段提交协议的优化。 分布式系统的每个队列组件增加协调器组件可访问的消息,状态信息指示该协调器正在协调的关于事务的队列是否为只读。 协调员保留最新的状态信息。 协调器读取队列的保留状态信息,当事务终止时,协调器读取保留的状态信息。 在队列状态为只读状态的情况下,协调器只需发送中止消息,而不是针对只读队列执行完整的两阶段提交协议。 在由事务定义的分布式系统组件的树中,树中有子节点的任何队列都是其子节点的本地协调器。 队列的一般技术将协调器可访问的消息扩展到状态信息,该状态信息与由协调器和协调器执行的动作相关,该协调器和协调器根据从消息保留的状态来执行,还有其他用途。
    • 100. 发明申请
    • Efficient database lookup operations
    • 高效的数据库查找操作
    • US20070255683A1
    • 2007-11-01
    • US11413231
    • 2006-04-28
    • Shaun Cox
    • Shaun Cox
    • G06F17/30
    • G06Q10/10G06F17/30457H04L51/04
    • A system, apparatus, method, and computer-readable media are provided for efficient database lookup operations. According to method, procedural checks for generating a response to a database query are converted into a set of database operations. The database operations are performed the first time a query of the database is received to generate a set of possible results for the query. The set of possible results for the query are then stored. A specific answer to the query is generated from the set of possible results. Future database queries are responded to by generating an answer to the query from the stored set of possible results.
    • 提供了一种用于有效的数据库查找操作的系统,装置,方法和计算机可读介质。 根据方法,用于生成对数据库查询的响应的过程检查被转换成一组数据库操作。 数据库操作首次在接收到数据库的查询时执行,以生成查询的一组可能的结果。 然后存储查询的可能结果集。 查询的具体答案是从一组可能的结果生成的。 通过从存储的可能结果集中生成查询的答案来响应未来的数据库查询。