Abstract: A method is provided for analyzing and interpreting a dataset composed of electronic documents including free-form text. The method includes unifying terms of interest in the collection of terms of interest to identify variants of the terms of interest. This includes identifying candidate variants of a term of interest based on semantic similarity between the term of interest and other terms in the database, determined using an unsupervised machine learning algorithm. Linguistic features and contextual features of the term of interest and its candidate variants are extracted, at least the contextual features being extracted using the unsupervised machine learning algorithm. And a supervised machine learning algorithm is used with the linguistic features and contextual features to identify variants of the term of interest from the candidate variants, such as for application to generate features of the documents for data analytics performed thereon.

Abstract: A computer-implemented method according to one embodiment includes receiving, at a virtual file system, replicated data from a physical file system, transferring the replicated data from the virtual file system to cloud storage, and providing access to the replicated data in response to an unavailability of the physical file system, utilizing the virtual file system and the cloud storage.

Abstract: A database management system (DBMS) generates a query execution plan including information representing one or more database (DB) operations necessary for executing a query and executes the query based on the query execution plan. In the execution of the query, the DBMS dynamically generates a task for executing a DB operation and executes the dynamically generated task. The DBMS executes a task in a plurality of threads executed by a processor core.

Abstract: A method is disclosed. The method includes receiving a text phrase from a user and parsing the text phrase using a natural language parser to generate distinct words. A vector of values relating to the distinct words is generated and compared to vectors in a graph database which relate to learned communities of language. Based on the comparing, a most similar community in the learned communities of language is determined and an action set action set associated with the most similar community is queried. A response to the text phrase from the user is then generated based on the action set and provided to the user.

Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve redistributing the in-memory database object portions on changes to the clustered database system. Each node may maintain a mapping indicating which nodes in the clustered database system store which chunks, and timestamps indicating when each mapping entry was created or updated. A query coordinator may use the timestamps to select a database server instance with local in memory access to data required by a portion of a query to process that portion of the query.

Abstract: A tree-based format may be implemented for data stored in a data store. A table may be maintained across one or multiple storage nodes in storage slabs. Storage slabs may be mapped to different nodes of a tree. Each node of the tree may be assigned a different range of distribution scheme values which identify what portions of the table are stored in the storage slab. Storage slabs mapped to child nodes in the tree may be assigned portions of the range of distribution scheme values assigned to a parent. Storage nodes may be added or removed for storing the table. Storage slabs may be moved from one storage node to another in order to accommodate the addition or removal of storage nodes.

Abstract: Various aspects provide for implementation of a cloud service for running, monitoring, and maintaining cloud distributed database deployments and in particular examples, provides cloud based services to run, monitor and maintain deployments of the known MongoDB database. Various embodiments provide services, interfaces, and manage provisioning of dedicated servers for the distributed database instances (e.g., MongoDB instances). Further aspects, including providing a database as a cloud service that eliminates the design challenges associated with many distributed database implementations, while allowing the client's input on configuration choices in building the database. In some implementations, clients can simply identity a number of database nodes, capability of the nodes, and within minutes have a fully functioning, scalable, replicated, and secure distributed database in the cloud.

Abstract: Various methods, apparatuses/systems, and media for application of an N-dimensional hypercube datatype for automatically generating a data structure are provided. A database stores a plurality of data each associated with a corresponding application and each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata and store the taxonomies onto the database; receive the metadata and the taxonomies from the database via a communication network; automatically generate a cube set including a set of N-dimensional hypercubes from the received metadata to represent the metadata describing the information about the data; automatically generate a map from the cube set to express data quality checks and rules that apply to nodes in the map; and apply the data quality checks and rules to the received metadata to automatically generate a data structure.

Abstract: In the field of government engagement management, for users of an employee desktop web client, it is now possible, within the web client application, to search and read articles and/or knowledge content that has been authored to external locations. Due to this integration to external, third-party applications, content and/or articles can be displayed to an agent on the employee desktop web client graphical user interface. Agents can enter free text into a specific search field and review the results in summary form, and then select an article in HTML format to progress the current interaction with the client. An additional feature extending from this capability is to add an amount of coding to external knowledge content websites that are owned and/or operated by the owner of the system such that when the website is viewed through the third-party integration module, a button or icon appears within the website that when selected takes the agent to an appropriate form.

Abstract: An example system includes a processor to receive updates for a database of a publish and subscribe system. The processor is to generate an optimistic update based on the received updates. The processor is also to adaptively update the database using the optimistic update. In some examples, the processor generates a bulk optimistic update based on the optimistic update and adaptively updates the database using the bulk optimistic update or a read-modify-write sequence.

