Abstract: Some embodiments provide a method for quantifying complexity of database queries that reference database objects in a database. The method identifies a database query that includes a reference to a set of one or more database objects in the database. The method identifies a set of properties associated with a set of components of the identified query, and computes, from the identified set of properties, a complexity indicator that represents a complexity expression of the database query.

Abstract: Systems and methods for mapping natural language to queries using a query grammar are described. For example, methods may include generating, based on a string, a set of tokens of a database syntax; generating a query graph for the set of tokens using a finite state machine representing a query grammar, wherein nodes of the finite state machine represent token types, directed edges of the finite state machine represent valid transitions between token types in the query grammar, vertices of the query graph correspond to respective tokens of the set of tokens, and directed edges of the query graph represent a transition between two tokens in a sequencing of the tokens; determining, based on the query graph, a sequence of the tokens in the set of tokens, forming a database query; and invoking a search of a database using a query based on the database query to obtain search results.

Abstract: The present disclosure relates to a data analysis method and a data analysis system thereof. The data analysis method includes steps of: receiving a first learning content data, and adding multiple first segmentation marks to the first learning content data to divide multiple first learning sections on the first learning content data. The first learning sections are arranged according to a time axis. Searching a first keyword string corresponding to each first learning section from the first learning sections. Receiving a analysis command, and analyzing the analysis command with the first keyword string of each of the first learning content data to obtain multiple first similarities, corresponding to the analysis command and each of the first learning sections. Finally, searching for the first learning section with the highest similarity.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for obtaining cluster data, determining a portion of the search queries within the given query cluster that trigger a local search feature, assigning to the intent flag a value indicating that the given cluster is high local intent cluster when the portion of the search queries within the given query cluster that trigger the local search feature meets the local intent threshold, assigning to the intent flag a value indicating that the given cluster is a low local intent cluster when the portion of the search queries within the given query cluster that trigger the local search feature fails to meet the local intent threshold, and modifying a content item including adding a local content feature to the content item when the search query is determined to be included in the high local intent cluster.

Abstract: Disclosed herein are system, method, and computer program product embodiments for displaying object pages containing data displayed in tables in a client application. The client application may provide a user experience framework via which an administrator may pre-configure the behavior of object pages that display data related to the application in table form. A table may be configured to display using lazy loading, tab navigation, or a preview version to list report based on the nature and expected size of the table. When preview version to list report is chosen, a preview version of a table may be provided to a user to allow the user to interact with the data without displaying the entirety of the dataset.

Abstract: A method, computer system, and a computer program product for collecting performance data on a consistency group boundary is provided. The present invention may include positioning a plurality of software applications into idle mode. The present invention may also include starting a consistency group based on a command from a Global Mirror Master. The present invention may then include collecting a plurality of performance data associated with the started consistency group. The present invention may then include removing a plurality of remaining data associated with the collected plurality of performance data. The present invention may further include ending the collection of the collected plurality of data.

Abstract: The invention relates to a computer-implemented method for classifying a set of data values. For each of the data values of the set of data values, a set of one or more terms associated with the respective data value is determined using one or more first knowledge bases. A set of common terms is determined. The set of common terms comprises terms present in more than one of the sets of terms. For each of the common terms, a number of hits for a lookup query against one or more second knowledge data bases is determined. One or more common terms of the set of common terms with the smallest number of hits are determined and a result is returned. The result comprises the one or more common terms with the smallest number of hits as one or more candidate classes for classifying the set of data values.

Abstract: A system for natural language processing-based electronic file scanning for processing database queries is provided. In particular, the system may use natural language processing on various types of lookup data to create a consolidated lookup file containing the lookup data. The system may then receive search queries from users and produce a search output based on the consolidated lookup file. Once the search output is provided to the user, the system may, based on the user's interaction with the search output, incorporate the original search query into the consolidated lookup data file using machine learning. In this way, the system may adapt to incorporate variations and nuances of search queries received from its users over time.

Abstract: A synchronization protocol is provided that can be used to resolve synchronization errors encountered while trying to synchronize versions of data objects between a client device and a remote computing system. The protocol includes a client device, in an offline processing mode, handling user interface (“UI”) manipulation actions on one or more UI elements of one or more UI screens. The handling of the UI manipulation actions modifies or creates a local version of a data object stored on the client device. The UI manipulation actions are stored by the client device and sent to the remote computing system. The client device receives a synchronization error notification from the remote computing system. After receiving the notification, the client device displays, in one of the UI screens, the local version of the data object and one or more indications of a synchronization error.

Abstract: A source worker node at a source site fetches a task from a message queue. The task specifies replicating a first object at the source site to a destination site. A request for a connection is issued from the source worker node to the destination site. The request is received by a load balancer at the destination site and assigned to a destination worker node. A connection is established between the source and destination worker nodes. A determination is made that the destination site does not include an object that is the same as the first object. Upon the determination, a deduplication is performed between the source and destination worker nodes of segments into which the first object has been divided. Deduplicated segments of the first object are transmitted from the source worker node to the destination worker node for storage at the destination site.

