公开(公告)号：US11086845B1

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

申请号：US16236369

申请日：2018-12-29

Applicant: Facebook, Inc.

Inventor： Rushin Shah ,  Anuj Kumar ,  Ted Li ,  Wei Chen ,  Shusen Liu

IPC: G06F16/23 ,  G06F16/22 ,  G06F16/21 ,  G06N20/00

Abstract: Techniques for database versioning are described. In one embodiment, an apparatus may comprise a database change management component operative to compare a developer table to a reference table to determine a database change set, wherein both the developer table and the reference table are based on a target table; a database conflict management component operative to compare the database change set to the target table to determine a conflicting change set; and a user interface component operative to display the conflicting change set where the conflicting change set comprises one or more conflicting changes; and indicate a conflict-free change set where the conflicting change set is empty. Other embodiments are described and claimed.

公开(公告)号：US09411840B2

公开(公告)日：2016-08-09

申请号：US14249610

申请日：2014-04-10

Applicant: Facebook, Inc.

Inventor： Wei Chen ,  Dhrubajyoti Borthakur

IPC: G06F17/30

CPC classification number: G06F17/30327

Abstract: The technology is directed to providing sequential access to data using scalable data structures. In some embodiments, the scalable data structures include a first data structure, e.g., hash map, and a second data structure, e.g., tree data structure (“tree”). The technology receives multiple key-value pairs representing data associated with an application. A key includes a prefix and a suffix. While the suffixes of the keys are distinct, some of the keys can have the same prefix. The technology stores the keys having the same prefix in a tree, and stores the root node of the tree in the first data structure. To retrieve values of a set of input keys with a given prefix, the technology retrieves a root node of a tree corresponding to the given prefix from the first data structure using the given prefix, and traverses the tree to obtain the values in a sequence.

Abstract translation: 该技术旨在使用可扩展数据结构对数据进行顺序访问。 在一些实施例中，可伸缩数据结构包括第一数据结构，例如散列图，和第二数据结构，例如树数据结构（“树”）。 该技术接收表示与应用程序相关联的数据的多个键值对。 键包括前缀和后缀。 虽然键的后缀是不同的，但是一些键可以具有相同的前缀。 该技术将具有相同前缀的密钥存储在树中，并将树的根节点存储在第一数据结构中。 为了检索具有给定前缀的一组输入键的值，该技术使用给定的前缀从第一数据结构检索与给定前缀相对应的树的根节点，并遍历树以获得序列中的值。

公开(公告)号：US20150293958A1

公开(公告)日：2015-10-15

申请号：US14249610

申请日：2014-04-10

Applicant: FACEBOOK, INC.

Inventor： Wei Chen ,  Dhrubajyoti Borthakur

IPC: G06F17/30

CPC classification number: G06F17/30327

Abstract: The technology is directed to providing sequential access to data using scalable data structures. In some embodiments, the scalable data structures include a first data structure, e.g., hash map, and a second data structure, e.g., tree data structure (“tree”). The technology receives multiple key-value pairs representing data associated with an application. A key includes a prefix and a suffix. While the suffixes of the keys are distinct, some of the keys can have the same prefix. The technology stores the keys having the same prefix in a tree, and stores the root node of the tree in the first data structure. To retrieve values of a set of input keys with a given prefix, the technology retrieves a root node of a tree corresponding to the given prefix from the first data structure using the given prefix, and traverses the tree to obtain the values in a sequence.

Abstract translation: 该技术旨在使用可扩展数据结构对数据进行顺序访问。 在一些实施例中，可伸缩数据结构包括第一数据结构，例如散列图，和第二数据结构，例如树数据结构（“树”）。 该技术接收表示与应用程序相关联的数据的多个键值对。 键包括前缀和后缀。 虽然键的后缀是不同的，但是一些键可以具有相同的前缀。 该技术将具有相同前缀的密钥存储在树中，并将树的根节点存储在第一数据结构中。 为了检索具有给定前缀的一组输入键的值，该技术使用给定的前缀从第一数据结构检索与给定前缀相对应的树的根节点，并遍历树以获得序列中的值。