公开(公告)号：US06272503B1

公开(公告)日：2001-08-07

申请号：US08865693

申请日：1997-05-30

申请人： William H. Bridge, Jr. ,  Jonathan D. Klein ,  J. William Lee ,  Juan R. Loaiza ,  Alex Tsukerman ,  GianFranco Putzolu

发明人： William H. Bridge, Jr. ,  Jonathan D. Klein ,  J. William Lee ,  Juan R. Loaiza ,  Alex Tsukerman ,  GianFranco Putzolu

IPC分类号： G06F1730

CPC分类号： G06F17/30952 ,  Y10S707/959 ,  Y10S707/99937 ,  Y10S707/99942 ,  Y10S707/99955

摘要： A database containing datafiles is partitioned into a set of tablespaces. Every disk pointer pointing to a data item in a datafile refers to a tablespace-relative file number for the datafile. Data pointed to by a tablespace-relative disk pointer is retrieved by first checking the cache, and upon a cache miss, the tablespace-relative file number is translated into an absolute file number according to a latch-free look up technique.

摘要翻译： 包含数据文件的数据库被分成一组表空间。 指向数据文件中的数据项的每个磁盘指针是指数据文件的表空间相对文件编号。 通过首先检查缓存来检索由表空间相对磁盘指针指向的数据，并且在高速缓存未命中时，根据无闩锁查询技术将表空间相对文件号转换为绝对文件号。

公开(公告)号：US6012060A

公开(公告)日：2000-01-04

申请号：US865651

申请日：1997-05-30

申请人： Juan R. Loaiza ,  Neil Macnaughton ,  Roger J. Bamford ,  William H. Bridge ,  Boris Klots

发明人： Juan R. Loaiza ,  Neil Macnaughton ,  Roger J. Bamford ,  William H. Bridge ,  Boris Klots

IPC分类号： G06F17/30

CPC分类号： G06F9/52 ,  Y10S707/99938 ,  Y10S707/99953

摘要： A method for preventing multiple pings. An embodiment of the invention detects requests of data blocks entailing pings likely to cause additional pings. The servicing of requests involving a pings likely to cause additional pings is deferred until a service enabling conditions occurs. Another embodiment of the invention detects situations where by further updating a data block before pinging the data block use of resources on the remote node requesting the data block are reduced. The servicing of the request for the data block is deferred until a service enabling conditions occurs.

摘要翻译： 一种防止多次ping的方法。 本发明的一个实施例检测到可能导致额外ping的点的数据块的请求。 涉及可能引起额外波的呼吸的请求的服务被推迟到发生服务使能条件。 本发明的另一实施例检测在ping数据块之前进一步更新数据块的情况，数据块在远程节点上的资源使用被请求数据块减少。 对数据块的请求的服务被延迟，直到发生服务使能条件。

公开(公告)号：US5778442A

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

申请号：US621655

申请日：1996-03-25

申请人： Ahmed Ezzat ,  Juan R. Loaiza

发明人： Ahmed Ezzat ,  Juan R. Loaiza

IPC分类号： G06F13/38 ,  G06F13/00

CPC分类号： G06F13/385

摘要： A method and apparatus for replacing data in a list of buffers is provided. The list of buffers has a hot end and a cold end. The buffers at the hot end are maintained in a FIFO list and the buffers at the cold end are maintained in an LRU list. Requested data is located and, if the requested data is located in the LRU portion of the buffer list, the buffer containing the requested data is moved to the head of the FIFO list. If the data is located in a buffer in the FIFO portion of the buffer list, no rearrangement is required. If the requested data is not located in the buffer list, the data is stored into the buffer at the tail end of the LRU list, then the buffer is moved to the head of the FIFO list.

摘要翻译： 提供了用于替换缓冲器列表中的数据的方法和装置。 缓冲区列表具有热端和冷端。 热端的缓冲区保存在FIFO列表中，冷端的缓冲区保持在LRU列表中。 定位请求的数据，如果请求的数据位于缓冲区列表的LRU部分，则包含所请求的数据的缓冲区被移动到FIFO列表的头部。 如果数据位于缓冲区列表的FIFO部分的缓冲区中，则不需要重新排列。 如果请求的数据不在缓冲区列表中，数据将被存储到LRU列表尾端的缓冲区中，则缓冲区被移动到FIFO列表的头部。

公开(公告)号：US10430338B2

公开(公告)日：2019-10-01

申请号：US12691146

申请日：2010-01-21

