Abstract: A method for adaptive concurrency for write persistence in a storage system, performed by the storage system, is provided. The method includes selecting a write process from among a plurality of write processes, responsive to receiving a write request for writing data into the storage system, and writing the data into the storage system in accordance with the selected write process. One of the plurality of write processes includes transferring the data into the storage system, locking an inode associated with file information of the data in memory, updating the file information in the inode while the inode is locked, committing the data while the inode is locked, and unlocking the inode.

Abstract: A data management system (1) for managing a data store (6), the system comprising: a central control module (2) configured to receive a request and generate a task using the request; a state store module (26) coupled to the central control module (2) and configured to store the task generated by the central control module (2), wherein the state store module (26) is further configured to store state information indicative of a state of the data store (6) and configured to output the stored task in response to the state information; and an enactor module (31) which is configured to action the task output from the state store module (26) by generating an enactor output command that at least partly corresponds to the task which, when communicated to the data store (6), causes the data store (6) to perform an action related to data stored in the data store (6).

Abstract: A method displays a graphical user interface for a data visualization application. The user interface includes a schema information region that includes fields from a database. A user specifies a first aggregation using the interface. The first aggregation groups by a first set of fields and specifies an aggregated output field. The user also specifies a second aggregation. The second aggregation references the first aggregation and groups by a second set of fields. The set may include the aggregated output field. The second set is different from the first set. The method builds a visual specification based on the first and second aggregations. The method may retrieve tuples of data from the database using database queries generated from the visual specification, where each tuple includes data calculated based on the second aggregation. The method may display a data visualization, including the data calculated based on the second aggregation.

Abstract: In some examples, natural language processing (NLP) and artificial intelligence based searching may include identifying named entities in text from a corpus of documents. References in the text may be resolved with the identified named entities. Links between the named entities may be determined, and a bi-direction rootless graph may be generated. Semantic relationships may be determined from text of the named entities, and blacklist keywords may be identified. Machine learning classification may be performed based on a pair of the named entities and a blacklist keyword. A classification may be determined based on the pair of named entities and the blacklist keyword, and a rule may be identified that specifies which named entity in the pair is to be flagged. Further, a node in the graph may be flagged based on an association with the named entity identified according to the rule.

Abstract: Techniques are disclosed for managing a high performance, fault-tolerant, strongly consistent, distributed key-value store system. The key-value store may store information, such as metadata for a distributed file system. Fault-tolerance means that the distributed key-value store continues to provide access to values in the key-value store in spite of a certain number of node failures. To provide this capability, the key-value store may store copies of (key, value) pair on N+1 nodes in order to provide fault tolerance for the failure of up to N nodes. In addition, metadata describing which nodes store a given value is stored on 2N+1 nodes and the distributed key-value store is sized such that there are 3N+1 nodes in a cluster. Doing so allows the key, value store to tolerate a failure of N nodes, while still maintaining a consistent and available key-value store.

Abstract: In general, the invention relates to a method for servicing query requests. The method includes determining, by a first query node and in response to a first query request, a user data sub-region and a target sub-region associated with the first query request. The further includes identifying a first input sub-region of the target sub-region using a data flow graph, identifying a second query node associated with the first input sub-region, and issuing a second query request to the second query node to obtain data associated with the first input sub-region. The method further includes receiving, in response to the second query request, a second query result from the second query node, generating a first query result for the target sub-region using at least the second query result, and providing the first query result to an entity associated with the issuance of the first query request.

Abstract: The present invention extracts and then analyses data based on a set of communication between an enterprise and a user associated with the enterprise. A system for extracting and analyzing the data comprising: a database and a processor communicatively coupled with the database and an Output Unit. The processor is configured to categorize data present in the database after extraction, associate the data with a set of parameters, and send the associated data to the output unit. The database includes user metadata, interaction data, and interaction metadata and the processor comprises a Data Acquisition Unit, a Data Categorization Unit, and a Model Processing Unit. The Model Processing Unit comprises of a Habit Formation Unit and a Recommendation Unit. Further, a method for extracting and analyzing data of a user of an enterprise over a pre-defined period of time has also been discussed.

Abstract: Provided are techniques for gauging credibility of digital content items. For each digital content item in a list of digital content items, a usage score is identified for each different level of usage and for a user base and the usage score for each different level of usage is added to obtain a total usage score for the digital content item. Each digital content item in the list is ranked using the total score of each digital content item.

Abstract: Technologies are provided for capturing information during a data migration and to use the captured information to generate data migration artefacts that can be used in subsequent data migrations. Artificial intelligence techniques can be used to analyze the captured data migration information and to generate a data migration model that can be used to create the data migration artefacts. Changes made to the data migration artefacts can be tracked and used to train the data migration model. Additionally or alternatively, during execution of the subsequent data migration, additional data migration information can be captured and used to train the data migration model. The captured data migration activity can include data access operations such as data transactions, system log activity, and/or source code for one or more data migration programs and/or scripts. Computer system version information can be detected and different migration artefacts can be created for different computer system versions.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for dynamic partition selection. One of the methods includes receiving a representation of a query plan generated for a query, wherein the query plan includes a dynamic scan operator that represents a first computing node obtaining tuples of one or more partitions of a table from storage and transferring the tuples to a second computing node that executes a parent operator of the dynamic scan operator. A partition selector operator is generated corresponding to the dynamic scan operator. A location in the query plan is determined for the partition selector operator. A modified query plan is generated having the partition selector operator at the determined location.

