Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: In some aspects, a computing system may generate a content-defined tree. A content-defined tree may be a tree of cryptographic hashes where each leaf is a hash of a chunk (e.g., data chunk) of a data object, and each parent node (e.g., interior node) is the hash of a concatenation of the hashes of the parent's children nodes. To create parent nodes for the leaf nodes, a computing system may group leaf nodes together based on a rolling hash (e.g., a rolling hash of the hashes of the leaf nodes) satisfying a condition. Each parent node may include a hash that represents the concatenation of the hashes of the leaf nodes that fall under the corresponding parent node.

Abstract: The various embodiments described herein include methods, systems and/or devices used to visualize data. In one aspect, a method is performed by a computing system having one or more processors and memory. The method includes (1) receiving a request from a user to visualize data, the data stored in a graph dataflow processing system, and (2) in response to the request, invoking an interactive graphical user interface (GUI) for display to the user, the GUI including a first set of visualization data corresponding to a first subset of the data.

Abstract: The subject technology generates a dataset based at least in part on a set of files. The subject technology generates, utilizing a machine learning model, a set of labels corresponding to the dataset. The subject technology filters the dataset using a set of conditions to generate at least a subset of the dataset. The subject technology generates a virtual object based at least in part on the subset of the dataset and the set of labels, where the virtual object corresponds to a selection of data from the dataset. The subject technology trains a second machine learning model using the virtual object and at least the subset of the dataset, where training the second machine learning model includes utilizing streaming file input/output (I/O), the streaming file I/O providing access to at least the subset of the dataset during training.

Abstract: A method of optimizing graph operations is performed by a computing system. The method comprises: (1) receiving a first request to perform a first operation on a first graph, where the first graph comprises a set of vertices and a set of edges, each edge connecting a pair of vertices, and each vertex having one or more associated properties; (2) logging the first request, but not performing the first operation; (3) receiving a second request to perform a second operation; (4) logging the second request, but not performing the second operation; (5) receiving a query for data from the first graph, where the data includes property values for one or more vertices; (6) in response to the query: (a) generating a second graph by optimizing and performing the first and second operations; and (b) returning data responsive to the query, where the returned data is based on the second graph.

Abstract: A method receives a first request from a client object at a device. The first request specifies a data source. In response to the first request, the method uploads data from the data source, stores the data as a plurality of first columns, and instantiates a first server object that provides access to the first columns. The method later receives a second request from the client object. The second request specifies a transformation of the data. In response to the second request, the method stores one or more additional columns and instantiates a second server object that provides access to the additional columns and one or more of the first columns. Each of the additional columns is constructed from the first columns according to the requested transformation, and each of the additional columns includes a plurality of data values all having the same data type.

Abstract: A method of optimizing graph operations is performed by a computing system. The method comprises: (1) receiving a first request to perform a first operation on a first graph, where the first graph comprises a set of vertices and a set of edges, each edge connecting a pair of vertices, and each vertex having one or more associated properties; (2) logging the first request, but not performing the first operation; (3) receiving a second request to perform a second operation; (4) logging the second request, but not performing the second operation; (5) receiving a query for data from the first graph, where the data includes property values for one or more vertices; (6) in response to the query: (a) generating a second graph by optimizing and performing the first and second operations; and (b) returning data responsive to the query, where the returned data is based on the second graph.

Abstract: The various embodiments described herein include methods, systems and/or devices used to visualize data. In one aspect, a method is performed by a computing system having one or more processors and memory. The method includes (1) receiving a request from a user to visualize data, the data stored in a graph dataflow processing system, and (2) in response to the request, invoking an interactive graphical user interface (GUI) for display to the user, the GUI including a first set of visualization data corresponding to a first subset of the data.

Abstract: A method of optimizing graph operations is performed by a computing system. The method comprises: (1) receiving a first request to perform a first operation on a first graph, where the first graph comprises a set of vertices and a set of edges, each edge connecting a pair of vertices, and each vertex having one or more associated properties; (2) logging the first request, but not performing the first operation; (3) receiving a second request to perform a second operation; (4) logging the second request, but not performing the second operation; (5) receiving a query for data from the first graph, where the data includes property values for one or more vertices; (6) in response to the query: (a) generating a second graph by optimizing and performing the first and second operations; and (b) returning data responsive to the query, where the returned data is based on the second graph.

Abstract: A method receives a first request from a client object at a device. The first request specifies a data source. In response to the first request, the method uploads data from the data source, stores the data as a plurality of first columns, and instantiates a first server object that provides access to the first columns. The method later receives a second request from the client object. The second request specifies a transformation of the data. In response to the second request, the method stores one or more additional columns and instantiates a second server object that provides access to the additional columns and one or more of the first columns. Each of the additional columns is constructed from the first columns according to the requested transformation, and each of the additional columns includes a plurality of data values all having the same data type.

Abstract: Various technologies described herein pertain to computing top-K pairwise co-occurrence statistics using an upper bounding heuristic. Upper bound values of a co-occurrence statistic for items in a set can be computed based on a query item, and items can be sorted into an order. The items and the query item are represented by respective portions of a tensor. An item from the order associated with a highest upper bound value can be selected, an actual value of the co-occurrence statistic can be computed for the selected item, the upper bound value for the selected item can be replaced with the actual value for the selected item, and the selected item can be repositioned in the order. When the top-K items in the order lack an item associated with an upper bound value, the top-K items and actual values of the co-occurrence statistic for the top-K items can be outputted.