Abstract: A method of identifying and enabling a data marketplace system transaction may comprise receiving an enterprise user object map defining a dataset field name and storage location for a dataset to be migrated pursuant to a user data integration process modeled by a user with a plurality of visual elements, identifying a data marketplace domain classification for the dataset to be migrated based on the enterprise user object map, querying a data marketplace application programming interface (API) to determine that it provides a marketplace for datasets meeting the data marketplace domain classification, generating a dataset sale integration process for transmitting the dataset of the data marketplace domain classification selected by the user for sale from a storage location defined by the user data integration process to a location defined by the data marketplace API, and automatically transmitting the dataset of the data marketplace domain classification to a purchaser.

Abstract: An information processing system determines whether the destination tenant corresponding to the source tenant is present, newly generates the destination tenant if the destination tenant is determined to be absent, and determines whether a destination resource which has the same ID as a source resource included in the source tenant is included in the tenant of the destination service. The system newly generates the destination resource in the destination tenant when the destination resource is determined not to be included in the tenant of the destination service, directly migrates data of the source resource to the destination resource if the tenant including the destination resource is the destination tenant, and migrates the data of the source resource to the destination resource via a dummy resource if the tenant including the destination resource is not the destination tenant.

Abstract: Distributed database systems including compute nodes and page servers are described herein that enable separating logical and physical storage of database files in a distributed database system. A distributed database system includes a page server and a compute node and is configured to store a logical database file that includes data and is associated with a file identifier. Each page server is configurable to store slices (i.e., subportions) of the logical database file. The compute node is coupled to the plurality of page servers and configured to store the logical database file responsive to a received command. In an aspect, such storage may comprise slicing the data comprising the logical database file into a set of slices with each being associated with a respective page server, maintaining an endpoint mapping for each slice of the first set of slices, and transmitting each slice to the associated for storage thereby.

Abstract: The method of this disclosure includes identifying a hot area in an index tree where an index split of the index tree has occurred due to a previous data insertion into a database based on historical statistic information on the index split. The method of this disclosure may further include predicting boundary key values of one or more new index pages to be inserted into the index tree for a next data insertion into the database based on a distribution of the hot area in the index tree. The method of this disclosure may further include inserting the one or more new index pages into the index tree based on the predicted boundary key values prior to the next data insertion.

Abstract: Direct storage loading may be used to add data to a database. New data may be added to a database, using nodes different than a database engine to access a database. The addition of the new data may be assigned to different nodes. The nodes may obtain the data and store the data to storage locations according allocated space in the database by the database engine. The new data can then be made available for access at the database engine.

Abstract: Embodiments of the present disclosure are directed to systems and methods for managing a database and performing database operations. An exemplary method in accordance with embodiments of this disclosure comprises: receiving a request to perform one or more database operations on a dataset comprising one or more data items; inputting the dataset into a statistical model, wherein the statistical model is configured to identify one or more storage locations associated with the one or more data items based on a similarity between one or more properties of the one or more data items; receiving the one or more storage locations associated with the one or more data items; updating the one or more data items based on the received one or more storage locations; and performing the one or more database operations on the one or more updated data items based on the one or more storage locations.

Abstract: Systems and methods for formatting data are disclosed. For example, a system may include at least one memory storing instructions and one or more processors configured to execute the instructions to perform operations. The operations may include receiving data comprising a plurality of sequences of data values and training a recurrent neural network model to output conditional probabilities of subsequent data values based on preceding data values in the data value sequences. The operations may include generating conditional probabilities using the trained recurrent neural network model and the received data. The operations may include determining a data format of a subset of the data value sequences, based on the generated conditional probabilities, and reformatting at least one of the data value sequences according to the determined data format.

Abstract: Provided is a method of indexing in a network key value indexing system. The method includes retrieving a first key name from a storage device of the network key value indexing system, the first key name identifying a first prefix, a first bucket, and a first key, the first prefix indicating the first bucket, parsing the first key name into the first prefix, the first bucket, and the first key, determining the first prefix, the first bucket, and the first key based on a first delimiter, and generating a hash table in a memory cache of the network key value indexing system to associate the first prefix with the first key.

Abstract: A method and system for code introspection in a multi-tenant architecture. The method includes receiving a query for code introspection from an entity, retrieving context for the entity that sent the query, retrieving raw code information based on the query, filtering the raw code information based on the context, and returning the filtered code information.

Abstract: Methods and systems are disclosed for remote code execution between computing environments having various dissimilarities. Client requests at a source environment lead to calls of various types lacking immediate support within the source environment. Calls are delegated to the target environment, where function schemas, data schemas, or copies of source-side schemas are variously used to reconcile called source-side entities with their target-side counterparts. Inconsistencies between name and data representations and datatypes are also addressed. Serially communicated (JSON) parameters are resolved into required target-side multi-level parameter structures, and vice versa. Expedited bulk data access to/from a database layer is supported. A use case is described for phased migration of a software application. Generic and extensible remote code execution allows rapid migration, adaptation, or deployment of software applications across diverse computing environments.

