The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.

An embodiment includes parsing conversation data to extract a message dataset and a user dataset. The embodiment classifies the message dataset into a category using machine learning processing and identifies the category as a top category based at least in part on an amount of the conversation data associated with the category. The embodiment generates impact data associated with the user dataset based on actions in the conversation data by the user. The embodiment generates role data associated with the user by applying a rule to the conversation data for the user. The embodiment generates key index data associated with the message dataset by identifying interactions with a message represented by the message dataset. The embodiment generates output data arranged according to a specified data format that is compatible with a user interface.

Embodiments of the invention are directed to database replication using heterogenous encoding. Aspects include obtaining a database and analyzing a data pattern of data in the database. Aspects also include identifying a plurality of candidate encoding formats and evaluating a computing cost for encoding the database for each of the plurality of candidate encoding formats. Aspects further include selecting an encoding format from the plurality of candidate encoding formats based at least in part on the computing cost and storing a backup copy of the database using the encoding format.

The present disclosure describes techniques for performing a smart tree lookup operation in a balanced tree. The techniques according to the present disclosure comprise identifying at least one data entry to be searched within the balanced tree, extracting a plurality of keys of the balanced tree, determining whether all or a subset of keys of the plurality of keys are required for searching the at least one data entry within the balanced tree, in response to the determination that the subset of keys of the plurality of keys are required for searching the at least one data entry, generating a first compare function for each of the at least one data entry using the subset of keys, and traversing a first path for the at least one data entry based on the first compare function. Accordingly, the techniques of the present disclosure enable efficient balanced tree lookup operation.

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.

Systems and methods are provided for optimizing data structures to improve the data retrieval through the use of bucketing techniques. A number of objects within an environment is drastically reduced utilizing bucketing techniques. Within the buckets, items are sequentially organized such that location is quicker. Items, or keys, are aligned with the same hash value together in a bucket and a mapping of the hash value to the offset of the first key occurrence in that bucket. This guarantees each lookup operation is only two random read accesses. Systems and methods provided herein control the pressures on a system for garbage collection and minimize memory usage with minimal impacts on performance.

Method and apparatus for stress management in a searchable data service. The searchable data service may provide a searchable index to a backend data store, and an interface to build and query the searchable index, that enables client applications to search for and retrieve locators for stored entities in the backend data store. Embodiments of the searchable data service may implement a distributed stress management mechanism that may provide functionality including, but not limited to, the automated monitoring of critical resources, analysis of resource usage, and decisions on and performance of actions to keep resource usage within comfort zones. In one embodiment, in response to usage of a particular resource being detected as out of the comfort zone on a node, an action may be performed to transfer at least part of the resource usage for the local resource to another node that provides a similar resource.

Value-based data transmission in an autonomous vehicle, comprising: acquiring sensor data from a plurality of sensors of the autonomous vehicle, the sensor data comprising a plurality of portions; determining, for each portion of the sensor data, a value based on one or more objects identified in the sensor data; determining, based on the values for the sensor data, an upload policy; and transmitting, based on the upload policy, one or more portions of the sensor data to a server.

Described are methods, systems and computer readable media for dynamic updating of query result displays.

Systems and methods are disclosed for flexibly applying a query term to heterogeneous data. A query system can receive a query that includes a data-determinant query term. As the system executes the query it can generate interim search results. As the system query processes the interim search results based on the query, it can apply the data-determinant query term to records of the interims search results based on the structure of the records.