Abstract: A generalized search engine is provided for abstract data types with skimming and approximate retrieval. According to various embodiments, an abstract data type definition is generated. The abstract data type definition comprises a plurality of field-value pairs. The abstract data type definition is indexed in an index. A document definition is generated. The document definition comprises at least one key value, and further comprises the abstract data type definition. The document definition is indexed in the index.

Abstract: A Resilient Distributed Dataset (RDD) processing method, system, and computer program product include sending a different portion including a global identifier and different values of a message from a receiver to a sender and at a receiver side, an already-processed message is extracted from an RDD object repository corresponding to the global identifier of the different portion and the incoming differential portion is applied to the already-processed message.

Abstract: Concepts and technologies disclosed herein are directed to a dynamic data threading (“DDT”) system. According one aspect of the concepts and technologies disclosed herein, the DDT system can query a source of a plurality of disparate sources and receive results from the source. The DDT system can determine, based upon the results, whether a further query is needed. The DDT system, in response to determining that the further query is needed, the DDT system can query a further source of the plurality of disparate sources based, at least in part, upon the results received from the source, and can receive further results from the further source.

Abstract: Implementations of the present application provide a blockchain-based resource allocation method. A target transaction is obtained, by a first node device in a blockchain network, from a distributed database of the blockchain network. The blockchain network comprises a target user device of a target user and the first node device. The target transaction comprises service behavior data of the target user, and the service behavior data of the target user is generated by the target user device by using a target service. A smart contract corresponding to an allocation of a resource is invoked comprising: executing a resource allocation logic that is stored in the smart contract and that is related to the service behavior data of the target user, and performing the allocation of the resource to the target user.

Abstract: Provided are devices, computer-program products, and methods for improved management of system resources in a matching system. For example, examples can increase the efficiency of system resource utilization by managing the duration that data related to video segments are retained based on data that takes into account an identified popularity of a video segment. The identified popularity can be determined by algorithms that take into account numbers of viewers who watched the video segment, ratings of the video segment, metrics derived from remote sources, or any other factor that can indicate likelihood that the video segment will be viewed.

Abstract: A distributed system is provided that includes member nodes and a leader node. Each member node stores a database and updates the database by performing common ones of a plurality of transactions. The leader node generates a batch, to be executed by each member node, which includes two or more transactions lacking an access conflict from among the plurality of transactions. The leader node includes: a section that generates an access set as a set of database entries to be accessed by each transaction to be executed; a section that generates the batch, based on the access set of each transaction to be executed; and a leader-side section that performs a consensus process for the batch among the leader and member nodes. Each member node includes the database; a member-side section that performs a consensus process for the batch; and a section that performs parallel execution of batch transactions.

Abstract: A database processing system includes a coordinator agent controller and a virtual node data base. The coordinator agent controller detects a request to access a database by an application program and to extracts database objects from a database protocol stream based on a requirement requested by the application program. The virtual node database is generated according to the extracted database objects. The virtual node database includes memory dump storage that stores the database objects extracted from the database protocol stream, and based on the database objects the virtual node database generates virtual database objects corresponding to the database protocol stream. The extraction of database objects is performed directly on the database protocol stream without communicating with a target real database.

Abstract: According to an aspect of the disclosure, a server device includes interface circuitry and processing circuitry. The interface circuitry is configured to receive a web page request sent from a terminal device, the web page request carrying an identifier of a web page and social application account information of a user. The processing circuitry is configured to obtain the web page requested by the user according to the identifier of the web page, obtain social information of the user according to the social application account information, determine recommended content according to the social information and provide the web page and the recommended content to the interface circuitry to transmit to the terminal device.

Abstract: A method can include rendering a first closed curve to a display where the first closed curve represents a number of members of a dataset according to a first criterion; receiving a selection for a second criterion for the dataset; transmitting at least the second criterion via a network interface; responsive to the transmitting, via the network interface, receiving information as to at least the second criterion and the dataset; and rendering to the display, based at least in part on the information, a second closed curve that represents a number of members of the dataset according to the second criterion where the first and second closed curves overlap to an extent that depends on a number of common members thereof.

Abstract: Service data updated in a data update event is acquired by a service application executed by a computer-implemented system. The service data is stored in a local database of the service application. An event version corresponding to the data update event is generated by the service application. The service data and the event version are encapsulated into an event object by the service application. The event object is transmitted to a peer-end service application for synchronizing corresponding service data in a peer-end database of the peer-end service application.

Abstract: In one aspect, systems and techniques for modifying a storage structure with newly encryptable fields is described. A delta encryption system loads a current database schema and an object model for a new database schema to a memory. The current database schema includes meta information identifying multiple fields and field information for a current application build. The object model includes meta information identifying multiple fields and field information for a new application build. The fields identified by the object model meta information include one or more encryptable fields. The delta encryption system calculates a field size information for the encryptable fields and compares the meta information from the current database schema with the meta information from the object model. In response to the comparison, the delta encryption system identifies which of the encryptable fields are newly encryptable fields and modifies a database based on the calculated field size information.