Abstract: A size associated with a content file is determined to be greater than a threshold size. Contents of the content file split across a plurality of component files are stored. Metadata, for the content file, is updated to reference a plurality of component file metadata structures for the component files. A node of the metadata is configured to track different sizes of portions of the content file stored in different component files of the plurality of component files. File metadata of the content file is split across the plurality of component file metadata structures and each component file metadata structure of the plurality of component file metadata structures specifies a corresponding structure organizing data components for a corresponding portion of the content file.

Abstract: One embodiment of the invention is directed to a method for performing efficient data searches in a distributed computing system. The method may comprise, receiving a search request including a key. The key may be provided to a block-based table manager via a programming interface external to a virtual machine executing on a computer system. The programming interface may provide a translation between a first programming framework of the virtual machine and a second programming framework of the block-based table manager. Providing the key may cause the block-based table manager to conduct a search for a value corresponding to the key. The value may be provided in response to the search request. Utilizing such block-based tables may enable a data search to be performed using on-board memory of computing node operating within a distributed computing system.

Abstract: A system can determine to perform a replication of data from first computing equipment to second computing equipment, wherein the data is stored within a path in a file system of the first computing equipment. The system can determine the path from a replication policy for the replication. The system can, while tree-walking the path, in response to determining that a first file is marked for priority replication, adding the first file to a priority queue, and in response to determining that a second file lacks a marking for priority replication, adding the second file to a normal queue. The system can, in response to determine that the priority queue contains files, replicating the files from the priority queue instead of replicating other files from the normal queue.

Abstract: A system includes a plurality of computing units. A first computing unit of the plurality of computing units comprises: a communication interface configured to receive an indication to roll up data in a data table; and a processor coupled to the communication interface and configured to: build a preaggregation hash table based at least in part on a set of columns and the data table by aggregating input rows of the data table; for each preaggregated hash table entry of the preaggregated hash table: provide the preaggregated hash table entry to a second computing unit of the plurality of computing units based at least in part on a distribution hash value; receive a set of received entries from computing units of the plurality of computing units; and build an aggregation hash table based at least in part on the set of received entries by aggregating the set of received entries.

Abstract: Systems and methods for ingesting different data types using a are disclosed. According to one embodiment, a method for universal data ingestion may include: (1) receiving, at a data ingestion layer in a multi-layer pod, data from a data producer, wherein the data may be in any format; (2) ingesting, by the data ingestion layer, the data using a producer proxy agent or an ingestion application programming interface (API); (3) staging, by a data messaging/staging layer in the multi-layer pod, the ingested data; (4) enriching or transforming, by a data enrichment/transformation layer in the multi-layer pod, the staged data based on at least one customer requirement; and (5) routing, by a data connection layer in the multi-layer pod, the enriched or transformed data from the data messaging/staging layer to a data store at an appropriate velocity.

Abstract: Collecting and distributing information related to recent content publication activity of an instant messaging (IM) user provides other users in a network with timely, relevant information about people known to the user or within the same social network. A user participating in a social network can quickly and efficiently perceive new information related to other users (referred to as co-users) in a social network by reviewing the co-users' recent content publication activity. A user may be made able to do so without requiring the co-user to send a communication directly to the user regarding the new facts or new content, and also without requiring the user to actively browse or request information about the co-user.

Abstract: Systems and methods are disclosed for annotating a metadata catalog in a data intake and query system based on a query received by the data intake and query system. The metadata catalog can store information about datasets associated with the data intake and query system, including dataset configuration records of the datasets, which can be used to process queries for execution by the data intake and query system. The data intake and query system can receive a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system can parse the query to identify datasets and/or data fields associated with the query. Based on the identified datasets and/or fields, the data intake and query system can generate one or more annotations, and use the annotations to update the metadata catalog.

Abstract: A system and method are provided for logically copying data from a source database to a first target database and a second target database. Based on table partition information, the source database is queried to collect partition metadata information for a first set of partitions and a second set of partitions. A first set of the partition metadata information for the first set of partitions and a second set of the partition metadata information for the second set of partitions can be used to create at least one extent chunk for each partition of a table. The source database can be queried, based on a first set of extent chunks and a second set of extent chunks, for a first set of data to be written to the first target database and a second set of data from the source database to be written to the second target database.

Abstract: A method may include receiving, at a computing device, an electronic data structure, the electronic data structure including: a location of a validation source for a payload of the data structure; and the payload, wherein the payload identifies a plurality of elements of a transaction; retrieving, from the validation source, a semantic schema; validating the payload of the data structure according to the semantic schema; and based on a result of the validating indicating the payload complies with the semantic schema, appending an electronic compliance signature to the data structure.

Abstract: Provided are systems, methods, and computer-readable medium for obtaining specific information about one or more psychological conditions. The information is obtained in a manner such that a second response is based on a first response. Once the information has been obtained, a customized content program for responding to the one or more psychological conditions may be generated.