-
公开(公告)号:US20190026353A1
公开(公告)日:2019-01-24
申请号:US16144126
申请日:2018-09-27
Applicant: Oracle International Corporation
Inventor: Steven McGee , Jiangbin Luo , Benedicto GARIN , Mahesh Girkar , Michael Harvey , Nitin Karkhanis , Steve Lee , Juan Loaiza , Robert McGuirk , Hongjie Yang
IPC: G06F17/30
Abstract: Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.
-
公开(公告)号:US10152412B2
公开(公告)日:2018-12-11
申请号:US14794107
申请日:2015-07-08
Applicant: Oracle International Corporation
Inventor: Selcuk Aya , Jia Shi , Kothanda Umamageswaran , Juan Loaiza
IPC: G06F12/02 , G06F12/0804 , G06F12/0871
Abstract: Techniques herein are for chaining nonvolatile storage devices to achieve high availability. A method involves a storage server receiving a write request to store data blocks in a first nonvolatile memory device. The storage server comprises a plurality of nonvolatile memory devices that cache data blocks stored on primary storage. The plurality of nonvolatile memory devices comprises the first nonvolatile memory device. The storage server maintains a cache index of data blocks that reside in the plurality of nonvolatile memory devices. Based on one or more criteria, the storage server reroutes the write request to a second nonvolatile memory device of the plurality of nonvolatile memory devices and stores an identifier of the second nonvolatile memory device in the cache index.
-
公开(公告)号:US10002148B2
公开(公告)日:2018-06-19
申请号:US14806411
申请日:2015-07-22
Applicant: Oracle International Corporation
Inventor: Niloy Mukherjee , Mohamed Zait , Juan Loaiza , Vineet Marwah , Tirthankar Lahiri , Jiaqi Yan , Kartik Kulkarni
CPC classification number: G06F16/2282 , G06F3/0604 , G06F3/0644 , G06F3/0679 , G06F16/2456 , G06F16/278
Abstract: Techniques are described herein for distributing data from one or more partitioned tables across the volatile memories of a cluster. In memory copies of data from partitioned tables are grouped based on the data falling within the same partition criteria. These groups are used for assigning data from corresponding partitions to the same node when distributing data from partitioned tables across the volatile memories of a multi-node cluster. When a query requires a join between rows of partitioned tables, the work for the join query is divided into work granules that correspond to partition-wise join operations. Those partition-wise join operations are assigned to nodes by a query coordinator based on the partition-to-node mapping located in the node of the query coordinator.
-
公开(公告)号:US20150089008A1
公开(公告)日:2015-03-26
申请号:US14488161
申请日:2014-09-16
Applicant: Oracle International Corporation
Inventor: Vijay Sridharan , Richard Frank , Jia Shi , Kothanda Umamageswaran , Juan Loaiza , Alexander Tsukerman , Bang Nguyen , Sumanta Chatterjee
IPC: H04L12/851
CPC classification number: H04L47/24 , H04L47/2433 , H04L47/2441 , H04L67/322
Abstract: A method and apparatus for intelligent network resource manager for distributed computing systems is provided. A first priority is assigned to a first virtual channel set that includes at least two virtual channels of a plurality of virtual channels associated with a physical communication channel. A second priority is assigned to a second virtual channel set that includes at least one virtual channel of the plurality of virtual channels. The first virtual channel set has more virtual channels than the second virtual channel set. Outbound messages of the first priority are directed to virtual channels of the first virtual channel set. Outbound messages of the second priority are directed to virtual channels of the second virtual channel set. The virtual channels are processed in a round-robin order, where processing includes sending the outbound messages over the physical communication channel.
Abstract translation: 提供了一种用于分布式计算系统的智能网络资源管理器的方法和装置。 第一优先级被分配给包括与物理通信信道相关联的多个虚拟信道中的至少两个虚拟信道的第一虚拟信道集合。 第二优先级被分配给包括多个虚拟信道中的至少一个虚拟信道的第二虚拟信道集合。 第一个虚拟通道组具有比第二个虚拟通道组更多的虚拟通道。 第一优先级的出站消息被引导到第一虚拟信道集合的虚拟信道。 第二优先级的出站消息被引导到第二虚拟信道集合的虚拟信道。 以循环顺序处理虚拟信道,其中处理包括通过物理通信信道发送出站消息。
-
公开(公告)号:US10528580B2
公开(公告)日:2020-01-07
申请号:US15008297
申请日:2016-01-27
Applicant: Oracle International Corporation
Inventor: Niloy Mukherjee , Kartik Kulkarni , Tirthankar Lahiri , Vineet Marwah , Juan Loaiza
IPC: G06F17/30 , H04L12/24 , G06F16/2458 , H04L12/26
Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve redistributing the in-memory database object portions on changes to the clustered database system. Each node may maintain a mapping indicating which nodes in the clustered database system store which chunks, and timestamps indicating when each mapping entry was created or updated. A query coordinator may use the timestamps to select a database server instance with local in memory access to data required by a portion of a query to process that portion of the query.
-
16.
公开(公告)号:US10296462B2
公开(公告)日:2019-05-21
申请号:US13840811
申请日:2013-03-15
Applicant: Oracle International Corporation
Inventor: Juan Loaiza , Amit Ganesh , Roger Macnicol , Jesse Kamp , Allison Holloway , Adrian Ng , Vineet Marwah
IPC: G06F12/08 , G06F12/0875 , G06F16/22 , G06F16/2455
Abstract: A method for accelerating queries using dynamically generated columnar data in a flash cache is provided. In an embodiment, a method comprises a storage device receiving a first request for data that is stored in the storage device in a base major format in one or more primary storage devices. The storage device comprises a cache. The base major format is any one of: a row-major format, a column-major format and a hybrid-columnar format. Based on first one or more criteria, it is determined whether to rewrite the data into rewritten data in a rewritten major format. In response to determining to rewrite the data into rewritten data in a rewritten major format, the storage device rewrites at least a portion of the data into particular rewritten data in the rewritten major format. The rewritten data is stored in the cache.
-
公开(公告)号:US09798655B2
公开(公告)日:2017-10-24
申请号:US14229809
申请日:2014-03-28
Applicant: Oracle International Corporation
Inventor: Nilesh Coudhury , Selcuk Aya , Zheren Zhang , Kothanda Umamageswaran , Juan Loaiza
IPC: G06F13/00 , G06F12/02 , G06F12/0804 , G06F12/0871
CPC classification number: G06F12/0246 , G06F12/0804 , G06F12/0871 , G06F2212/1036 , G06F2212/1044 , G06F2212/313 , G06F2212/401 , G06F2212/7201 , G06F2212/7204 , G06F2212/7208
Abstract: Flash memory on a flash memory device is virtualized using compression that is native to the flash memory device. Through compression, the flash memory device is used to logically store more data in a virtual address space that is larger than the physical address space of the flash memory device. Physical storage capacity of a flash memory device may prevent further storage of data even when the virtual address space is not fully populated. Because compressibility may vary, the extent to which the virtual address space may be populated before physical storage capacity is reached varies. The approaches for virtual memory described herein rely on the memory device client to monitor when this point is reached. In addition, the memory device client is responsible for freeing space as needed to accommodate subsequent requests to store data in the flash memory.
-
公开(公告)号:US20160085681A1
公开(公告)日:2016-03-24
申请号:US14794107
申请日:2015-07-08
Applicant: Oracle International Corporation
Inventor: Selcuk Aya , Jia Shi , Kothanda Umamageswaran , Juan Loaiza
IPC: G06F12/08
CPC classification number: G06F12/0246 , G06F12/0804 , G06F12/0871 , G06F2212/1016 , G06F2212/1024 , G06F2212/7208
Abstract: Techniques herein are for chaining nonvolatile storage devices to achieve high availability. A method involves a storage server receiving a write request to store data blocks in a first nonvolatile memory device. The storage server comprises a plurality of nonvolatile memory devices that cache data blocks stored on primary storage. The plurality of nonvolatile memory devices comprises the first nonvolatile memory device. The storage server maintains a cache index of data blocks that reside in the plurality of nonvolatile memory devices. Based on one or more criteria, the storage server reroutes the write request to a second nonvolatile memory device of the plurality of nonvolatile memory devices and stores an identifier of the second nonvolatile memory device in the cache index.
Abstract translation: 这里的技术是用于链接非易失性存储设备以实现高可用性。 一种方法涉及存储服务器,其接收写入请求以将数据块存储在第一非易失性存储器设备中。 存储服务器包括多个非易失性存储器设备,其缓存存储在主存储器上的数据块。 多个非易失性存储器件包括第一非易失性存储器件。 存储服务器维护驻留在多个非易失性存储器设备中的数据块的缓存索引。 基于一个或多个标准,存储服务器将写请求重新路由到多个非易失性存储器设备中的第二非易失性存储器设备,并将第二非易失性存储器设备的标识符存储在高速缓存索引中。
-
公开(公告)号:US20160026667A1
公开(公告)日:2016-01-28
申请号:US14806411
申请日:2015-07-22
Applicant: Oracle International Corporation
Inventor: Niloy Mukherjee , Mohamed Zait , Juan Loaiza , Vineet Marwah , Tirthankar Lahiri , Jiaqi Yan , Kartik Kulkarni
CPC classification number: G06F17/30339 , G06F3/0604 , G06F3/0644 , G06F3/0679 , G06F17/30498 , G06F17/30584
Abstract: Techniques are described herein for distributing data from one or more partitioned tables across the volatile memories of a cluster. In memory copies of data from partitioned tables are grouped based on the data falling within the same partition criteria. These groups are used for assigning data from corresponding partitions to the same node when distributing data from partitioned tables across the volatile memories of a multi-node cluster. When a query requires a join between rows of partitioned tables, the work for the join query is divided into work granules that correspond to partition-wise join operations. Those partition-wise join operations are assigned to nodes by a query coordinator based on the partition-to-node mapping located in the node of the query coordinator.
Abstract translation: 这里描述了用于在群集的易失性存储器上分布来自一个或多个分区表的数据的技术。 在内存中,来自分区表的数据的副本将根据落在相同分区标准中的数据进行分组。 当在多节点集群的易失性存储器上分配来自分区表的数据时,这些组用于将数据从相应分区分配给同一节点。 当查询需要分区表行之间的连接时,连接查询的工作被分成与分区连接操作相对应的工作颗粒。 这些分区连接操作由查询协调器基于位于查询协调器节点中的分区到节点映射分配给节点。
-
20.
公开(公告)号:US20150089121A1
公开(公告)日:2015-03-26
申请号:US14229809
申请日:2014-03-28
Applicant: Oracle International Corporation
Inventor: Nilesh Coudhury , Selcuk Aya , Zheren Zhang , Kothanda Umamageswaran , Juan Loaiza
IPC: G06F12/02
CPC classification number: G06F12/0246 , G06F12/0804 , G06F12/0871 , G06F2212/1036 , G06F2212/1044 , G06F2212/313 , G06F2212/401 , G06F2212/7201 , G06F2212/7204 , G06F2212/7208
Abstract: Flash memory on a flash memory device is virtualized using compression that is native to the flash memory device. Through compression, the flash memory device is used to logically store more data in a virtual address space that is larger than the physical address space of the flash memory device. Physical storage capacity of a flash memory device may prevent further storage of data even when the virtual address space is not fully populated. Because compressibility may vary, the extent to which the virtual address space may be populated before physical storage capacity is reached varies. The approaches for virtual memory described herein rely on the memory device client to monitor when this point is reached. In addition, the memory device client is responsible for freeing space as needed to accommodate subsequent requests to store data in the flash memory.
Abstract translation: 闪存设备上的闪存通过使用本地闪存设备的压缩进行虚拟化。 通过压缩,闪速存储器件用于将逻辑上更多的数据存储在大于闪存器件的物理地址空间的虚拟地址空间中。 即使虚拟地址空间未完全填充,闪存设备的物理存储容量也可以防止数据的进一步存储。 因为可压缩性可能变化,所以在达到物理存储容量之前可以填充虚拟地址空间的程度变化。 这里描述的虚拟存储器的方法依赖于存储器设备客户端来监视何时到达这一点。 此外,存储器件客户端负责根据需要释放空间,以适应将数据存储在闪速存储器中的后续请求。
-
-
-
-
-
-
-
-
-