Abstract: Disclosed is a pesticide residue detection data platform based on high resolution mass spectrum, the Internet and data science, and a method for automatically generating a detection report. The platform includes allied laboratories, a detection result database of the allied laboratories, four basic sub-databases, a data collection system and an intelligent data analysis system. The intelligent analysis system reads data according to conditions set by a user, performs various statistical analyses according to a statistical analysis model, generates charts, obtains a comprehensive conclusion, and returns an analysis result to the client ends of the allied laboratories.

Abstract: Examples of the present disclosure describe systems and methods of personalizing natural language systems. In aspects, personal data may be uploaded to a personalization server. Upon receiving a data request, a server device may query the personalization server using a user's login information. The login data and the associated personal data may be paired and provided to the personalization server. The paired data may then be provided to a language understanding model to generate a response to the data request. The data in the response may be used to train the language understanding model.

Abstract: Embodiments generally relate transforming data for a target schema. In some embodiments, a method includes receiving input data, where the input data includes a plurality of segments, and where the segments include a plurality of source fields containing target data. The method further includes characterizing the input data based at least in part on a plurality of predetermined metrics, where the predetermined metrics determine a structure of the input data. The method further includes mapping the target data in the source fields of the segments to a plurality of target fields of a target schema based at least in part on the characterizing. The method further includes populating the target fields of the target schema with the target data from the source fields based at least in part on the mapping.

Abstract: A computer-implemented method of establishing influence relationships between data in a question-answering environment is disclosed. Establishing influence relationships can include determining a set of conditions indicating a set of user statuses and analyzing, using a first natural language processing technique, a corpus of data including a set of user data. Establishing influence relationships between data can include identifying, based on analyzing the corpus of data, a set of influence factors corresponding to a subset of the set of user data and to a subset of the set of conditions. In embodiments, establishing influence relationships can include establishing, based on the set of influence factors, a set of influence relationships between the subset of the set of user data and the subset of the set of conditions.

Abstract: A method of performing deduplication is provided. The method includes (a) selecting, by applying a deterministic selection criterion, a sub-block of a block of data that contains multiple sub-blocks; (b) performing a lookup, into a deduplication table, of a digest generated by hashing the selected sub-block, the lookup matching an entry indexed by the digest in the deduplication table, the entry identifying a previously processed block; and (c) effecting storage of the block, including pointing to the previously processed block. An apparatus, system, and computer program product for performing a similar method are also provided.

Abstract: Candidate data record prioritization for match processing includes identifying candidate records for use in match processing to determine records that match to an incoming record. The candidates are grouped into buckets according to bucket roles, with each bucket correlating to a bucket role, and with each bucket role being defined by a unique record attribute set. The method obtains an effectiveness score for each of the bucket roles. The scores are measures of effectiveness of the bucket roles in identifying candidates that match to incoming data records. The method establishes an order of priority in which to process the candidates by prioritizing the buckets into an order based on the effectiveness scores for the bucket roles. The process then commences match processing to process the candidates in the established order of priority where the match processing processes candidates of a higher priority bucket before processing candidates of lower priority buckets.

Abstract: In accordance with embodiments, there are provided mechanisms and methods for facilitating dynamically unified system of record in an on-demand services environment in a multi-tenant environment according to one embodiment. In one embodiment and by way of example, a method includes integrating, by and incorporating into the database system, a plurality of subsystems into a unified system of record (“unified system), where each subsystem is independent of and incompatible with other subsystems of the plurality of subsystems, and collectively managing the plurality of subsystems, where collectively managing includes facilitating common communication within and between and uniform management of the plurality of subsystems based on common communication criteria and unified storage of data associated with the plurality of subsystems.

Abstract: Various embodiments are generally directed to techniques to provide specific vehicle recommendations to generic user requests. Various techniques, methods, systems, and apparatuses include utilizing one or more tags generated by application of a machine learning model to a data source, where the data source may include generic and specific language with respect to one or more automobiles or vehicles, to provide a recommendation for a particular automobile in response to a user request for a suggestion.

Abstract: Windowed queries with event-based open times are described for use in data analytics for streaming data. A window semantic may be used to define windowed queries of an analytics application that, when executed against an incoming data stream, open a window at a time when a first event associated with a grouping key is received by a windowed query. The window remains open for a predefined duration specified in the windowed query, and query results may be generated based on any events associated with the grouping key that are received while the window remains open. After a lapse of the predefined duration, the window closes, and the query results may be output in association with the window.

Abstract: A method for distribution of directories in a storage system is provided. The method includes distributing information, regarding location in the storage system of a plurality of files in a directory, to a plurality of owners in a plurality of storage nodes of the storage system, wherein ownership of differing subsets of the plurality of files of the directory is distributed among differing owners in differing storage nodes. The method includes receiving a request for location information in the storage system of a file of the plurality of files in the directory and determining, based on a file name of the file and an identity of the directory, which of the plurality of owners has ownership of the file and the location information for the file.