Abstract: A data analysis system allows users to interact with distributed data structures stored in-memory using natural language queries. The data analysis system receives a prefix of a natural language query from the user. The data analysis system provides suggestions of terms to the user for adding to the prefix. Accordingly, the data analysis system iteratively receives longer and longer prefixes of the natural language queries until a complete natural language query is received. The data analysis system stores natural language query templates that represent natural language queries associated a particular intent. For example, a natural language query template may represent queries that compare two columns of a dataset. The data analysis system compares an input prefix of natural language with the natural language query templates to determine the suggestions. The data analysis system receives user defined metrics or attributes that can be used in the natural language queries.

Abstract: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.

Abstract: Aspects of the invention relate to a computer-implemented method of improving the efficiency of an electronic collateralisation search engine that uses assets distributed on one or more remotely-located asset depositories. The method comprises selecting from a database of asset records of the remotely-located assets of a collateral giver, a subset of asset records having asset characteristics that satisfy a collateral giver's one or more predefined threshold criteria. Restricting a received search of collateral giver's asset records, which match a collateral receiver's query, to the subset of collateral giver's asset records.

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: A method for searching for multiple sub-strings of an original text is provided. A search query is received, wherein the search query includes a plurality of sub-strings. A hash array is allocated. The hash array has a size based, at least in part, on the plurality of sub-strings and an original text. The hash array is populated with a plurality of hash values, wherein the plurality of hash values are generated using a rolling hash function, and wherein each of the plurality of hash values corresponds to a portion of the original text. A plurality of sub-string values are computed based on the plurality of sub-strings. Each of the plurality of sub-strings are determined to occur in the original text based, at least in part, on searching the hash array for the plurality of sub-string values.

Abstract: Embodiments relate to a system, method and program product for performing code conversions. In one embodiment the method includes determining size of encoding space for a source file and a target file upon receipt of a code conversion request and generating a main conversion file upon determination that a target encoding space associated with said target file is smaller than a source encoding space associated with the source file. Subsequently an extension converted file is generated from the source file according to a pre-established mapping table of code conversion stored in a memory. The code conversion request is completed by using the main conversion file and said extension file together so that the source file does not need to be truncated in order to fit into the target conversion space.

Abstract: A source code search comprises a two-pass search. The first pass comprises a topological measure of similarity. The second pass comprises a semantic measure of similarity. The query source code is a user-selected portion of source code. The results may be ranked and output to an I/O device.

Abstract: Techniques for generating a schema for a data input file are described herein. In an embodiment, a server computer receives a data input file. The server computer system selects a sample excerpt from the data input which comprises a subset of the data input file. The server computer system analyzes the sample excerpt to determine a row delimiter for the data input file, a column delimiter for the data input file, and a plurality of data format types. Using the column delimiter, row delimiter, and plurality of data format types, the server computer system generates a candidate schema for the data input file.

Abstract: Methods, systems, and computer program products for determining a recommended set of actions from operational data are provided herein. A computer-implemented method includes associating multiple action templates with a set of operational data corresponding to a query; selecting a first action template from the multiple action templates; identifying one or more attributes associated with the first action template; forming a first step of a resolution action in response to the query by populating the first action template with at least one of the attributes; repeating, based on the first step of the resolution action and the set of operational data, said selecting, said identifying, and said forming for at least a second action template to form a second step of the resolution action; and outputting the resolution action, wherein the resolution action comprises a fixed sequence of at least the first step and the second step.

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: Described are methods, apparatus and computer programs for managing persistence within a data processing system such as a messaging system, database system or file system. The method for managing persistence includes a deferred evaluation (230,330,430) of at least one criterion associated with costs and/or benefits of saving to persistent storage, instead of persistence behaviour being fully predefined. The evaluation may be performed when a disk write is about to be performed (240,340,440), or at various times during processing of a data update and at various points within a data processing network. In a messaging solution, the method for managing persistence includes a dynamic evaluation (230,330,430) of costs and/or benefits of saving to persistent storage, with the evaluation being performed at various points in the messaging network after the message has been created and sent by the originating entity.