申请人： Kothanda Umamageswaran ,  Juan R. Loaiza ,  Umesh Panchaksharaiah ,  Alexander Tsukerman ,  Timothy L. Shetler ,  Bharat C. V. Baddepudi ,  Boris Erlikhman ,  Kiran B. Goyal ,  Nilesh Choudhury ,  Susy Fan ,  Poojan Kumar ,  Selcuk Aya ,  Sue-Kyoung Lee

发明人： Kothanda Umamageswaran ,  Juan R. Loaiza ,  Umesh Panchaksharaiah ,  Alexander Tsukerman ,  Timothy L. Shetler ,  Bharat C. V. Baddepudi ,  Boris Erlikhman ,  Kiran B. Goyal ,  Nilesh Choudhury ,  Susy Fan ,  Poojan Kumar ,  Selcuk Aya ,  Sue-Kyoung Lee

IPC分类号： G06F12/08 ,  G06F12/084 ,  G06F16/2455 ,  G06F12/0888 ,  G06F12/0811 ,  G06F12/0866

摘要： Techniques are provided for using an intermediate cache to provide some of the items involved in a scan operation, while other items involved in the scan operation are provided from primary storage. Techniques are also provided for determining whether to service an I/O request for an item with a copy of the item that resides in the intermediate cache based on factors such as a) an identity of the user for whom the I/O request was submitted, b) an identity of a service that submitted the I/O request, c) an indication of a consumer group to which the I/O request maps, d) whether the I/O request is associated with an offloaded filter provided by the database server to the storage system, or e) whether the intermediate cache is overloaded. Techniques are also provided for determining whether to store items in an intermediate cache in response to the items being retrieved, based on logical characteristics associated with the requests that retrieve the items.

公开(公告)号：US08595248B2

公开(公告)日：2013-11-26

申请号：US12469637

申请日：2009-05-20

申请人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

发明人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

IPC分类号： G06F17/30

CPC分类号： G06F11/1474 ,  G06F17/30

摘要： Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to disk storage as a result of the merge operation.

摘要翻译： 提供了维护级联索引的技术。 在一种方法中，一个或多个分支节点压缩技术被应用于级联索引的主索引。 在一种方法中，生成Bloom过滤器并与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。 在一种方法中，响应于级联索引的两个级别之间的合并操作，生成新的重做记录。 新的重做记录包括（a）受合并操作影响的块的一个或多个地址，（b）数据被“下推”到级联索引的较低级，以及（c）一个或多个地址 作为合并操作的结果写入磁盘存储的块。

公开(公告)号：US08200658B2

公开(公告)日：2012-06-12

申请号：US13158808

申请日：2011-06-13

申请人： Carol L. Colrain ,  Namit Jain ,  Juan R. Loaiza

发明人： Carol L. Colrain ,  Namit Jain ,  Juan R. Loaiza

IPC分类号： G06F17/30

CPC分类号： G06F17/3048 ,  G06F17/30433 ,  Y10S707/99934 ,  Y10S707/99953

摘要： A system and method for enabling a second database instance to more quickly process a request to execute a database statement that has previously been executed by a first database instance is described. In one embodiment, the method involves sending the database statement from the first database instance to the second database instance, and generating by the second database instance one or more structures needed to prepare the statement for execution, such as a parse tree and an execution plan for the statement. If at some point in the future, the second database instance receives a request to execute the same statement, the above structures can be used for execution, thereby eliminating the need for one or more potentially time-consuming operations, such as generation of a parse tree or execution plan for the statement.

摘要翻译： 描述了使得第二数据库实例能够更快速地处理执行先前由第一数据库实例执行的数据库语句的请求的系统和方法。 在一个实施例中，该方法涉及将数据库语句从第一数据库实例发送到第二数据库实例，并且由第二数据库实例生成准备执行语句所需的一个或多个结构，诸如解析树和执行计划 为声明。 如果在将来的某个时刻，第二个数据库实例接收到执行相同语句的请求，上述结构可以用于执行，从而不需要一个或多个潜在的耗时的操作，比如生成解析 树或执行计划。

公开(公告)号：US20110238655A1

公开(公告)日：2011-09-29

申请号：US13158808

申请日：2011-06-13

申请人： Carol L. Colrain ,  Namit Jain ,  Juan R. Loaiza

发明人： Carol L. Colrain ,  Namit Jain ,  Juan R. Loaiza

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

CPC分类号： G06F17/3048 ,  G06F17/30433 ,  Y10S707/99934 ,  Y10S707/99953

摘要： A system and method for enabling a second database instance to more quickly process a request to execute a database statement that has previously been executed by a first database instance is described. In one embodiment, the method involves sending the database statement from the first database instance to the second database instance, and generating by the second database instance one or more structures needed to prepare the statement for execution, such as a parse tree and an execution plan for the statement. If at some point in the future, the second database instance receives a request to execute the same statement, the above structures can be used for execution, thereby eliminating the need for one or more potentially time-consuming operations, such as generation of a parse tree or execution plan for the statement.