Abstract: Techniques for generating and searching semantic flow graphs are provided that include creating, by a system operatively coupled to a processor employing a semantic flow graph creation process, a semantic flow graph based on an ontology associated with a set of subjects and a raw flow graph determined from an analysis of a data set relating to the set of subjects and searching, by the system, the semantic flow graph to determine a subset of information of the semantic flow graph that is responsive to a query based on the query and information of the semantic flow graph.

Abstract: The present disclosure relates to importing license data from a license metric tool server (LMTS) into a configuration management database (CMDB). License records are requested and received from the LMTS and are subsequently imported as into the CMDB of a client instance as configuration item (CI) data. In certain circumstances, a license record may have an identifier field (ID) value that does not correspond to a CI of the CMDB, resulting in the license record failing to import. The disclosed process involves flagging license records that fail import, and then clustering the flagged license records into suitable groups. The flagged license records are then re-pulled from the LMTS in groups, rather than using individual requests for each flagged license record. By effectively clustering of the flagged license records into groups, the disclosed importation process enables a reduction in processing, memory, and/or communication overhead, improving operation of the client instance.

Abstract: A computer-implemented method of establishing metadata associated with a transaction in a transaction processing system having application logic for executing the transaction, the computer-implemented method includes receiving, from a requestor, request data associated with the transaction, the request data comprising data and metadata. The method also includes peeking, during receiving the request data, of the request data looking for the metadata associated with the transaction and responsive to finding metadata associated with the transaction, directly instantiating an instance of application logic.

Abstract: Systems and methods for performing structure and attribute based graph partitioning. An exemplary system can receive a plurality of transactions, with each transaction identifying a point of sale and an item exchanged by the transaction. The system can generate a structure graph of the plurality of transactions and receive a request to partition the structure graph into sub-categories. The system can then retrieve, from a database, attributes of each respective structure vertex in the structure vertices. Using those attributes and the structure graph, the system can generate a structure-attribute graph. The system can then generate a unified neighborhood matrix of the structure-attribute graph; and partition the structure graph based on the unified neighborhood matrix.

Abstract: Techniques for indexing file paths of items in a content repository may include querying, by at least one processor, a content repository stored on at least one computer readable storage medium for one or more items that qualify for file path indexes, do not have the file path indexes, and have a parent folder that has a file path index, wherein the querying does not depend on results from previous queries, and wherein the file path index indicates an associated item's location in a folder tree, creating, by the at least one processor, the file path indexes for resulting items from the querying, and, if the querying results in at least one resulting item, repeating the querying of the content repository and the creating of the file path indexes until the querying results in zero resulting items.

Abstract: A data management device is provided, which includes an interpreting unit that interprets an input record, and convert the input record to abstract expression by which a correspondence relation between a data item and data itself is recognizable; and a converting unit that stores, in a storage unit, a data set, in which the data itself and index information capable of identifying the record are associated, as column data for each of the data items.

Abstract: Systems and methods capable of initializing centroids in large datasets before commencement of clustering operations. The systems and methods can utilize a random sampling window to increase the speed of centroid initialization. The systems and methods can be modified to leverage parallelism and be configured for execution on multi-node compute clusters. Optionally, the initialization systems and methods can include post-initialization centroid discarding and/or re-assignment operations that adaptively control cluster sizes.

Abstract: Methods, systems, and apparatus are described for processing mutations for a remote database. In one aspect, a method includes receiving a log of database mutations from a client device, the log of database mutations indicating changes previously made to a client version of a database stored on the client device, and each database mutation specifying: an entity included in the database; an operation for the entity; and a client version number for the entity; identifying, in the log of database mutations, two or more database mutations that each specify a same client version number for a same entity; determining, based on a conflict resolution policy, that the two or more database mutations are eligible for collapsing; and collapsing the two or more database mutations into a single database mutation.

Abstract: Systems, methods, and computer-readable media for pinning query execution plans are described. A database system may obtain a query, and determine a organization identifier and/or user identifier associated with the query. The database system may identify an optimized plan among a set of query plans that correspond with the query, and may generate a query execution plan based on the query and the optimized plan. The database system may determine a pinned plan that is associated with the optimized plan, and may generate a query execution plan based on the pinned plan when the pinned plan is associated with the optimized plan and corresponds with the organization identifier and/or the user identifier. The database system may generate a query execution plan using optimization functions when the pinned plan is not associated with the pinned plan, or the organization identifier and/or the user identifier. Other embodiments may be described and/or claimed.

Abstract: A data generation method includes: with regard to a target in which a plurality of sets of reference source data and reference target data are connectable by using edges, extracting information that corresponds to a complete bipartite graph from the connected target; and when there are a plurality of sets of reference source data and a plurality of sets of reference target data that are the extracted information and that constitute the complete bipartite graph, generating a virtual node between the reference source data and the reference target data.