Abstract: A retrieval device includes a searching unit, an obtaining unit and a selecting unit. The searching unit searches a memory unit, which is stored object data that includes specific information identifying an object and attribute information indicating at least one of timing and position, for first object data containing specific information identical or similar to specified specific information. The obtaining unit obtains, from the memory unit, one or more sets of second object data which contains attribute information identical or similar to the attribute information included in the first object data and which contains specific information different than the specific information included in the first object data. The selecting unit selects one of the sets of second object data. The searching unit further searches for the first object data with the specific information included in the selected second object data serving as specified specific information.

Abstract: One embodiment is related to a method for restoring an inode based backup to a path based structure, comprising: receiving a path to be restored; determining one or more selected inodes, wherein metadata associated with the one or more selected inodes is to be used in the restoration; generating a sendmap structure that is indicative of the selected inodes; restoring a first file; and determining whether an inode number of the first file, which identifies an inode of the first file, and its associated metadata are available in a metadata cache, and if so: using the inode number of the first file and its associated metadata in the metadata cache in the restoration of the first file.

Abstract: The techniques described herein provide tools that summarize a dataset by creating a final set of segments that, when visually presented via a histogram or other data presentation tool, show the distribution of at least a portion of the data. To create the final set of segments, the techniques described herein may collect or receive a dataset with distinct values, and divide the dataset into a number of segments that is less than or equal to a segment presentation threshold (e.g., ten segments). After creating the final set of segments, the techniques may configure and/or present data visualizations, such as histograms, for the created segments so that an observer is provided with a good viewing experience.

Abstract: Methods and apparatus, including computer program products, are provided for transporting processes within a distributed computing system, such as a cluster. In one aspect, the computer-implemented method may receive an event at a first node. The event may correspond to a process instance for handling the received event. The process instance may be transported from a second node to the first node. The process instance may be transported from a persistence when the process instance is inactive and, when the process instance is active, the process instance may be persisted to enable transport to the first node. Related apparatus, systems, methods, and articles are also described.

Abstract: One embodiment of the present invention sets forth a method of selecting an entry in a database in an in-vehicle infotainment system. The method includes receiving a second single-character input after receiving a first single-character input, generating a multi-character search string in which the first character of the multi-character search string is the first single-character input and the second character of the multi-character search string is the second single-character input, searching a database stored in the in-vehicle infotainment system for entries that match the multi-character search string, and causing a number of entries that match the multi-character search string to be displayed by the in-vehicle infotainment system. An advantage of the disclosed embodiment is that a vehicle operator can effectively search through a large number of entries in an in-vehicle system with reduced distraction and without stopping the vehicle.

Abstract: To leverage the attributes of object storage for applications/systems created to interface with a network files system, an object storage backed file system can accept the defined file system commands from the applications/systems and transform the file system commands into requests that target object storage. The file system is “backed” by object storage because attributes and content of file system entities are stored in objects. For instance, content data and metadata of a file are stored in objects in object storage. This object storage backed file system can be considered a bridge between a client perceived hierarchical file system namespace and a flat namespace of an object storage.

Abstract: The methods, apparatuses, and systems described herein are designed to analyze comments provided by a coach relating to an agent's interaction with a customer. The methods include receiving a coaching comment regarding an agent's interaction with a customer, applying at least one scoring algorithm to the comment, and outputting a score of the scoring algorithm.

Abstract: A method and system for computer processes and data structures is described that define an environment for monitoring tasks that together constitute a project, where such processes utilize a scripting language to define certain functions that may relate data from one part of a project to another.

Abstract: An apparatus in one embodiment comprises at least one processing platform including a plurality of processing devices. The processing platform is configured to receive a request to execute an application in a function-as-a-service (“FaaS”) environment, to initiate execution of the application responsive to the request, and to invoke a plurality of application functions with each such application function interacting with one or more backend services in executing the application. The processing platform is further configured to automatically generate an application manifest characterizing relationships between the application functions and the backend services utilized in executing the application, to capture state of the application for a particular point in time based at least in part on the application manifest, and to perform operational recovery of the application for the particular point in time utilizing the captured state.

Abstract: Methods, systems, and devices for data retention handling are described. In some data storage systems, data objects are stored in a non-relational database schema. The system may support configurable data retention policies for different tenants, users, or applications. For example, a data store may receive retention requests, where the retention requests may specify deletion or exportation actions to perform on records contained within data objects. The data store may determine retention rules based on these retention requests, and may periodically or aperiodically evaluate the rules to determine active actions to perform. To improve the efficiency of the system, the data store may aggregate the active actions (e.g., according to the dataset to perform the actions on), and may generate work items corresponding to the aggregate actions. A work processor may retrieve these work items and may efficiently perform the data retention actions on datasets stored in the data object store.