公开(公告)号：US09846709B2

公开(公告)日：2017-12-19

申请号：US14823943

申请日：2015-08-11

申请人： SAP SE

发明人： Thomas Peh ,  Holger Schwedes ,  Wolfgang Stephan

IPC分类号： G06F17/30

CPC分类号： G06F17/30289 ,  G06F17/30466 ,  G06F17/30498 ,  G06F17/30545 ,  G06F17/30584

摘要： A join operation between split data tables includes providing value IDs. For each of the value IDs, a unique global ID may be associated with the value ID when the actual value represented by the value ID occurs among actual values comprising the second attribute of the second partition. For each identified unique global ID, the identified unique global ID may be paired with a document ID of a data record contained in a second partition stored at the second server in which the actual value in the data record is represented by the value ID associated with the identified unique global ID.

公开(公告)号：US09836492B1

公开(公告)日：2017-12-05

申请号：US13666549

申请日：2012-11-01

申请人： Amazon Technologies, Inc.

发明人： Daniel J. Hermanson

IPC分类号： G06F17/30 ,  G06F3/06

CPC分类号： G06F17/3033 ,  G06F3/0644 ,  G06F17/30336 ,  G06F17/30584

摘要： A distributed hash table (“DHT”) is created with partitions that have different sizes. A hash function allocates data to the partitions in the DHT at approximately equal rates. When the data stored on a partition approaches the storage capacity of the partition, the partition is split by adding a new partition to the DHT that has a size that is different than the sizes of the other partitions in the DHT. A portion of the data stored on the split partition is then reallocated to the new partition. A portion of a keyspace previously assigned to the split partition is also allocated to the new partition. Once the keyspace is reallocated, the hash function can allocate data to the new partition in the DHT.

公开(公告)号：US09811541B2

公开(公告)日：2017-11-07

申请号：US13167636

申请日：2011-06-23

申请人： Naresh Revanuru ,  Lenny Phan ,  Scott Oaks

发明人： Naresh Revanuru ,  Lenny Phan ,  Scott Oaks

IPC分类号： G06F17/30 ,  H04L29/06 ,  G06F15/173 ,  H04L12/24 ,  H04L12/931 ,  H04L29/08 ,  G06F9/455

CPC分类号： G06F17/30286 ,  G06F9/45504 ,  G06F15/17318 ,  G06F17/30368 ,  G06F17/30584 ,  H04L29/06088 ,  H04L41/042 ,  H04L41/0686 ,  H04L49/358 ,  H04L67/02 ,  H04L67/10 ,  H04L67/1002 ,  H04L67/1004 ,  H04L67/1027 ,  H04L67/1034 ,  H04L67/1095 ,  H04L67/14 ,  H04L67/142 ,  H04L67/146

摘要： A system and method can support in-memory session replication in a server cluster using a lazy deserialization approach. The server cluster can include a primary application server and a secondary application server. The primary application server operates to receive a request associated with a session from a client and maintains session information associated with the session. Based on the session information, the primary application server can responds to the client. The secondary application server operates to receive and maintain serialized session information from the primary application server. The secondary application server operates to update the serialized session information based on one or more session updates received from the primary application server. When the primary application server fails, the secondary application server can generate deserialized session information based on the updated serialized session information and responds to the client.

公开(公告)号：US09805108B2

公开(公告)日：2017-10-31

申请号：US13929109

申请日：2013-06-27

申请人： MongoDB, Inc.

发明人： Dwight Merriman ,  Eliot Horowitz

IPC分类号： G06F17/30

CPC分类号： G06F17/30584 ,  G06F17/30578

摘要： Systems and methods are provided for managing asynchronous replication in a distributed database environment, while providing for scaling of the distributed database. A cluster of nodes can be assigned roles for managing partitions of data within the database and processing database requests. In one embodiment, each cluster includes a node with a primary role to process write operations and mange asynchronous replication of the operations to at least one secondary node. Each cluster or set of nodes can host one or more partitions of database data. Collectively, the cluster or set of nodes define a shard cluster that hosts all the data of the distributed database. Each shard cluster, individual nodes, or sets of nodes can be configured to manage the size of any hosted partitions, splitting database partitions, migrating partitions, and/or managing expansion of shard clusters to encompass new systems.

公开(公告)号：US20170293534A1

公开(公告)日：2017-10-12

申请号：US15095209

申请日：2016-04-11

申请人： International Business Machines Corporation

发明人： John J. Auvenshine ,  Sunhwan Lee ,  James E. Olson ,  Mu Qiao ,  Ramani R. Routray ,  Stanley C. Wood

IPC分类号： G06F11/14 ,  G06F17/30

CPC分类号： G06F11/1464 ,  G06F17/30584 ,  G06F17/30958 ,  G06F17/509 ,  G06F2201/80

摘要： A method for distributing data among storage devices. The method comprising one or more processors receiving a first graph workload that executes within a networked computing environment. The method further includes identifying data from the first graph workload that is utilized during the execution of the first graph workload that includes a plurality of data packets. The method further includes creating a first graph workload model representative of the graph structure of the first graph workload and determining two or more partitions that are representative of a distribution of the identified data utilized by the first graph workload based, at least in part, on the first graph workload model. The method further includes allocating a plurality of network accessible storage devices among the two or more partitions and copying a first set of data packets of the plurality of data packets to a network accessible storage device.