Abstract: A system, method, and computer-readable medium, including creating at least one data foundation table, each of the at least one data foundation tables being created for each of one or more set tables in a database based on information stored in a first set container relying on the one or more set tables; linking at least one of the created data foundation tables to a customer table in the database, the created data foundation table being linked to the customer table based on a primary key for the customer table; and storing all of the created data foundation tables in the a dedicated data structure hosted by the first set container.

Abstract: Techniques herein minimally communicate between computers to repartition a graph. In embodiments, each computer receives a partition of edges and vertices of the graph. For each of its edges or vertices, each computer stores an intermediate representation into an edge table (ET) or vertex table. Different edges of a vertex may be loaded by different computers, which may cause a conflict. Each computer announces that a vertex resides on the computer to a respective tracking computer. Each tracking computer makes assignments of vertices to computers and publicizes those assignments. Each computer that loaded conflicted vertices transfers those vertices to computers of the respective assignments. Each computer stores a materialized representation of a partition based on: the ET and vertex table of the computer, and the vertices and edges that were transferred to the computer. Edges stored in the materialized representation are stored differently than edges stored in the ET.

Abstract: A data object is received for storage in a key-value store. A partitioning token prefix is generated for the data object. A logical key for the data object is determined. A partitioning key is generated based at least in part on combining the partitioning token prefix and the logical key. Data associated with the data object is stored in the key-value store based on the partitioning key.

Abstract: Systems, methods, and computer-program products are described for determining current location information which includes determining whether an object is moving by comparing the current location information with previous location information. Future location information is calculated and a point of interest is filtered using the future location information. A media asset is then matched to the filtered point of interest and a current score is determined for the matched media asset. Determining a current score includes determining a window in which the matched media asset is geographically relevant to the future location information, and updating the matched media asset score when the future location information changes. An ordered playlist is dynamically generated according to the future location information by repeatedly prioritizing and sequencing matched media assets according to the current score for each matched media asset, and matched media assets are played or displayed in the ordered playlist.

Abstract: Some embodiments provide a non-transitory machine-readable medium that stores a program. The program receives a selection of a type of data to replicate from the first computing system to a second computing system. The program further receives a selection of a form in a set of forms. Each form in the set of forms is associated with a set of fields for data having the selected type of data and managed the second computing system. The program also sends the second computing system a request for the set of fields associated with the selected form. The program further generates a mapping between the set of fields associated with the selected form and a set of fields of data managed by the first computing system.

Abstract: A storage appliance arranges snapshot data and snapshot metadata into different structures, and arranges the snapshot metadata to facilitate efficient snapshot manipulation, which may be for snapshot management or snapshot restore. The storage appliance receives snapshots according to a forever incremental configuration and arranges snapshot metadata into different types of records. The storage appliance stores these records in key-value stores maintained for each defined data collection (e.g., volume). The storage appliance arranges the snapshot metadata into records for inode information, records for directory information, and records that map source descriptors of data blocks to snapshot file descriptors. The storage appliance uses a locally generated snapshot identifier as a key prefix for the records to conform to a sort constrain of the key-value store, which allows the efficiency of the key-value store to be leveraged.

Abstract: A set of data is identified that includes a plurality of observed values generated by a plurality of sensor devices located in a plurality of different locations. For each of the plurality of observed values, a modality of the value, a spatial location of the value, and a timestamp of the value is determined. Values for one or more missing values in the set of data are determined from the modalities, spatial locations, and timestamps of the plurality of observed values.

Abstract: An exemplary embodiment of the present invention indexes components of a systematization of technical data. An author, a publisher, and a renderer are defined. The author, the publisher, and the renderer are relatedly configured in the technical data system so that the author represents a first stage, the publisher represents a second stage, and the renderer represents a third stage. The author creates and outputs author data, which is input into and implemented by the publisher. The publisher creates and outputs publisher data, which is input into and implemented by the renderer. The renderer creates and outputs renderer data, which is input into and implemented by a user. Respective levels of data are determined at the three stages. A first-stage level of data corresponds to the author data. A second-stage level of data corresponds to the publisher data. A third-stage level of data corresponds to the renderer data.

Abstract: A method for presenting a data handling method on a graphical user interface includes identifying a type of service associated with a pending data handling process, sending one or more user characterizations associated with a user's identity to a server for performing the data handling process, receiving data handling capabilities corresponding to one or more data handling methods for performing the identified type of service, determining one or more candidate data handling methods to be displayed on a graphical user interface (GUI) of the client computing device, initiating display of the candidate data handling methods on the client computing device GUI based on the data handling capabilities, performing the pending data handling process with a particular data handling method selected from the candidate data handling methods, and sending a performance result associated with the pending data handling process.