Abstract: Techniques for determining when to store content and when to refrain from storing content are described herein. In some instances, devices exchange communications that include different types of content, such as text, audio data, video data, image data, or the like. For instance, a first device may receive, from a second device, a communication that includes audio data representing speech of a user of the second device, along with text for display on the first device. The text may comprise a transcription of the audio file, additional commentary provided by the user of the second device, or the like. Upon receiving the communication that includes text and audio data, the first device may determine whether or not to store the audio data. For instance, the first device may determine whether it currently stores this audio content. If so, then the first device may refrain from storing the content again.

Abstract: Methods and systems for data are disclosed. A system implementation includes a data module for storing data received from an external source. The data module includes a file system for unstructured data, a database for structured data, a transform for operating upon unstructured or structured data, a data broker for receiving data having a first format and providing the data in a second format, a data network for communications within the data module, and a processing module for performing operations upon data. The processing module further includes a process broker and a process container. The process container is for providing one or more instances of processes during a runtime operation. The system further includes an inter-process network for communications within the processing module and an internal gateway for the data module to communicate with the processing module.

Abstract: The disclosed embodiments provide a system for processing queries of a graph database storing a graph, wherein the graph comprises a set of edges defined by a first linkage, a second linkage, and a third linkage. During operation, the system maintains the base version of an index of the graph database. Upon branching a version of the graph database from a first offset representing a virtual time in the base version of the graph database, the system creates a branched version of the index from a second offset corresponding to the virtual time in the base version of the index. The system then processes queries of the graph database based on the offsets and references from the branched version of the index to the base version of the index.

Abstract: There is disclosed a computer-implemented method and system for generating a set of training objects for training a machine learning algorithm (MLA) to determine query similarity based on textual content thereof, the MLA executable by the system. The method comprises retrieving, from a search log database of the system, a first query and other queries with associated search results. The method then comprises selecting a subset of query pairs such that: a query difference in queries in the pair is minimized and a results difference in respective search results is maximized.

Abstract: The present disclosure relates to systems and methods for using existing data ontologies for generating machine learning solutions for a high-precision search of relevant services to compose pipelines with minimal human intervention. Data ontologies can be used to create a combination of non-logic based and logic-based sematic services that can significantly outperform both kinds of selection in terms of precision. Quality of Service (QoS) and product Key Performance Indicator (KPI) constraints can be used as part of architecture selection in developing, training, validating, and improving machine learning models. For data sets without existing ontologies, one or more ontologies be generated and stored for future use.

Abstract: Apparatus for generating a putative ontology from a data structure associated with a data store, the apparatus including an electronic processing device that generates a putative ontology by determining at least one concept table in the data structure, determining at least one validated attribute within the at least one concept table, determining at least one selected attribute value from the at least one validated attribute and generating at least one ontology class using the at least one attribute value.

Abstract: Techniques are disclosed for tuning external invocations utilizing weight-based parameter resampling. In one example, a computer system determines a plurality of samples, each sample being associated with a parameter value of a plurality of potential parameter values of a particular parameter. The computer system assigns weights to each of the parameter values, and then selects a first sample for processing via a first external invocation based on a weight of the parameter value of the first sample. The computer system then determines feedback data associated with a level of performance of the first external invocation. The computer system adjusts the weights of the parameter values of the particular parameter based on the feedback data. The computer system then selects a second sample of the plurality of samples to be processed via execution of a second external invocation based on the adjustment of weights of the parameter values.

Abstract: Systems and methods for generating database schema change documents based on a data model and model changes indicated by a user. Information items related to one or more objects defined in the data model are received, and user input regarding changed objects is requested. In embodiments, changes are evaluated against configurable design criteria. One or more human and/or machine readable database schema change documents, and are stored in memory. Design criteria and change documents can vary based on a target database platform in embodiments.

Abstract: Systems, devices, and methods of the present invention detect rhetoric agreement between texts. In an example, a rhetoric agreement application accesses a multi-part initial query and generates a question communicative discourse tree that represents rhetorical relationships between fragments of the query. The application identifies a sub-discourse tree from the question communicative discourse tree. The application generates a candidate answer communicative discourse tree for each candidate answer of a set of candidate answers. The application computes a level of complementarity between the sub-discourse tree and each candidate answer discourse tree by applying a classification model to the sub-discourse tree and candidate answer communicative discourse trees. The application selects an answer from the candidate answers based on the computed complementarity, thereby building a dialogue structure of an interactive session.

Abstract: A method of providing data stored in a network device to a subscriber, the method including providing a central database including data stored in a table, maintaining a sorted list for the table in the publisher, and generating a modification and a modification identifier for the table with the publisher. The method further including inserting the modification into the table in the central database based on the modification identifier, receiving a command from the subscribed for the table, and providing the table to the subscriber from the central database.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving a plurality of snippets of a plurality of user reviews for a product, each respective snippet of the plurality of snippets relating to at least one respective user attribute category of a plurality of user attribute categories; creating a score for each respective snippet of the plurality of snippets based on: a probability of association between at least one user attribute category and one or more seed words, the one or more seed words describing one or more qualities of the product; and facilitating displaying, on a user device of a user, a first snippet of the plurality of snippets, the first snippet of the first plurality of snippets having a higher score of the scores for the plurality of snippets than another score of the scores for the plurality of snippets. Other embodiments are disclosed herein.