公开(公告)号：US09773015B2

公开(公告)日：2017-09-26

申请号：US14726524

申请日：2015-05-30

申请人： Microsoft Technology Licensing, LLC.

发明人： Qun Guo ,  Pradeep Mani ,  Ajay Kalhan

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

CPC分类号： G06F17/30215 ,  G06F11/2094 ,  G06F11/3034 ,  G06F11/3055 ,  G06F17/30584 ,  G06F17/30864 ,  G06F2201/81

摘要： Embodiments of the invention dynamically vary the number of replicas based on certain conditions to protect users from data loss. The size of the database is one condition that can be used to determine the number of replicas required. A database system may create three replicas. When the database size exceeds a first threshold, a fourth replica may be created. The fourth replica is maintained as long as the database size is above a second threshold that is smaller than the first threshold. However, when the database shrinks below the second threshold, then the fourth replica is deleted. Using two different thresholds in this manner prevents the system from frequently cycling between three and four replicas.

公开(公告)号：US09754008B2

公开(公告)日：2017-09-05

申请号：US14930438

申请日：2015-11-02

申请人： Microsoft Technology Licensing, LLC

发明人： Goksel Genc ,  Humberto Lezama Guadarrama ,  Gary Chang ,  Andrew Sean Watson

IPC分类号： G06F17/30

CPC分类号： G06F17/30584 ,  G06F17/30 ,  G06F17/303 ,  G06F17/30371 ,  G06F17/30377

摘要： A method for scaling out database information may include creating second database instantiation. The method may include configuring one or more partitions of a first database for transfer to the second database and configuring the second database for receiving the one or more first database partitions. The method may also include transferring the one or more first database partitions to the second database.

公开(公告)号：US09734199B1

公开(公告)日：2017-08-15

申请号：US14046775

申请日：2013-10-04

申请人： Amazon Technologies, Inc.

发明人： Brian S. O'Neill ,  Jason Shijia Long ,  Archit Shivaprakash ,  Olga I. Kuznetsova

IPC分类号： G06F17/30

CPC分类号： G06F17/30578 ,  G06F17/30194 ,  G06F17/30424 ,  G06F17/30442 ,  G06F17/30575 ,  G06F17/30584

摘要： Generally described, the present disclosure is directed to an eventually consistent replicated data store that uses, for its underlying storage, a computer software library that provides a high-performance embedded database for data. The replicated data store employs a plurality of hosts interconnected to one another, allowing for writes to any host and full awareness of membership across all hosts. With the data replication framework disclosed herein, various modes are allowed to be built up on top of the core system.

公开(公告)号：US20170228319A1

公开(公告)日：2017-08-10

申请号：US15040501

申请日：2016-02-10

申请人： SAP SE

发明人： Ingo MUELLER ,  Arnaud Lacurie

IPC分类号： G06F12/10 ,  G06F17/30 ,  G06F12/02

CPC分类号： G06F17/3048 ,  G06F12/023 ,  G06F12/1018 ,  G06F17/3033 ,  G06F17/30528 ,  G06F17/30554 ,  G06F17/30584

摘要： Disclosed herein are system, method, and computer program product embodiments for constraining the amount of memory used during data aggregation. An embodiment operates by separating input data into a plurality of partitions. The embodiment then inserts portions of the input data into blocks from a free list at a given level of a pipeline. The embodiment then inserts the blocks into buffers for processing at a subsequent level of the pipeline. The embodiment processes the inserted blocks at the subsequent level of the pipeline and concatenates the intermediate results into a final aggregate result.

公开(公告)号：US09703789B2

公开(公告)日：2017-07-11

申请号：US15220192

申请日：2016-07-26

申请人： SAS Institute Inc.

发明人： Brian Payton Bowman ,  Steven E. Krueger ,  Richard Todd Knight ,  Chih-Wei Ho

IPC分类号： G06F12/00 ,  G06F13/00 ,  G06F13/28 ,  G06F17/30 ,  G06F9/50 ,  G06F3/06 ,  G06F12/02

CPC分类号： G06F17/30097 ,  G06F3/0604 ,  G06F3/061 ,  G06F3/064 ,  G06F3/0643 ,  G06F3/0644 ,  G06F3/067 ,  G06F9/5072 ,  G06F9/5077 ,  G06F12/0292 ,  G06F17/302 ,  G06F17/30312 ,  G06F17/30584 ,  G06F2212/1016 ,  G06F2212/1056 ,  G06F2212/154 ,  G06F2212/262 ,  G06F2212/263

摘要： An apparatus comprising a processor component to: receive metadata of data organization within a data set; receive indications of which node devices will be storing the data set as multiple data blocks within a data file; and receive, from each node device, a pointer request to a location within the data file for storing a data set portion as a data block. In response to the data set including partitioned data, for each request for a pointer: determine the location within the data file; generate a map data map entry for the data block; generate therein a sub-block count of data sub-blocks within the data block; generate therein a sub-entry for each data sub-block including size and a hashed identifier derived from a partition label; and provide a pointer to the node device. In response to successful storage of all data blocks, store the map data in the data file.