-
公开(公告)号：US11243980B2
公开(公告)日：2022-02-08
申请号：US16747313
申请日：2020-01-20
摘要： One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a read transaction protocol including: performing, by the processor, a read transaction protocol including issuing read transactions at any one of the nodes; attempting to return rows that are known to be replicated by at least a read quorum of the nodes; and for timing-out of the attempting to return rows known to be replicated by at least the read quorum of the nodes based on the special-node being non-responsive: selecting a new special-node from the nodes; and repeating attempting to return rows that are known to be replicated by at least the read quorum of the nodes.
-
2.发明申请公开(公告)号：US20210232554A1
公开(公告)日：2021-07-29
申请号：US17231828
申请日：2021-04-15
发明人： Yuanyuan Tian , Vijayshankar Raman , Ronald J. Barber , Richard S. Sidle , Pinar Tozun , Rene Mueller , Ronen Grosman , Adam J. Storm , Christian M. Garcia-Arellano , Guy M. Lohman
摘要： One embodiment provides for a method including performing, by a processing thread, a process that analyzes transactional operations by maintaining the transactional operations in transaction local side logs, and waiting until a successful transaction commit to append the transaction local side logs to a log stream. The processing thread processes the transactional operations on a key used to determine whether existing data is found for the key. The transactional operations are sped up through parallelism based on partitioning tables across nodes handling the transactional operations. A first process is performed by a first processor that processes updates for values of a key based on updating a first start time table index using unique keys and a start time field of a row for a first appearance of each unique key from the transactional operations.
-
3.发明授权公开(公告)号：US11042522B2
公开(公告)日：2021-06-22
申请号：US16005485
申请日：2018-06-11
发明人： Yuanyuan Tian , Vijayshankar Raman , Ronald J. Barber , Richard S. Sidle , Pinar Tozun , Rene Mueller , Ronen Grosman , Adam J. Storm , Christian M. Garcia-Arellano , Guy M. Lohman
摘要： One embodiment provides for a method including processing transactional operations on a key used to determine whether existing data is found for that key. A first time index is updated using unique keys and a start time field of a first appearance of each key from the transactional operations. A deferred update of prior versions of the key is performed for non-recent data upon determining that recent data in the transactional operations is found for the key.
-
公开(公告)号：US10831775B2
公开(公告)日：2020-11-10
申请号：US15400667
申请日：2017-01-06
IPC分类号： G06F16/25
摘要： One embodiment provides a method for efficient representation, access and modification of variable length data objects including converting, by a processor, all object updates into appends. The processor divides each object update into bounded size tokens. The tokens are stored normalized as an anchor and a linked list of fragments, the anchor having a pointer to a linked list of fragments. A fragment comprises a contiguous list of tokens that correspond to the appends.
-
公开(公告)号：US10747763B2
公开(公告)日：2020-08-18
申请号：US15152333
申请日：2016-05-11
IPC分类号： G06F16/2453
摘要： A computer program product provides efficient multiple aggregation distinct processing. The computer program product including a computer readable storage medium having program instructions embodied therewith. The program instructions are executable by a processor to cause the processor to convert a query with multiple aggregation distincts into a two-stage group-by process using a nest operator. The two-stage group-by process including further program instructions to cause the processor to: perform a first stage group-by process including the nest operator taking a single input row, and concatenating a grouping key with a measure value for each aggregation distinct that forms multiple inputs to a single group-by table, and perform a second stage group-by process including the nest operator bringing together entries for each original group.
-
公开(公告)号：US20200050697A1
公开(公告)日：2020-02-13
申请号：US16057560
申请日：2018-08-07
发明人： Ronald J. Barber , Vijayshankar Raman , Ronen Grosman , Christian M. Garcia-Arellano , Chandrasekaran Mohan
IPC分类号： G06F17/30
摘要： One embodiment provides for a method to track replication state and providing quorum visible retrievals. The method includes assigning, by a writer node performing write operations, a sequence number. The sequence number is replicated with a write operation to other replica nodes in an asynchronous fashion thru a first network channel. On a second network channel, a state of a local system is communicated by sending a latest sequence number available that has been hardened to the other replica nodes. A query is obtained by a reader node, and a sequence number limit is selected. Results up to the sequence number limit are returned.
-
公开(公告)号：US10521128B2
公开(公告)日：2019-12-31
申请号：US15828473
申请日：2017-12-01
发明人： Yinan Li , Guy M. Lohman , Rene Mueller , Ippokratis Pandis , Vijayshankar Raman
摘要： A method of orchestrated shuffling of data in a non-uniform memory access device that includes a plurality of processing nodes connected by interconnects. The method includes running an application on a plurality of threads executing on the plurality of processing nodes. Data to be shuffled is identified from source threads running on source processing nodes among the processing nodes to target threads executing on target processing nodes among the processing nodes. The method further includes generating a plan for orchestrating the shuffling of the data among the all of the memory devices associated with the threads and for simultaneously transmitting data over different interconnects to a plurality of different target processing nodes from a plurality of different source processing nodes. The data is shuffled among all of the memory devices based on the plan. Shifting the data-shifting table includes rotating a first ring with respect to a second ring.
-
公开(公告)号：US20190384754A1
公开(公告)日：2019-12-19
申请号：US16555721
申请日：2019-08-29
发明人： Ronald J. Barber , Bishwaranjan Bhattacharjee , Mohammad Sadoghi Hamedani , Guy M. Lohman , Chandrasekaran Mohan , Vijayshankar Raman , Richard S. Sidle , Adam J. Storm , Xun Xue
IPC分类号： G06F16/23
摘要： A method includes storing an anchor row vector identification for an anchor row to a local memory. It is determined whether the anchor row vector identification is visible based on isolation requirements. The anchor row vector identification is accessed upon a determination that the anchor row vector identification is visible, and the row vector identification is re-read from the local memory. It is determined whether the anchor row vector identification has not changed since a start of the accessing. Upon a determination that the anchor row vector identification has not changed, read anchor row fields are returned. A first check history is performed on an anchor row history tuple sequence number (TSN) for the anchor row.
-
公开(公告)号：US10430408B2
公开(公告)日：2019-10-01
申请号：US14864427
申请日：2015-09-24
IPC分类号： G06F17/00 , G06F17/30 , G06F16/2453 , G06F16/22 , G06F16/2455
摘要： A first table has more than one key column, and a hash array is built for the table, which includes computing hash indices for respective rows of the first table based on more than one key column. Building the hash array also includes writing in the hash array for each row at a respective location in the hash array, wherein each location is indicated by each row's respective hash index computed from the more than one key column. The hash array is probed responsive to the second table. In the building of the hash array for the first table, the writing in the hash array for each row at a respective location in the hash array writes only one of the key columns as a single key field in the hash array for each row.
-
公开(公告)号：US10430100B2
公开(公告)日：2019-10-01
申请号：US15908437
申请日：2018-02-28
发明人： Ronald J. Barber , Christian Garcia-Arellano , Ronen Grosman , Matthew A. Huras , Mir Hamid Pirahesh , Vijayshankar Raman , Richard S. Sidle , Adam J. Storm , Pinar Tozun
IPC分类号： G06F12/00 , G06F3/06 , G06F12/0802 , H04L29/08
摘要： One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.
-
-
-
-
-
-
-
-
-
搜索结果
158 条记录 (耗时 0.024 秒)