Abstract: A method and apparatus for maintaining file system consistency in a distributed system using version vectors is presented. A method generally includes comparing incarnation and transaction identifiers of a current version vector associated with a file with incarnation and transaction identifiers of a last completed version vector associated with the file. Upon determining that a current version vector reflects operations on the file that are either earlier than or the same as the identifiers in the last completed version vector, the node performing one or more file system operations on the file.

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: The present disclosure relates to evaluating different semantic interpretations of a search query. One example method includes obtaining a set of search results for a particular search query submitted to a search engine; obtaining a set of semantic interpretations for the particular search query; obtaining, for each semantic interpretation of the set, a canonical search query; generating a modified search query based at least in part on the particular search query and the canonical search query for the semantic interpretation; obtaining a set of search results for the modified search query for the semantic interpretation; and determining, for each semantic interpretation of the set, a degree of similarity between (i) the set of search results of the modified search query for the semantic interpretation, and (ii) the set of search results for the particular search query.

Abstract: The embodiments describe computer implemented systems and methods for stakeholder analysis and classification, which may be used within knowledge ecosystems. The embodiments may include the selection and implementation of one or more stakeholder analysis models, where one or more variables describing one or more relevant stakeholder aspects may be used to assess and classify one or more stakeholders. The analysis may be used to determine the relative impact and influence of the one or more stakeholders on a project and the impact that one or more projects may have on one or more stakeholders. This analysis may consequently improve stakeholder relationships through the creation of suitable stakeholder policies.

Abstract: Methods and systems for generating a database index and searching the database index are described herein. In one aspect this may include receiving an item of database data, wherein the item of database data comprises a sequence of data elements. Groups of data elements may be identified within the received item of database data. If any one or more of the identified groups of data elements have not been previously identified within the item of database data and/or previous items database data then the one or more identified group may be stored as index entries in a database index. Information describing the sequence of the groups of neighbouring data elements may be recorded within the database index as they are located within the item of database data. The database index may be searched based on a received search term comprising a sequence of data elements.

Abstract: A social networking system selects advertisements for a user based on user characteristics of the user in response to a request to present an advertisement to the user. To increase the number of advertisements eligible for presentation to the user, the social networking system associates the user with one or more cluster groups associated with targeting criteria that are not satisfied by the user's characteristics. To determine whether to associate a user with a cluster group, the social networking system determines a cluster score for the cluster group based on the user's characteristics. If the cluster score equals or exceeds a cluster cutoff score for the cluster group, the user is associated with the cluster group. The cluster cutoff score may be determined based on an estimated distribution of users so that a target number or percentage of users have cluster scores less than the cluster cutoff score.

Abstract: A system and method providing a multi-party document revision capability. A master electronic document (MED) may be established on a central computer platform. The MED is embedded with an unalterable document identification code (DIC) which clearly identifies the single instance of the MED. Parties having permission to access, modify, and approve the MED on the central computer platform are each provided with a unique identifier code (UIC) which is associated with the DIC and, therefore, the MED. Any permitted party having an assigned UIC may access the MED and enter proposed changes to the MED on the central computer platform. However, each party associated with the MED has to approve any proposed change before the proposed change is automatically entered as a formally accepted change into the MED.

Abstract: Systems and methods are provided for fragmentation. A dataset including data records is received. Fragments corresponding to the data records are determined. A fragment identifier table is determined which includes a plurality of fragment codes. Each fragment code uniquely corresponds to each fragment. A fragment having a fragment attributes is selected. Based on the fragment attributes, a fragment boundary set is determined. Each fragment boundary set is unique to each fragment code. An encoded limited cardinality dataset is generated based on the fragment boundary sets for visualization on a client device.

Abstract: An online data management (ODM) system can be configured to parse tool data for a particular project provided from a plurality of disparate software tools employed for project management. The ODM system can also be configured to generate a data structure based on the tool data, wherein the data structure comprises a hierarchy of interconnected objects. The ODM system can further be configured to identify relationships between objects of the data structure.