Abstract: The number of inter-node communications in inter-node deduplication can be reduced and both performance stability and high capacity efficiency can be achieved. A storage drive of storage nodes stores files that are not deduplicated in the plurality of storage nodes, duplicate data storage files in which deduplicated duplicate data is stored, and cache data storage files in which cache data of duplicate data stored in another storage node is stored, in which when a read access request for the cache data is received, the processors of the storage nodes read the cache data if the cache data is stored in the cache data storage file, and request another storage node to read the duplicate data related to the cache data if the cache data is discarded.

Abstract: A software module ingests data into a data intake and query system. At least a portion of the data is cloud data. The software module includes an event type definition that specifies a type of data to be ingested by the software module, a first tag that associates ingested data of the event type with a data model, and a second tag that designates ingested data of the event type as cloud data. The ingested data is stored in a data repository, and subsequently a search query that includes the first tag and the second tag is executed against the data repository, to identify ingested cloud data that satisfies the search query and a first search constraint specified in the data model. A display device is caused to display a visualization based on the identified ingested cloud data that satisfies the search query.

Abstract: Some embodiments provide a program. The program receives from a client device a request for objects in a collection of objects and a set of keywords. Based on the set of keywords, the program further determines a set of categories used for categorizing objects in the collection of objects. The program also generates a search query based on the set of keywords and the set of categories. The search query is configured to identify objects in the collection of objects having a description or name that matches at least one keyword in the set keywords and modify relevance of identified objects based on the set of categories. The program further executes the search query on the collection of objects to generate a result set of objects. The program also provides the result set of objects to the client device.

Abstract: Techniques for formulating queries and retrieving relevant results for 3D components in a virtual or augmented reality system. In an aspect, a user works with a 3D component using a workflow, and views the 3D component from one or more selected perspective views. Data associated with the workflow and the selected perspective views are transmitted to an online engine. The online engine may include a query formulation module for automatically forming a query based on the received workflow data and selected perspective views. The formulated query may be supplied to a search engine to retrieve online results based on relevance to the formulated queries. One or more most relevant online results may be seamlessly served to the user as part of the workflow.

Abstract: A configuration object is provided to configure a server. The configuration object can include storage node information for a first set of storage nodes available to a server. The configuration object determines, from the storage node information, a second set of storage nodes for inclusion in a map. The configuration object maps each storage node in the second set of storage nodes to a different index value in a set of index values. The configuration object receives an object identifier for a first object, transforms the object identifier into a resulting index value in the set of index values and, based on a determination that a first storage node is mapped to the resulting index value in the map, selects the first storage node as a target storage node for servicing a request to perform a first operation with respect to the first object.

Abstract: A computer-implemented method includes accessing data from distinct data domains corresponding to different data sources, and determining a core dimension of the accessed data common to first and second distinct data domains. The method further includes generating a data set from the data sources using a columnar data generation engine, and deriving, from the data set via stateless processing, a first guided page including actionable elements depicting data derived from the first distinct data domain. The method further includes responsive to a user interaction with one of the actionable elements, providing, dependent on the common core dimension, direct navigation from the first to the second distinct data domain, and predicting, from the data set based on machine learning and prior to the user interaction, a second guided page that depicts data derived from the second distinct data domain and is presented responsive to the direct navigation.

Abstract: Aspects of the disclosure relate to management of databases in different server environments. In particular, various aspects of this disclosure relate to correction, synchronization, and/or migration of databases between different database servers. A feed file that is rejected from loading in a database associated with a source server may prioritized in a destination server. A feed file hierarchy of the rejected feed file may be determined and the destination server may process loading of the rejected feed file to a database based on the determine feed file hierarchy. Any corrections applied at the destination server may also be applied at the source server.

Abstract: Techniques are described herein that are capable of selecting checkpoints of a database job. For instance, at compile time, temporal indicators associated with the query plans of the database job are determined. Each temporal indicator indicates first and second subsets of stages of the respective query plan. Values of attributes of each stage in at least each first subset are predicted using a machine learning technique. At the compile time, candidate stage(s) for each query plan are identified based on the respective candidate stage being a child of stage(s) in the corresponding second subset or not being a child of another stage in the respective query plan. The candidate stage(s) for each query plan are selectively chosen as respective checkpoint(s) based on whether the values of the attributes of each stage in at least the first subset of the stages of the respective query plan satisfy one or more criteria.

Abstract: Techniques for performing network-assisted peer discovery to enable peer-to-peer (P2P) communication are described. In one design, a device registers with a network entity (e.g., a directory agent) so that the presence of the device and possibly other information about the device can be made known to the network entity. The network entity collects similar information from other devices. The device sends a request to the network entity, e.g., during or after registration. The request includes information used to match the device with other devices, e.g., information about service(s) provided by the device and/or service(s) requested by the device. The directory agent matches requests received from all devices, determines a match between the device and at least one other device, and sends a notification to perform peer discovery. The device performs peer discovery in response to receiving the notification from the network entity.