摘要翻译： 描述了使得第二数据库实例能够更快速地处理执行先前由第一数据库实例执行的数据库语句的请求的系统和方法。 在一个实施例中，该方法涉及将数据库语句从第一数据库实例发送到第二数据库实例，并且由第二数据库实例生成准备执行语句所需的一个或多个结构，诸如解析树和执行计划 为声明。 如果在将来的某个时刻，第二个数据库实例接收到执行相同语句的请求，上述结构可以用于执行，从而不需要一个或多个潜在的耗时的操作，比如生成解析 树或执行计划。

公开(公告)号：US07783852B2

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

申请号：US10746471

申请日：2003-12-23

申请人： Tirthankar Lahiri ,  Poojan Kumar ,  Brian Hirano ,  Arvind Nithrakashyap ,  Kant Patel ,  Kiran Goyal ,  Juan R. Loaiza

发明人： Tirthankar Lahiri ,  Poojan Kumar ,  Brian Hirano ,  Arvind Nithrakashyap ,  Kant Patel ,  Kiran Goyal ,  Juan R. Loaiza

IPC分类号： G06F12/00

CPC分类号： G06F9/5016 ,  G06F12/023

摘要： Allocation of memory is optimized across multiple pools of memory, based on minimizing the time it takes to successfully retrieve a given data item from each of the multiple pools. First data is generated that indicates a hit rate per pool size for each of multiple memory pools. In an embodiment, the generating step includes continuously monitoring attempts to access, or retrieve a data item from, each of the memory pools. The first data is converted to second data that accounts for a cost of a miss with respect to each of the memory pools. In an embodiment, the second data accounts for the cost of a miss in terms of time. How much of the memory to allocate to each of the memory pools is determined, based on the second data. In an embodiment, the steps of converting and determining are automatically performed, on a periodic basis.

摘要翻译： 基于最小化从多个池中的每一个成功检索给定数据项所需的时间，内存分配在多个内存池之间进行了优化。 生成第一个数据，指示每个多个内存池的每个池大小的命中率。 在一个实施例中，生成步骤包括连续地监视从每个存储器池访问或检索数据项的尝试。 第一个数据被转换成相对于每个存储器池来计算缺失成本的第二数据。 在一个实施例中，第二数据考虑到时间方面的错过的成本。 基于第二数据确定分配给每个存储器池的存储器的多少。 在一个实施例中，周期性地自动执行转换和确定的步骤。

公开(公告)号：US20090292679A1

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

申请号：US12469635

申请日：2009-05-20

申请人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

发明人： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

IPC分类号： G06F17/30

CPC分类号： G06F11/1474 ,  G06F17/30

摘要： Techniques for compressing branch nodes in an index are provided. The branch nodes may be part of a main index of a multi-level index that also includes one or more journal indexes. A Bloom filter may be generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node.

摘要翻译： 提供了用于压缩索引中的分支节点的技术。 分支节点可以是也包括一个或多个日志索引的多级索引的主索引的一部分。 可以生成布隆过滤器并且与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。

公开(公告)号：US20090157701A1

公开(公告)日：2009-06-18

申请号：US11956287

申请日：2007-12-13

申请人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J.S. Macnaughton

发明人： Tirthankar Lahiri ,  Dheeraj Pandey ,  Juan R. Loaiza ,  Michael Zoll ,  Kiran B. Goyal ,  Neil J.S. Macnaughton

IPC分类号： G06F17/30

CPC分类号： G06F17/30327

摘要： A partial reverse key index is described, which allows distributed contention as resources vie to insert data into an index as well as allows range scans to be performed on the index. To do so, before an index entry for a key value is inserted into an index, the key value is transformed using a transformation operation that affects a subset of the order of the key value. The index entry is then inserted based on the transformed key value. Because the transformation operation affects the order of the key value, the transformed values associated with two consecutive key values will not necessarily be consecutive. Therefore, the index entries associated with the consecutive key values may be inserted into unrelated portions of the index.

摘要翻译： 描述了部分反向密钥索引，其允许分布式争用作为将数据插入到索引中的资源，并且允许在索引上执行范围扫描。 为此，在将键值的索引条目插入索引之前，将使用影响键值顺序子集的转换操作来转换键值。 然后基于转换的键值插入索引条目。 由于转换操作影响键值的顺序，与两个连续的键值相关联的变换值不一定是连续的。 因此，可以将与连续键值相关联的索引条目插入索引的无关部分。