Incremental and collocated redistribution for expansion of an online shared nothing database

This invention relates to a system, method and computer program product for redistribution of data in an online shared nothing database, said shared nothing database comprising a plurality of original partitions and at least one new partition. The method comprises identifying two or more collocated tables in the original partitions to be redistributed over the original partitions and at least one new partition, said tables having data rows, each data row residing on a partition governed by a distribution key. New tables are created in the new partition and a UNION ALL view of all the data from both the original and new tables using the check constraints is created, said check constraints based on the distribution keys. A loop of intervals is defined over the distribution key range, and a data mover performs data movement of each data row over the current distribution key interval from the original tables to the new tables. The check constraints are altered for each distribution key interval ...

MEMORY HAVING INFORMATION REFINEMENT DETECTION FUNCTION, INFORMATION DETECTION METHOD USING MEMORY, DEVICE INCLUDING MEMORY, INFORMATION DETECTION METHOD, METHOD FOR USING MEMORY,AND MEMORY ADDRESS COMPARISON CIRCUIT

There is provided an externally readable memory for storing information in each memory address, and this memory is provided with an information refinement detection function; this memory comprises: an input means for entering first input data for comparing data items stored in the memory and second input data for comparing addresses in the memory, wherein the first and second comparison data are externally; means for determining matches/mismatches of both data items stored in the memory and addresses of the memory according to both of the input data provided by the input means, and further performing logic operations on both of the match/mismatch determination results; and means for outputting addresses with positive results of the logic operations. This memory may be applicable in a broad range of fields including intelligent information search as well as artificial intelligence.

OPTIMIZING RESPONSE CREATION AND DELIVERY FOR LENDING QUERIES

A search request may define a minimum value and a maximum value for a numerical parameter of the search. A plurality of binary searches may identify a minimum entry and a maximum entry, each binary search comprising selecting a single entry and using at least one analytical model to generate a score for the single entry, wherein the score of the minimum entry corresponds with the minimum value and the score of the maximum entry corresponds with the maximum value. The at least one analytical model may be used to generate a score for each of a set of entries between the minimum entry and the maximum entry while ignoring entries outside of the set of entries between the minimum entry and the maximum entry. Entries responsive to the request may be identified within the scored set of entries ...

SYSTEM AND METHOD FOR INDEXING INFORMATION ABOUT ENTITIES FROM DIFFERENT INFORMATION SOURCES

A system and method for indexing (34-38) a data record (78) from an information source into a database (58), the database (58) containing a plurality of data records, is provided comprising receiving a data record (152) from an information source (50), the received data record (152) having a predetermined number of fields containing information about a particular entity (56), standardizing (174) and validating (172) the data in the received data record (76). A system and method is also provided for retrieving records that refer to an entity (302) characterized by a specific set of data values (88) by comparing a predetermined number of fields within the data records already in the database, selecting data records already in the database as candidates (306) having data within some of the predetermined fields that is identical to the data in the fields of the received data record, and scoring (308) the candidates (306) to determine data records having information about the same entity (52 ...

Query pruning using interior circles for geodetic data in an R-tree index

A method for determining relationships among data representing regions on a surface of a body. The method includes identifying a center of a first geometry. A minimum distance is identified from the center to a boundary of the first geometry. A first circle is defined on the surface of the body having the minimum distance as its radius and the center of the first geometry as its center. The first circle is compared with a second geometry to determine if the second geometry fulfills a first filter condition with respect to the first geometry.

SYSTEMS AND METHODS FOR AUTO DISCOVERY OF FILTERS AND PROCESSING ELECTRONIC ACTIVITIES USING THE SAME

The present disclosure relates to systems and methods for filtering electronic activities. Exemplary implementations may include ingesting a first electronic activity; identifying an associated entity; and selecting a first filtering model based on the entity, the first filtering model trained to indicate whether to restrict further processing of ingested electronic activities. The method may further include generating a plurality of structured data tags for the first electronic activity; applying the selected first filtering model to the plurality of structured data tags for the first electronic activity to determine whether the first electronic activity satisfies a first restriction condition; and responsive to the first electronic activity satisfying the first restriction condition, restricting the first electronic activity from further processing; or responsive to the first electronic activity not satisfying the first restriction condition, further processing, by the one or more processors ...

Method and a system for efficient data sorting

Methods and an apparatus for data sorting is provided. Keys are derived from a data set and a mapping function is obtained for sorting the data set in accordance with the mapping function. A wide key sort on the keys is performed over a plurality of distributed nodes using the mapping function, resulting in sorted lists of rows from the data set produced in parallel from the nodes with each row associated with a unique one of the keys pushed to a stack machine. The sort process is an ordered row traversal from the stack machine.

SYSTEMS AND METHODS FOR AUTO DISCOVERY OF FILTERS AND PROCESSING ELECTRONIC ACTIVITIES USING THE SAME

The present disclosure relates to systems and methods for filtering electronic activities. Exemplary implementations may include ingesting a first electronic activity; identifying an associated entity; and selecting a first filtering model based on the entity, the first filtering model trained to indicate whether to restrict further processing of ingested electronic activities. The method may further include generating a plurality of structured data tags for the first electronic activity; applying the selected first filtering model to the plurality of structured data tags for the first electronic activity to determine whether the first electronic activity satisfies a first restriction condition; and responsive to the first electronic activity satisfying the first restriction condition, restricting the first electronic activity from further processing; or responsive to the first electronic activity not satisfying the first restriction condition, further processing, by the one or more processors ...

METHOD AND APPARATUS FOR FORWARDING CONTENT BETWEEN DIFFERENT APPLICATION PROGRAMS

Example methods and apparatuses for forwarding content between different application programs are disclosed. In one example method, a first address book of a first application program is associated with a second address book of a second application program. When a content forwarding instruction is received, the second address book is invoked and displayed, where the content forwarding instruction is used to forward selected content in the first application program to the second application program. A contact selected by a user is determined, and the selected content is forwarded to the determined contact. 1. A method for forwarding content between different application programs , wherein the method comprises:associating a first address book of a first application program with a second address book of a second application program;in response to receiving a content forwarding instruction, invoking and displaying the second address book, wherein the content forwarding instruction is used to forward selected content in the first application program to the second application program;determining selection of a contact by a user; andforwarding the selected content to the selected contact.2. The method according to claim 1 , wherein the associating a first address book of a first application program with a second address book of a second application program comprises:obtaining, by the first application program, permission to read and copy the second address book; andobtaining, by the second application program, permission to read and copy the first address book.3. The method according to claim 1 , wherein the associating a first address book of a first application program with a second address book of a second application program comprises:combining the first address book with the second address book; andgenerating a common address book.4. The method according to claim 3 , wherein the combining the first address book of the first application program with the second address ...

Method and system for efficient feature matching

A method of non-identical feature matching in a search system, the search system having a set of data points. The method includes determining a threshold error and expanding the set to create an expanded set by including all data points as data elements of the expanded set and, for every data point in the set, finding all data elements within an error distance of that data point and adding those found data elements to the expanded set, wherein the error distance is a function of the threshold error. The method includes creating a summary representation of the expanded set by constructing a binary array using a plurality of hash functions as a bloom filter. The method may further include receiving a query and applying the plurality of hash functions to the query to determine, from the binary array, whether the query matches one of the data elements in the expanded set and, if so, outputting a match.

FAST IDENTIFICATION OF COMPLEX STRINGS IN A DATA STREAM

A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

SYSTEMS AND METHODS FOR GENERATING A FILTERED DATA SET

The present disclosure relates to generating a filtered data set. Data from a plurality of systems of record of a plurality of data source providers may be accessed. A master data set generated using the data accessed from the plurality of systems of record may be maintained. Restriction policies including one or more rules for restricting sharing of data may be maintained. A filtered data set may be generated for a data source provider responsive to an application of restriction policies of other data source providers to the master data set. The filtered data set may be provisioned.

Automatic tuning of thresholds and weights for pair analysis in a master data management system

An approach for tuning a data management system is provided. A processor retrieves one or more samples pairs of record data. A processor determines an error rate regarding the performance of a matching operation of a data management system based on the one or more sample pairs. In response to the error rate being above a value, a processor adjusts at least one threshold value associated with the matching operation of the data management system.

Adaptive field-level matching

Adaptive field-level matching is described. A system identifies first elements in a field of a prospective record for a database, and second elements in the field of a candidate record, in the database, for matching the prospective record. The system identifies features corresponding to any of the first elements that are identical to any of the second elements, any of the first elements that are absent from the second elements, and any of the second elements that are absent from the first elements. A machine-learning model uses the features to determine a field match score for the candidate record's field. Another machine-learning model weighs the field match score and weighs another field match score for another field of the candidate record to determine a record match score for the candidate record. If the record match score satisfies a threshold, the system identifies the candidate record as matching the prospective record.

СПОСОБЫ И СИСТЕМЫ ДЛЯ РЕАЛИЗАЦИИ ПРИБЛИЖЕННОГО СРАВНЕНИЯ СТРОК В БАЗЕ ДАННЫХ

... 1. Компьютерный способ сравнения символьных строк для сравнения символьной строки кандидата с множеством записей символьных строк, сохраненных в базе данных, причем упомянутый способ включает:выделение одного или более символьных строк во множестве записей символьных строк для создания набора ссылочных символьных строк посредством факторного анализа основных компонент (PCFA) для идентификации разнородных ссылочных символьных строк во множестве записей символьных строк;генерацию двоичного индексного ключа для каждого из символьных строк в наборе символьных строк, причем двоичный индексный ключ содержит несколько бит двоичной информации и каждый бит показывает степень подобия символьной строки набору ссылочных символьных строк;генерацию двоичного индексного ключа для символьной строки кандидата;определение набора записей символьных строк, сохраненных в базе данных, который включает двоичный индексный ключ, точно совпадающий с двоичным индексным ключом символьной строки кандидата;создание ...

DOKUMENTENABRUFEINRICHTUNG UND DOKUMENTENABRUFVERFAHREN

Die vorliegende Erfindung soll eine Dokument-Abrufeinrichtung und ein Dokument-Abrufverfahren bereitstellen, die in der Lage sind, einen gewünschten Bereich aus einem Dokument genau abzurufen. Die Dokumenten-Abrufeinrichtung 1 beinhaltet: eine Anfrage-Empfangseinheit 11, die konfiguriert ist, eine Anfrage zu empfangen; eine Suchschlüsselwort-Extraktionseinheit 12, die konfiguriert ist, eine Suchschlüsselwortgruppe aus der Anfrage zu extrahieren; eine erste Sucheinheit 13, die konfiguriert ist, ein in einem Dokumenten-Speicherbereich 22 gespeichertes Dokument 221 unter Verwendung der Suchschlüsselwortgruppe zu durchsuchen und dadurch ein erstes Suchergebnis abzurufen; eine zweite Sucheinheit 14, die konfiguriert ist, falls die Suchschlüsselwortgruppe ein in einem Allgemeinwort-Speicherbereich 21 gespeichertes Allgemeinwort 211 enthält, das Dokument 221 unter Verwendung einer zweiten Suchschlüsselwortgruppe entsprechend der Suchschlüsselwortgruppe mit dem ausgeschlossenen Allgemeinwort 211 ...

Digital data selection method

NATURAL LANGUAGE BASED PROCESSING OF DATA STORED ACROSS HETEROGENEOUS DATA SOURCES

An analysis system connects to a set of data sources and perform natural language questions based on the data sources. The analysis system connects with the data sources and retrieves metadata describing data assets stored in each data source. The analysis system generates an execution plan for the natural language question. The analysis system finds data assets that match the received question based on the metadata. The analysis system ranks the data assets and presents the ranked data assets to users for allowing users to modify the execution plan. The analysis system may use execution plans of previously stored questions for executing new questions. The analysis system supports selective preprocessing of data to increase the data quality.

APPARATUS, SYSTEM, AND METHOD FOR RAPID COHORT ANALYSIS

An apparatus, system, and method for rapid cohort analysis. In one embodiment, the apparatus includes an interface and a processor. The interface may receive an identifier of a first index attribute. The processor may search the database for a first group of records associated with the first index attribute, search the database for a second group of records, each record in the second group of records sharing a common second index attribute with a record in the first group of records, but not associated with the first index attribute, and calculate a statistic in response to information associated with the first group of records and the second group of records.

APPARATUS, SYSTEM, AND METHOD FOR RAPID COHORT ANALYSIS

An apparatus, system, and method for rapid cohort analysis. In one embodiment, the apparatus includes an interface and a processor. The interface may receive an identifier of a first index attribute. The processor may search the database for a first group of records associated with the first index attribute, search the database for a second group of records, each record in the second group of records sharing a common second index attribute with a record in the first group of records, but not associated with the first index attribute, and calculate a statistic in response to information associated with the first group of records and the second group of records.

MEMORY HAVING INFORMATION REFINEMENT DETECTION FUNCTION, INFORMATION DETECTION METHOD USING MEMORY, DEVICE INCLUDING MEMORY, INFORMATION DETECTION METHOD, METHOD FOR USING MEMORY, AND MEMORY ADDRESS COMPARISON CIRCUIT

The disclosed memory is capable of storing information in each of a plurality of memory addresses and reading out said information. The memory having an information refinement detection function is provided with: an input means for input data which is both externally provided first data which is data for comparing stored memory data, and second data which is data for comparing addresses; a means for determining, in double parallel, the acceptability or not of the information data stored both in both of the kinds of input data obtained from the input means, and the addresses of the same, and carrying out further logical calculations in parallel on the results of both of the acceptability determinations; and a means for outputting the address of the memory which passes the logical calculation. The intelligent information search can be widely used in current artificial intelligence etcetera.

DATABASE KEY IDENTIFICATION

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for database key identification. One of the methods includes receiving an identification of a first field in a first data set, the first data set including records. The method includes identifying a set of values, the set including, for each record, a value associated with the field. The method includes generating a filter mask based on the set of values, where application of the filter mask is capable of determining that a given value is not in the set of values. The method includes receiving a second data set including a second field, the second data set including records. The method includes determining a count of a number of records in the second data set having a value associated with the second field that passes the filter mask. The method also includes storing the count in a profile.

DATABASE KEY IDENTIFICATION

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for database key identification. One of the methods includes receiving an identification of a first field in a first data set, the first data set including records. The method includes identifying a set of values, the set including, for each record, a value associated with the field. The method includes generating a filter mask based on the set of values, where application of the filter mask is capable of determining that a given value is not in the set of values. The method includes receiving a second data set including a second field, the second data set including records. The method includes determining a count of a number of records in the second data set having a value associated with the second field that passes the filter mask. The method also includes storing the count in a profile.

SYSTEMS, METHODS, AND APPARATUSES FOR IMPLEMENTING PREDICTIVE QUERY INTERFACE AS A CLOUD SERVICE

Disclosed herein are systems and methods for implementing predictive query interface as a cloud service including means for exposing an interface to client devices operating remotely from a host organization, wherein the interface is accessible by the client devices via a public Internet; executing a predictive database at the host organization as an on-demand cloud based service for one or more subscribers; authenticating one of the client devices by verifying the client device is associated with one of the subscribers and based further on authentication credentials for the respective subscriber; receiving a request from the authenticated subscriber via the interface; executing a predictive query or a latent structure query against indices of the predictive database generated from a dataset of columns and rows on behalf of the authenticated subscriber, the indices representing probabilistic relationships between the rows and the columns of the dataset; and returning a predictive record ...

Query plan optimization for prepared SQL statements

System, methods and articles of manufacture for optimizing a query plan reuse in a database server system accessible by a plurality of client connections. An embodiment comprises providing at least one global cache storage and a private cache storage to a plurality of client connections, and coordinating utilization of the at least one global cache storage and the private cache storage to share light weight stored procedures and query plans for prepared SQL statements across the plurality of client connections via the at least one global cache storage while avoiding a spinlock access for executing the prepared SQL statements.

Prefetching RDF triple data

Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.

Methods and systems for searching directory access groups

Methods and systems for searching directory access groups are disclosed. A set of groups associated with a logon user is determined. The set of groups is partitioned into one or more disjoint subsets, wherein each of the disjoint subsets is represented by a data representation including a root node and one or more intermediate nodes. For each of the disjoint subsets, the disjoint subset is path compressed to flatten a structure of the data representation representing the disjoint subset. The data representation is cached to a database cache.

Makeup scheme recommendation method and device, cloud device, and electronic device

The makeup scheme recommendation method provided by embodiments of the present disclosure includes: acquiring makeup parameters of a user, the makeup parameters including at least one of an environment parameter, a body parameter, and a makeup time parameter; searching for a target makeup scheme matching the makeup parameters from a makeup scheme pool; optimizing the target makeup scheme in accordance with cosmetic information about the user, and generating a recommended makeup scheme, the cosmetic information being used to indicate cosmetics owned by the user; and providing the recommended makeup scheme to the user.

Encaching and sharing transformed libraries

Embodiments disclosed herein are directed at applying transformations to computer code residing in original libraries for protection against cyberattacks. For example, the transformations applied on original libraries cause random reorganization of the computer code resulting in a transformed version of an original library. Although a malicious attacker can utilize a known exploit of the original library and launch a cyberattack, such knowledge is of no use on the transformed version of the original library. In some embodiments, the transformed version of the original library is stored in cache memory and shared by multiple executable programs to facilitate efficient memory utilization. By making updates to information within the memory occupied by the executable program, the connection between the transformed version of the original library and the executable program is established, when the executable program attempts to access the functional blocks of the original library, which can ...

APPROXIMATE MATCHING

A first set of subconditions is obtained. Approximate matching of the first set of subconditions against a plurality of sets of subconditions is performed. A second set of subconditions among the plurality of sets of subconditions is accessed, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of “don't care”. The first set of subconditions is approximately matched against the second set of subconditions. The first set of subconditions is compared against the second set of subconditions. A matching criterion is determined to be met based on a result of the matching. Information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions is output.

Storing feature sets using semi-structured data storage

The subject technology receives, by a database system, raw input data from a source table provided by a machine learning development environment, the source table comprising multiple rows where each row includes multiple columns, the raw input data comprising values in a first format, the values comprising input features corresponding to datasets included in the raw input data for machine learning models, the machine learning development environment comprising an external system from the database system and is accessed by a plurality of different users that are external to the database system. The subject technology generates cell data for a feature store table based at least in part on the values from the source table. The subject technology performs at least one database operation to generate the feature store table including at least table metadata, column metadata, and the generated cell data.

Systems and methods for updating confidence scores of labels based on subsequent electronic activities

The present disclosure relates to methods, systems, and storage media for updating confidence scores of labels based on subsequent electronic activities. Exemplary embodiments may maintain a plurality of node profiles corresponding to a plurality of unique entities; access a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers; identify a first electronic activity to process; assign a tag to the first electronic activity based on the data included in the electronic activity; determine a confidence score of the tag based on the data included in the first electronic activity; identify a second electronic activity to process; and update the confidence score of the tag assigned to the first electronic activity responsive to parsing the second electronic activity.

Systems and methods for maintaining an electronic activity derived member node network

The present disclosure relates to maintaining an electronic activity derived member node network. Exemplary implementations may: generate a plurality of node profiles; generate a node graph generated from the plurality of node profiles; identify a second electronic activity identifying a pair of electronic accounts; identify using the node graph, a pair of participant node profiles corresponding to the pair of electronic accounts identified by the second electronic activity; identify, using the node graph, an edge between a pair of nodes corresponding to the pair of participant node profiles; determine a relevancy score for the second electronic activity corresponding to the pair of the participant node profiles based on context of the second electronic activity; and update the node graph by modifying the connection corresponding to the edge between the pair of participant node profiles based on the relevancy score determined for the second electronic activity.

СПОСОБЫ И СИСТЕМЫ ДЛЯ РЕАЛИЗАЦИИ ПРИБЛИЖЕННОГО СРАВНЕНИЯ СТРОК В БАЗЕ ДАННЫХ

Изобретение относится к способам и системам для приближенного сравнения строк в базе данных с добавляемой записью в базу данных, находящуюся в сети обслуживания банковских карт. Техническим результатом является повышение скорости и эффективности получения приблизительного соответствия символьной строки в базе данных, без необходимости вычислять метрику подобия по всей базе данных. В способе сравнения символьных строк для сравнения символьной строки кандидата с множеством записей символьных строк, сохраненных в базе данных, выделяют символьную строку во множестве записей символьных строк для создания набора ссылочных символьных строк посредством факторного анализа основных компонент (PCFA). Генерируют для каждой символьной строки во множестве записей и для символьной строки кандидата двоичный индексный ключ, содержащий несколько бит двоичной информации. Каждый бит показывает степень подобия символьной строки набору ссылочных символьных строк. Определяют набор записей символьных строк, который ...

Incremental and collocated redistribution for expansion of an online shared nothing database

Efficient use of trie data structure in databases

The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

MAINTAINING DATA ACROSS QUERY EXECUTIONS OF A LONG-RUNNING QUERY

Disclosed herein are system, method, and computer program product embodiments for a query processing system. An embodiment operates by receiving a query associated with a table. An ordered index with entries that include key values that uniquely identifies a corresponding record in the table is determined. A last key value is initialized to store a minimum value for a data type of the key value. The query is executed as a union-all of a plurality of queries. While a count of selected records is less than or equal to a threshold quantity and at least one entry remains in the ordered index, an ordered next entry with a key value subsequent to the last key value in the index is identified, the corresponding record is selected from the table, the last key value is updated, the query is executed, and the count is incremented.

SYSTEMS AND METHODS FOR LINKING ELECTRONIC ACTIVITIES TO NODE PROFILES

The system described herein can automatically match, link, or otherwise associate electronic activities with one or more node profiles. For an electronic activity that is eligible or qualifies to be matched with one or more node profiles, the system can selectively apply rules to match the electronic activity to a subset of the one or more node profiles based on values of fields extracted from the electronic activity and values of the node profiles. The system can then store an association between the electronic activity and the subset of the one or more node profiles.

SYSTEMS AND METHODS OF GENERATING AN ENGAGEMENT PROFILE

The present disclosure relates to systems and methods for determining an engagement profile of a participant by associating electronic activities to a profile. It may generate the engagement profile based on analysis of the electronic activity level. An example implementation may contain the following steps. The system may access for a first record object a plurality of electronic activities linked with the first record object. The system may identify for a participant from the plurality of electronic activities a set of electronic activities including the participant. The system may determine an engagement profile of the participant based on a first number of electronic activities of the set of electronic activities sent by the participant, a second number of the set of electronic activities received by the participant and a temporal distribution of the set of electronic activities. The system may store the engagement profile in one or more data structures.

Method and apparatus for identifying and resolving conflicting data records

A method and apparatus for identifying and resolving conflicting data records are disclosed. The individual data fields of a master record are compared with the corresponding data fields of each source record in a particular data set. For each, one of various matching algorithms is used to assign a field matching score indicating the extent to which the data in the two data fields matches. The particular algorithm used to determine the extent of a match and to assign the corresponding score is dependent on the type of the data field. Once all of the data fields for a particular source record have been analyzed, the sum of the field matching scores is tallied to determine an overall record matching score for that particular source record.

ENHANCEMENTS FOR OPTIMIZING QUERY EXECUTIONS

In an approach for optimizing query executions a processor receives a request to transfer data from a first table to a second table. A processor detects a relationship between the first table and the second table, wherein the relationship is based on a similarity between the first table and the second table. A processor identifies at least a first access path for transferring the data from the first table to the second table. A processor calculates a first cost of transferring the data from the first table to the second table using the first access path based on the similarity between the first table and the second table, wherein the first cost indicates estimated processor usage to transfer the data.

SYSTEM AND METHOD FOR DETECTION PROMOTION

A modified configuration management database (CMDB) system is disclosed in which detected configuration item (CI) vulnerabilities are stored as less-resource-intensive detection objects, rather than as more-resource-intensive vulnerable item (VI) objects. The system includes a vulnerability response (VR) server that enables promotion rules to be created and periodically applied to the stored detections. When the conditions of a detection promotion rule are satisfied by information relating to a stored detection, a new VI may be created and related to the stored detection within the CMDB. The disclosed promotion rules can be configured to ensure that VIs are only automatically created for high-risk or relevant detections, substantially reducing the number of VIs to be created, stored, and managed. As such, the disclosed system substantially reduces resource consumption and improves the efficiency and operation of the CMDB.

Incremental and collocated redistribution for expansion of online shared nothing database

Provided are a system, method and computer program product for redistribution of data in an online shared nothing database, said shared nothing database comprising a plurality of original partitions and at least one new partition. Said method comprising: a collocation-set identifier for identifying two or more collocated tables in the original partitions to be redistributed over the original partitions and at least one new partition, said tables having data rows, each data row residing on a partition governed by a distribution key; a table factory for creating corresponding new tables in the new partition; a view creator for creating a UNION ALL view of all the data from both the original and new tables using the check constraints, said check constraints in turn based on the distribution keys; a counter for defining a loop of intervals over the distribution key range; a data mover for performing data movement of each data row over the current distribution key interval from the original ...

Identifying anonymized resume corpus data pertaining to the same individual

Resume data identification implementations are described that identify anonymized resume corpus data pertaining to the same individual. In one implementation, identifying this data in the anonymized resume corpus involves segmenting the corpus into resume snippets and clustering the resume snippets into groups. Within each group the resume snippets potentially pertain to the same individual. In addition, one or more optional filtering operations can be performed to remove snippets from a group that are less likely to be associated with the same person. This filtering is especially useful when the resume corpus is large.

Systems and methods of generating an engagement profile

The present disclosure relates to systems and methods for determining an engagement profile of a participant by associating electronic activities to a profile. It may generate the engagement profile based on analysis of the electronic activity level. An example implementation may contain the following steps. The system may access for a first record object a plurality of electronic activities linked with the first record object. The system may identify for a participant from the plurality of electronic activities a set of electronic activities including the participant. The system may determine an engagement profile of the participant based on a first number of electronic activities of the set of electronic activities sent by the participant, a second number of the set of electronic activities received by the participant and a temporal distribution of the set of electronic activities. The system may store the engagement profile in one or more data structures.

СПОСОБЫ И СИСТЕМЫ ДЛЯ РЕАЛИЗАЦИИ ПРИБЛИЖЕННОГО СРАВНЕНИЯ СТРОК В БАЗЕ ДАННЫХ

Изобретение относится к прогнозируемым торговым системам, более конкретно к способам и системам для приближенного сравнения строк в базе данных с добавляемой записью в базу данных, находящуюся в сети обслуживания банковских карт. Техническим результатом является повышение эффективности получения приблизительного соответствия символьной строки в базе данных без необходимости вычислять метрику подобия по всей базе данных. В способе сравнения символьных строк, символьной строки кандидата с множеством записей символьных строк, сохраненных в базе данных, идентифицируют набор ссылочных символьных строк в базе данных. Ссылочные символьные строки идентифицируются с использованием оптимизированного поиска набора разнородных символьных строк. Затем генерируют представление n-граммы каждой из ссылочных символьных строк в наборе ссылочных символьных строк и генерируют представления n-граммы символьной строки кандидата. После чего определяют подобие между представлениями n-грамм каждой из ссылочных ...

Способ мониторинга поведения пользователя при взаимодействии с контентом и система для его осуществления

Изобретение относится к средствам мониторинга поведения пользователя при взаимодействии с контентом. Технический результат заключается в расширении арсенала средств мониторинга поведения пользователя при взаимодействии с контентом на пользовательском устройстве. Система содержит сервер, снабженный базой данных и центральным блоком хранения условий наступления событий поведения пользователя, и по меньшей мере одно пользовательское устройство, снабженное блоком сбора данных, блоком распознавания событий, локальным блоком хранения условий наступления событий поведения пользователя. Блок сбора данных предназначен для проведения сбора первичных данных. Блок распознавания событий предназначен для извлечения признаков событий поведения пользователя, формирования вектора значений таких признаков, сопоставления вектора с предварительно заданными условиями наступления событий, передачи данных о наступлении события на сервер. 2 н. и 14 з.п. ф-лы, 3 ил.

Array-Verfahren

The invention relates to a method which can be carried out on a digital computer in order to optimize the access speed of digital data which is filed in a storage medium. The data is filed in a structured manner in a data field. Initially, search vectors are linked logically to each other. Subsequently, they are linked to the data field.

METHODS AND SYSTEMS FOR IMPLEMENTING APPROXIMATE STRING MATCHING WITHIN A DATABASE

A computer-based method for character string matching of a candidate character string with a plurality of character string records stored in a database is described. The method includes a) identifying a set of reference character strings in the database, the reference character strings identified utilizing an optimization search for a set of dissimilar character strings, b) generating an n-gram representation for one of the reference character strings in the set of reference character strings, c) generating an n-gram representation for the candidate character string, d) determining a similarity between the n-gram representations, e) repeating steps b) and d) for the remaining reference character strings in the set of identified reference character strings, and f) indexing the candidate character string within the database based on the determined similarities between the n-gram representation of the candidate character string and the reference character strings in the identified set.

SYSTEM AND METHOD FOR INDEXING INFORMATION ABOUT ENTITIES FROM DIFFERENT INFORMATION SOURCES

A system and method for indexing (34-38) a data record (78) from an information source into a database (58), the database (58) containing a plurality of data records, is provided comprising receiving a data record (152) from an information source (50), the received data record (152) having a predetermined number of fields containing information about a particular entity (56), standardizing (174) and validating (172) the data in the received data record (76). A system and method is also provided for retrieving records that refer to an entity (302) characterized by a specific set of data values (88) by comparing a predetermined number of fields within the data records already in the database, selecting data records already in the database as candidates (306) having data within some of the predetermined fields that is identical to the data in the fields of the received data record, and scoring (308) the candidates (306) to determine data records having information about the same entity (52 ...

Systems and methods for matching electronic activities to record objects using feedback based match policies

Systems and methods for matching electronic activities to record objects using feedback based match policies can include accessing a plurality of electronic activities and record objects. The systems and method can include identifying candidate record objects by applying a matching model. The systems and methods can include selecting a record object based on a match score. The systems and methods can include configuring the matching model in a first configuration responsive to a first feedback type or configuring the matching model in a second configuration responsive to a second feedback type.

Combining bitmaps within a memory limit

A method for combining within memory a limit, a plurality of bitmap streams from bitmaps of indefinite size and number. The bitmap streams are merged into a resulting bitmap which can be used in subsequent logical operations. In order to perform a merge within a memory limit, the method relies on the data compression. When compression by itself may be ineffective, the method produces a resulting bitmap for a reduced range. The ensures the production of a resulting bitmap. When the range is reduced, the method may be repeated to produce a merge for a range beyond the reduced range.

Systems and methods for updating labels assigned to electronic activities

The present disclosure relates to a method for updating labels assigned to electronic activities. The method includes accessing electronic activities transmitted or received via electronic accounts associated with data source providers. The node profiles can be updated using the electronic activities. The method includes matching one of the electronic activities to participant node profiles, each corresponds to one of the electronic accounts via which the electronic activity is transmitted or received. The method includes assigning tags to the electronic activity based on the participant node profiles. The method includes detecting a change to the participant node profiles. The method includes determining whether to update the tags assigned to the electronic activity based on the detected change to the participant node profile. The method includes modifying the tag assigned to the electronic activity responsive to determining to update the tag in accordance with the detected change.

METHODS AND SYSTEMS FOR SEARCHING DIRECTORY ACCESS GROUPS

Methods and systems for searching directory access groups are disclosed. A set of groups associated with a logon user is determined. The set of groups is partitioned into one or more disjoint subsets, wherein each of the disjoint subsets is represented by a data representation including a root node and one or more intermediate nodes. For each of the disjoint subsets, the disjoint subset is path compressed to flatten a structure of the data representation representing the disjoint subset. The data representation is cached to a database cache.

Node similarity for component substitution

Systems and methods of determining node similarity for component substitution. An example of a method may be carried out by program code stored on non-transient computer-readable medium and executed by a processor. The method includes estimating a normalized similarity metric between the plurality of nodes in the system tree and nodes in other trees. The method also includes assigning a similarity score to each compared node using at least one of: domain based rules, attribute based similarity metrics, and machine learning. The method also includes combining results for cluster analysis.

METHODS AND SYSTEM FOR CONSTRAINED REPLAY DEBUGGING WITH MESSAGE COMMUNICATIONS

A graphical user interface configured to facilitate replay debugging in distributed software programs is provided. In one or more examples, the graphical user interface provides a visual progress bar, wherein a position on the visual progress bar corresponds to a log file generated when the distributed software program is executed. The user can manipulate the graphical user to replay the log files and visualize the state of the playback through the visual progress bar. The graphical user interface can also allow the user to provide watch points and can allow the user to visualize variables that are contained within the log files. The watch points can represent one or more conditions. The log files can be analyzed to determine if they meet the condition specified in the watch point, and if the log files meet the condition, a visual indication can be provided on the visual progress bar.

SYSTEMS AND METHODS FOR MERGING TENANT SHADOW SYSTEMS OF RECORD INTO A MASTER SYSTEM OF RECORD

The present disclosure is related to systems and methods of merging tenant shadow systems of record into a master system of record. First tenant record objects of a first tenant system of record can be accessed. A master record object for a master system of record can be generated using the corresponding first tenant record object. A second tenant record object of a second tenant system of record can be accessed. Whether the second tenant record object is to be merged into the corresponding master record object can be determined. When determined to merge, the second tenant record object can be merged into the corresponding master record object. When determined to not merge, a new master record can be generated.

Systems and methods for determining the shareability of values of node profiles

The present disclosure relates to determining the shareability of values of node profiles. Record objects and electronic activities of a system of record corresponding to a data source provider may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Values of fields corresponding to a predetermined type of field including fewer than a predetermined threshold number of data source providers may be identified. A restriction tag used to restrict populating other node profiles may be generated. Provision of the value with a second data source provider may be restricted.

Efficient storage and searching of vector datasets

In one embodiment, an apparatus comprises a storage device and a processor. The storage device stores a feature vector index, wherein the feature vector index comprises a sparse-array data structure representing a feature space for a set of labeled feature vectors, wherein the set of labeled feature vectors are assigned to a plurality of classes. The processor is to: receive a query corresponding to a target feature vector; access, via the storage device, a first portion of the feature vector index, wherein the first portion of the feature vector index comprises a subset of labeled feature vectors that correspond to a same portion of the feature space as the target feature vector; determine the corresponding class of the target feature vector based on the subset of labeled feature vectors; and provide a response to the query based on the corresponding class.

Verfahren und System zur Identifikation eines Produkts

Die Erfindung betrifft ein Verfahren zur zumindest teilautomatisierten Identifikation, insbesondere zur Entwertung, Einmaligkeitsprüfung und/oder Echtheitsprüfung, eines Produkts (10), wobei in zumindest einem Erfassungsschritt (12) zumindest eine Repräsentation des Produkts (10) aufgenommen wird, welche in zumindest einem Prüfschrift (14) mit zumindest einer Referenzrepräsentation des Produkts (10) in einem Originalzustand verglichen wird, wobei ein Vorhandensein zumindest eines gegenüber dem Originalzustand hinzugefügten Merkmals (16) des Produkts (10) überprüft wird.

Verfahren zum Zugriff auf eine Speichereinheit, in der Vermerkfolgen gespeichert sind, zugehörige Speichereinheit und zugehöriges Programm

Erläutert wird ein Verfahren, bei dem in einem Schreibmodus in einer Speichereinheit (16) zu einem Datenwert eines Datums eine Bitfolge (25) aus einer Vielzahl aufeinanderfolgender Bits gespeichert wird. Die Bitpositionen sind jeweils einem Datensatz (30 bis 34) zugeordnet, der ein Datenfeld zur Speicherung des Datums enthält. Durch diese Maßnahme lassen sich Verknüpfungsoperationen sehr schnell ausführen.

Orchestration system for stream storage and processing

SYSTEMS AND METHODS FOR DETERMINING DOMAIN NAMES OF A GROUP ENTITY USING ELECTRONIC ACTIVITIES AND SYSTEMS OF RECORD

The present disclosure relates to determining domain names of a group entity using electronic activities and systems of record. A method can include maintaining a plurality of node profiles including one or more node field-value pairs. Each node profile of the plurality of node profiles can identify a group entity. The method can include identifying a first domain name corresponding to the group entity. The method can include accessing a plurality of data points corresponding to a subset of the plurality of node profiles. The method can include updating each respective node profile of the subset to include a respective second electronic account identifier corresponding to the node profile. The method can include storing, in at least one first data structure, an association between the group entity, the first domain name, and a second domain name corresponding to the second electronic account identifiers.

SYSTEMS AND METHODS FOR ELECTRONIC ACTIVITY CLASSIFICATION

The present disclosure relates to electronic activity classification. A plurality of node profiles corresponding to a plurality of unique entities is maintained. A plurality of electronic activities is accessed from electronic accounts of one or more data source providers. Features are extracted from the electronic activities to determine a classification of the first electronic activity. A confidence score is determined indicating a likelihood that the first electronic activity of a classification type. An association is stored between the first electronic activity and a tag corresponding to the first classification type. The confidence score is updated based on a second electronic activity.

PREFETCHING RDF TRIPLE DATA

Query requests for RDF triples are obtained, wherein the query request(s) contain(s) at least one triple pattern; for each triple pattern, the corresponding elementary pattern is determined, and each triple pattern is converted to a weighted elementary pattern. The occurrence frequency of each elementary pattern is computed based on the weighted elementary patterns; at least one elementary pattern is chosen at least according to the occurrence frequency; and the RDF triples corresponding to the chosen at least elementary pattern are prefetched into the buffer. The corresponding apparatus is also provided. With the above method and apparatus, the frequently accessed RDF triples can be determined and prefetched into the buffer, which improves the query efficiency.

Using cross-matching between users and matching against reference data to facilitate content identification

Techniques for identifying video and/or audio content are presented. An identification management component (IMC) groups users determined to be at least potentially be watching the same content based on first content fingerprints associated with respective content viewed by the users on communication devices, and a defined matching criterion. IMC facilitates identifying the content associated with the group of users based on first content fingerprints associated with the group of users and first reference content fingerprints. IMC receives a second content fingerprint associated with a communication device of a user in the group, sends the second content fingerprint to a third-party identification component for comparison with second reference content fingerprints, and receives content identification information in response. IMC identifies the content for the group of users based on the content identification information and/or the content identification made based on the first content ...

Message Classification Using Allowed Items

A system and method are disclosed for classifying a message. The method includes receiving the message, identifying all items of a certain type in the message, determining whether each of the items meets a criterion, and in the event that all the items are determined to meet the criterion, determining a classification of the message. The system includes an interface configured to receive the message, a processor coupled to the interface, configured to identify all items of a certain type in the message; determine whether each of the items meets a criterion; and in the event that all the items are determined to meet the criterion, determine a classification of the message.

Dynamic assignment of qualification block to person

A method for matching an object with a set of qualifications to an object with a set of requirements includes examining the object with the set of qualifications to produce a list of qualifications without a hierarchy, removing duplicate qualifications, and matching list of qualifications without a hierarchy with removed duplicates to the set of qualifications.

Systems and methods for generating a performance profile of a node profile including field-value pairs using electronic activities

This disclosure relates to methods, systems, and storage media for generating a performance profile of a node profile. First electronic activities linked to a first node profile can be accessed. For each first electronic activity, a type of the first electronic activity can be determined. A feature extraction policy can be selected to generate a first feature array for the first electronic activity. The first feature array for the first electronic activity can be generated based on the type of the first electronic activity. A first performance profile of the first node profile can be generated for the time period by providing the generated first feature array for each first electronic activity to one or more models trained using second feature arrays corresponding to second electronic activities of second node profiles. An association between the first node profile and the first performance profile can be stored.

Packet identifying method and packet identifying device

A packet identifying method includes: connecting to an IP telephone device under test and querying to a current device information of the IP telephone device under test; determining if there is any instruction set in a database matched with the current device information, wherein the database includes a plurality of instruction sets, and each instruction set corresponds to existing device information of an IP telephone device; and executing a packet identifying procedure by using an executing instruction set.

SYSTEM AND METHOD FOR ASSOCIATING RELATED RECORDS TO COMMON ENTITIES ACROSS MULTIPLE LISTS

Computer implemented systems and methods are disclosed for associating records across lists, wherein the lists include a plurality of records and the plurality of records is associated with a respective entity. In accordance with some embodiments, the systems and methods further comprise grouping one or more records from a first list into a first group based on fields of the records in the first list, grouping one or more records from a second list into a second group based on fields of the records in the second list, pairing a record from the first group with a record from the second group, assessing each pair of records based on an evaluation of the respective pair according to fields of the pair, and associating records from the first group and records of the second group with an entity based on the assessment.

AUTOMATED DATA MASKING WITH FALSE POSITIVE DETECTION AND AVOIDANCE

In some implementations, a system may receive a set of data intended for storage. The system may detect, within the set of data and using pattern matching, a set of potential sensitive data fields. The system may detect, using characters not included in the potential sensitive data fields, at least one non-sensitive data field included in the set of potential sensitive data fields. The system may mask first data included in the set of potential sensitive data fields other than the at least one non-sensitive data field and may refrain from masking second data included in the at least one non-sensitive data field. The system may generate a modified set of data based on masking the first data and refraining from masking the second data and output the modified set of data for storage.

СПОСОБЫ И СИСТЕМЫ ДЛЯ РЕАЛИЗАЦИИ ПРИБЛИЖЕННОГО СРАВНЕНИЯ СТРОК В БАЗЕ ДАННЫХ

... 1. Компьютерный способ сравнения символьных строк, символьной строки кандидата с множеством записей символьных строк, сохраненных в базе данных, упомянутый способ включает: ! a) идентификацию набора ссылочных символьных строк в базе данных, ссылочные символьные строки идентифицируются с использованием оптимизированного поиска набора разнородных символьных строк; ! b) генерирование представления n-граммы одной из ссылочных символьных строк в наборе ссылочных символьных строк; ! c) генерирование представления n-граммы символьной строки кандидата; ! d) определение подобия между представлениями n-грамм; ! e) повторение шагов b) и d) для оставшихся ссылочных символьных строк в наборе идентифицированных ссылочных символьных строк; и ! f) индексацию символьной строки кандидата в базе данных, основанную на определении релевантности между представлением n-граммы символьной строки кандидата и ссылочными символьными строками в идентифицированном наборе. ! 2. Компьютерный способ по п.1, отличающийся ...

Method and system for distributed bulk matching and loading

A method for matching bulk data, involving receiving a plurality of input records, performing block distribution on the plurality of input records to obtain a plurality of block records, wherein performing block distribution comprises distributing the plurality of input records to a first plurality of containers, performing concurrent matching operations on the plurality of block records to obtain a plurality of single best records, and loading the plurality of single best records into a master index database.

EFFICIENT USE OF TRIE DATA STRUCTURE IN DATABASES

The invention provides a time-efficient way of performing a query in a database or information retrieval system comprising operations such as intersection, union, difference and exclusive disjunction on two or more sets of keys stored in a database or information retrieval system. In a novel execution model, all data sources are tries. Two or more input tries are combined in accordance with the respective set operation, to obtain the set of keys associated with the nodes of a respective resulting trie. An intersection operation performed in this way can be used for efficient range queries, in particular when two or more data items are involved in the query. The physical algebra of the implementation of tries based on bitmaps corresponds directly to the logical algebra for the set operations and allows for efficient implementation by means of bitwise Boolean operations.

ANOMALY LOCALIZATION DENOISING AUTOENCODER FOR MACHINE CONDITION MONITORING

Systems, techniques, and computer-program products that, individually and in combination, permit machine condition monitoring are provided. In some aspects, state estimation and anomaly localization can be determined jointly. To that end, in some embodiments, systems can be configured using at least a synthetic training dataset. The synthetic training dataset includes sensor output data that incorporates synthetic a random amount of noise to each one of multiple sensor devices that probe an industrial machine. The training dataset also includes synthetic information indicative of location of anomalous sensor device(s) of the multiple sensor devices. Therefore, the systems can learn to determine state estimation and anomalous localization concurrently, in a single operation. Accordingly, the training of the systems is consistent with the operation of the systems during machine condition monitoring. Embodiments of the disclosure provide superior predictive performance over conventional machine condition monitoring approaches. 1. A computer-implemented method , comprising:receiving, by a computing system including at least one processor, a first dataset representative of normal output data from sensor devices coupled to an industrial machine;generating, by the computing system, a binary dataset representative of anomaly states of the industrial machine;generating, by the computing system, using at least the first dataset and the binary dataset, a second dataset representative of synthetic output data corresponding to the sensor devices;determining, by the computing system, a model using at least the first dataset, the second dataset, and the binary dataset, the model estimates jointly an operational state of the industrial machine and anomaly localization within the industrial equipment.2. The computer-implemented method of claim I , wherein the receiving comprises receiving multiple vectors corresponding to a defined mode of operation of the industrial machine , each ...

Matchset-based automatic root cause analysis including determining a first fault scenario is to be subsumed by a second fault scenario

A set of observed symptoms of a physical system is received. The set of observed symptoms is matched with a database of fault scenarios to generate a plurality of matched fault scenarios, wherein the database of fault scenarios comprises combinations of symptoms and corresponding root cause identifiers. The plurality of matched fault scenarios are refined. It is determined whether a first fault scenario of the plurality of matched fault scenarios is to be subsumed by a second fault scenario. In response to a determination that the first fault scenario of the plurality of matched fault scenarios is to be subsumed by a second fault scenario, the second fault scenario is included in the plurality of matched fault scenarios, the first fault scenario is deprioritized, or both. The plurality of matched fault scenarios as potential root causes is output.

Systems and methods for matching electronic activities with record objects based on entity relationships

The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.

Processing matrix vector multiplication

Multiplication of a matrix 201 of size M × N with a vector 200 of size N, the matrix being a sparse matrix including a plurality of zero values, comprising: storing the matrix in a compressed format, such that zero values are not stored; storing the vector as a plurality of vector parts, each part being of a size Ki, 1 Подробнее

Annotating enviromental data represented by characteristic functions

Performing batches of selective assignments in a vector friendly manner

Embodiments of the invention relate to processing queries. A query operation to be performed on a table of data is translated into a series of bit level logical operations using expansion and/or saturation operations. A mask is created from the series of bit level logical operations. This mask is then simultaneously applied to multiple rows from the table of data.

CREATING INDEX IN BLOCKCHAIN-TYPE LEDGER

A method and an apparatus for creating an index in a blockchain-type ledger, and a device are disclosed. According to one implementation, a method may include obtaining, by a centralized database server, a data record, wherein the data record is stored in a blockchain-type ledger, and wherein the data record comprises a service attribute and a sequence number; determining location information of the data record in the blockchain-type ledger, wherein the location information comprises a block height of a data block comprising the data record, and an offset of the data record in the data block; establishing a mapping relationship between the service attribute, the location information, and the sequence number; and based on the sequence number, writing the mapping relationship to an index. 1. A computer-implemented method comprising:obtaining, by a centralized database server, a data record, wherein the data record is stored in a blockchain-type ledger, and wherein the data record comprises a service attribute and a sequence number;determining location information of the data record in the blockchain-type ledger, wherein the location information comprises a block height of a data block comprising the data record, and an offset of the data record in the data block;establishing a mapping relationship between the service attribute, the location information, and the sequence number; andbased on the sequence number, writing the mapping relationship to an index.3. The computer-implemented method of claim 1 , wherein writing the mapping relationship to the index comprises:creating an index record using the service attribute as a primary key in an index table when the primary key in the index does not comprise the service attribute; orwriting the location information and the sequence number to an index record comprising the service attribute when the primary key in the index comprises the service attribute.4. The computer-implemented method of claim 1 , further comprising: ...

Method for accessing a memory unit in which sequences of notes are stored, corresponding memory unit and corresponding program

A method employs a bit sequence having a plurality of successive bits is stored in a write mode in a memory unit for a data value of a datum. The bit positions are each allocated to a data set which contains a data field for storing the datum. This measure enables logic operations to be carried out very rapidly.

METHODS AND SYSTEMS FOR GENERATING LOGICAL QUERIES

A computer-implemented method for generating and sending a machine processable form of a logical query, comprising: providing, on a display device of a computing device, two or more shapes that can be manipulated by a user to form a diagram representing a logical query, wherein the two or more shapes correspond to respective data sets; for each shape of the two or more shapes, determining, by the computing device, one or more highest intersection cardinality regions within the shape; based on the one or more highest intersection cardinality regions, generating, by the computing device, a machine processable form of the logical query; and sending, by the computing device, the machine processable form of the logical query to a query processing engine.

COMPARING DATASETS USING HASH VALUES OVER A SUBSET OF FIELDS

Methods and apparatus are disclosed for comparing relevant content of datasets. A hash value is computed over a selected subset of fields to obtain a signature of a dataset, with other fields being disregarded. A hash value can be computed directly for all records of the dataset, or by combining individual hash values for each record. Comparison of the signature with that of other datasets leads to efficient determination whether two datasets match with respect to relevant content in the selected fields. For larger groups of datasets, lists of matched and mismatched datasets can be reported. Optional features include matches insensitive to permutation of the records, or identification of which records in a dataset fail to match.

Space efficient vector for columnar data storage

Disclosed herein are system, method, and computer program product embodiments for providing paged and compressed storage for column data, while maintaining existing access mechanisms for the data. In order to reduce an in-memory footprint for column data, columns may be stored in pageable format using page chains, and only those pages of the column data needed to resolve a query will be placed in memory, and evicted from memory when no longer needed. In order to further reduce the footprint for these columns, compression can be applied, and the compressed column data stored in the same pageable format using page chains. The compressed data includes a plurality of vectors, each of which is converted into pages and stored on the page chain with the others so that they can be efficiently retrieved during database retrieval operations.

METHOD FOR RECOMMENDING DOCUMENT, ELECTRONIC DEVICE AND STORAGE MEDIUM

The present disclosure provides a method of recommending a document, an electronic device, and a storage medium, relating to fields of intelligent recommendation, deep learning etc. The method of recommending a document includes: acquiring a document operated by a user, as a reference document; determining, from a plurality of initial documents, at least one candidate document for the reference document, wherein a document content of each candidate document is associated with a document content of the reference document, based on preset knowledge system data; and recommending a target document in the at least one candidate document to the user, the target document including a document that the user is currently interested in and a document that the user is interested in after a preset time period.

Personalized book-to-movie adaptation recommendation

A method, computer system, and a computer program product for automatically recommending a plurality of text snippets from a book script for a movie adaptation is provided. The present invention may include receiving, by a user, a piece of input data, wherein the input data includes the book script, and a plurality of past book-to-movie adaptations. The present invention may then include identifying a plurality of text snippets associated with the received book script. The present invention may also include recommending the plurality of text snippets associated with the received book script to include in a movie based on the plurality of past book-to-movie adaptations and a plurality of movie reviews corresponding with the plurality of past book-to-movie adaptations.

Data objects associated with private set intersection (PSI)

Examples disclosed herein relate to data objects associated with private set intersection (PSI). Some examples disclosed herein may enable identifying a set of server elements and a set of data objects. Each data object of the set of data objects may be associated with at least one server element of the set of server elements. Some examples further enable sending the set of server elements and the set of data objects to a client computing device that has a set of client elements. A private set intersection (PSI) between the set of server elements and the set of client elements may be inaccessible by the client computing device, and a subset of the set of data objects that are associated with the PSI may be accessible by the client computing device.

Systems and methods for providing data-driven evolution of arbitrary data structures

A system and process for generalizing an evolutionary process applied to a particular domain involving different problems includes a researcher module for generating a configuration specification applicable to a particular problem. An evolution module parses the configuration specification into a representative tree structure, assembles policies for each node in the tree structure, and generates candidate genomes using the policies for each node in the tree structure. The policies may be applied to new data or data from prior runs to generate candidate genomes. The evolution module translates internal representations of the generated candidate genomes into known representations of the candidate genome for evaluation in accordance with the particular domain parameters by a candidate evaluation module.

SYSTEMS AND METHODS FOR MEASURING GOALS BASED ON MATCHING ELECTRONIC ACTIVITIES TO RECORD OBJECTS

A method may include accessing electronic activities and record objects. The method includes identifying, for a first entity, an event generated based on data included in the first set of record objects. The event is configured to change from a first status to a second status based on an event policy specifying i) a qualifying entity type or ii) a number of electronic activities that satisfy one or more conditions. The method includes identifying a set of electronic activities to be linked to a record object of the first set of record objects. The method includes determining, using the set of electronic activities, by applying the event policy, that the event is to be changed from the first status to the second status. The method includes updating the status of the event from the first status to the second status responsive to applying the event policy.

Bloom Filter Generation Method and Apparatus

A Bloom filter generation method and apparatus is presented, where the method includes acquiring to-be-combined files, when a quantity of deletion records in the to-be-combined files falls within a false positive permission range, acquiring a Bloom filter of each to-be-combined file, where capacities of Bloom filters of different to-be-combined files are the same, and performing a bitwise OR operation on bit values at same locations in Bloom filters of the different to-be-combined files, in order to obtain a target Bloom filter and use the target Bloom filter as a Bloom filter of a combined file obtained by combining the different to-be-combined files, and hence an amount of calculation processing in Bloom filter generation is reduced, a system resource is reduced, and resource overheads are reduced.

Methods and devices for quantifying text similarity

Disclosed herein are computer-implemented methods; computer-implemented systems; and non-transitory, computer-readable media, for quantifying text similarity. One computer-implemented method includes obtaining a plurality of shortest operation paths including one or more edit pairs for correcting an optical correction recognition (OCR) text string with an edit text string, where each of the one or more edit pairs denotes an operation performable to a character of the OCR text string during correction by the edit text string. A plurality of similarity scores is determined, each corresponding to one of the plurality of shortest operation paths and determined by summing historical similarity scores of the one or more edit pairs of each of the plurality of shortest operation paths. A minimum one of the plurality of similarity scores is selected to quantify text similarity between the OCR text string and the edit text string.

APPARATUS, SYSTEM AND METHOD FOR RAPID COHORT ANALYSIS

An apparatus, system, and method for rapid cohort analysis. In one embodiment, the apparatus includes an interface and a processor. The interface may receive an identifier of a first index attribute. The processor may search the database for a first group of records associated with the first index attribute, search the database for a second group of records, each record in the second group of records sharing a common second index attribute with a record in the first group of records, but not associated with the first index attribute, and calculate a statistic in response to information associated with the first group of records and the second group of records.

DOCUMENT RETRIEVAL APPARATUS AND DOCUMENT RETRIEVAL METHOD

The present invention is intended to provide a document retrieval apparatus and a document retrieval method that are capable of accurately retrieving a desired portion from a document. The document retrieval apparatus 1 includes: a query receiving unit 11 configured to receive a query; a search keyword extraction unit 12 configured to extract a search keyword group from the query; a first search unit 13 configured to search a document 221 stored in a document storage area 22 using the search keyword group, and thereby to retrieve a first search result; a second. search unit 14 configured to, if the search keyword group includes a general word 211 stored in a general word storage area 21, search the document 221 using a second search keyword group corresponding to the search keyword group with the general word 211 excluded, and thereby to retrieve a second search result; and a search result presentation unit 16 configured to output the first search result and. the second search result if ...

FAST IDENTIFICATION OF COMPLEX STRINGS IN A DATA STREAM

A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

Database key identification

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for database key identification. One of the methods includes receiving an identification of a first field in a first data set, the first data set including records. The method includes identifying a set of values, the set including, for each record, a value associated with the field. The method includes generating a filter mask based on the set of values, where application of the filter mask is capable of determining that a given value is not in the set of values. The method includes receiving a second data set including a second field, the second data set including records. The method includes determining a count of a number of records in the second data set having a value associated with the second field that passes the filter mask. The method also includes storing the count in a profile.

Optimizing response creation and delivery for lending queries

A search request may define a minimum value and a maximum value for a numerical parameter of the search. A plurality of binary searches may identify a minimum entry and a maximum entry, each binary search comprising selecting a single entry and using at least one analytical model to generate a score for the single entry, wherein the score of the minimum entry corresponds with the minimum value and the score of the maximum entry corresponds with the maximum value. The at least one analytical model may be used to generate a score for each of a set of entries between the minimum entry and the maximum entry while ignoring entries outside of the set of entries between the minimum entry and the maximum entry. Entries responsive to the request may be identified within the scored set of entries.

Systems and methods for restricting generation and delivery of insights to second data source providers

The present disclosure relates to restricting generation and delivery of insights to data source providers. Electronic activities and record objects may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Updates to a node graph or corresponding to a record object may be detected. A number of data source providers having respective electronic activities or record objects from which the update to the node graph or corresponding to the record object can be determined. Provisioning of a content item to a second data source provider may be restricted.

Systems and methods for determining dataset intersection

Message classification using legitimate contact points

A system and method are disclosed for classifying a message. The method includes receiving the message, identifying all items of a certain type in the message, determining whether each of the items meets a criterion, and in the event that all the items are determined to meet the criterion, determining a classification of the message. The system includes an interface configured to receive the message, a processor coupled to the interface, configured to identify all items of a certain type in the message; determine whether each of the items meets a criterion; and in the event that all the items are determined to meet the criterion, determine a classification of the message.

Memory Having information Refinement Detection Function, Information Detection Method Using Memory, Device Including Memory, Information Detection Method, Method For Using Memory, And Memory Address Comparison Circuit

There is provided an externally readable memory for storing information in each memory address, and this memory is provided with an information refinement detection function; this memory comprises: an input means for entering first input data for comparing data items stored in the memory and second input data for comparing addresses in the memory, wherein the first and second comparison data are externally; means for determining matches/mismatches of both data items stored in the memory and addresses of the memory according to both of the input data provided by the input means, and further performing logic operations on both of the match/mismatch determination results; and means for outputting addresses with positive results of the logic operations. This memory may be applicable in a broad range of fields including intelligent information search as well as artificial intelligence.

Method and system for automatic content recognition network operations

A network fingerprint manager within an automatic content recognition (ACR) system may be operable to receive one or more versions of media content associated with a network. One or more proxy content may be generated by the network fingerprint manager for each version of the received media content. The network fingerprint manager may generate a set of fingerprints from a particular one of the generated one or more proxy content for each version of the received media content. The particular one being fingerprinted may comprise proxy content with highest quality among the generated proxy content. The set of fingerprints and corresponding content ID and media time for each version of the received media content may be stored. The network fingerprint manager may generate real-time fingerprints from content in a received network feed. The network fingerprint manager may compare the generated real-time fingerprints to the stored sets of fingerprints for matching.

Method and system for coupons based on automatic content recognition

An automatic content recognition (ACR)-enabled connected TV device may be operable to present an overlay offering a coupon utilizing an ACR system, where the overlay may also be presented on a paired device. The ACR-enabled connected TV device may present information associated with a value of the coupon based on interaction with the presented overlay by the viewer. The value of the coupon may be determined based on a profile associated with the ACR-enabled connected TV device. The profile may be determined and maintained utilizing the ACR system. The viewer may obtain the coupon associated with the value information from a microsite assigned to the viewer. The viewer may share information on a link of the microsite with one or more other viewers. The value of the coupon may change when one or more of the other viewers click on the link of the microsite to obtain the coupon.

Apparatus and Method for Parallel Regular Expression Matching

A regular expression matching hardware implementation comprises two tightly coupled hardware engines. A regex engine performs state transitions and accepts (as matching) or rejects (as not matching) an input string. The regex engine takes also care of the logic of the operators and deals with the complexity of the state machine. A lookup engine reads characters from an input (e.g., tape, memory, network packets, or the like), and provides them to the regex engine. A preprocessing procedure transforms a regular expression into a regex state transition table and a lookup table, for use by the regex engine and lookup engine, respectively. The two hardware engines are synchronized by a global state machine. The regex engine advances the state machine, and the lookup engine reads it.

Memory sharing across distributed nodes

A method and apparatus are disclosed for enabling nodes in a distributed system to share one or more memory portions. A home node makes a portion of its main memory available for sharing, and one or more sharer nodes mirrors that shared portion of the home node's main memory in its own main memory. To maintain memory coherency, a memory coherence protocol is implemented. Under this protocol, load and store instructions that target the mirrored memory portion of a sharer node are trapped, and store instructions that target the shared memory portion of a home node are trapped. With this protocol, valid data is obtained from the home node and updates are propagated to the home node. Thus, no “dirty” data is transferred between sharer nodes. As a result, the failure of one node will not cause the failure of another node or the failure of the entire system.

SYSTEMS AND METHODS FOR FILTERING ELECTRONIC ACTIVITIES BY PARSING CURRENT AND HISTORICAL ELECTRONIC ACTIVITIES

The present disclosure relates to systems and methods for filtering electronic activities. The method includes identifying an electronic activity. The method includes parsing the electronic activity to identify one or more electronic accounts in the electronic activity. The method includes determining, responsive to parsing the electronic activity, that the electronic activity is associated with an electronic account of the one or more electronic accounts. The method includes selecting, based on the electronic account, one or more filtering policies associated with the data source provider to apply to the electronic activity. The method includes determining, by applying the selected one or more filtering policies to the electronic activity, to restrict the electronic activity from further processing based on the electronic activity satisfying at least one of the selected one or more filtering policies. The method includes restricting, the electronic activity from further processing. 1. A method comprising:identifying, by one or more processors, an electronic activity associated with a data source provider;parsing, by the one or more processors, the electronic activity to identify one or more electronic accounts in the electronic activity;determining, by the one or more processors, responsive to parsing the electronic activity, that the electronic activity is associated with an electronic account of the one or more electronic accounts, the electronic account corresponding to the data source provider;selecting, by the one or more processors based on the electronic account, one or more filtering policies associated with the data source provider to apply to the electronic activity, the selected one or more filtering policies including at least one of i) a keyword policy configured to restrict electronic activities including a predetermined keyword; ii) a regex pattern policy configured to restrict electronic activities including one or more character strings that match ...

JUDGMENT METHOD FOR HARDWARE COMPATIBILITY

A judgment method for hardware compatibility is disclosed. The judgment method is operated with a first electrical device and a second electrical device having a plurality of transmission interfaces. The judgment method is started after the first electrical device electrically connected to one of the transmission interfaces of the second electrical device. The judgment method includes an interface information capturing process, a compatibility comparison process, a compatibility determination process and a recommendation execution process. In the interface information capturing process, the interface information of the transmission interface of the second electrical device connected to the first electrical device is captured. In the compatibility comparison process, the interface information is compared with a compatibility database to obtain a comparison result. In the compatibility determination process, the comparison result is compared with the interface information of another transmission interface of the second electrical device to obtain a determination result. In the recommendation execution process, a recommendation information is provided according to the determination result. 1. A judgment method for hardware compatibility is operated with a first electronic device and a second electronic device having a plurality of transmission interfaces , the judgment method is started after the first electronic device electrically connected to one of the transmission interfaces of the second electronic device , comprising:an interface information capturing process, which is capturing an interface information of the transmission interface of the second electronic device connected to the first electronic device;a compatibility comparison process, which is obtaining a comparison result by comparing the interface information with a compatibility database;a compatibility determination process, which is obtaining a determination result by comparing the comparison result ...

USING STORED EXECUTION PLANS FOR EFFICIENT EXECUTION OF NATURAL LANGUAGE QUESTIONS

An analysis system connects to a set of data sources and perform natural language questions based on the data sources. The analysis system connects with the data sources and retrieves metadata describing data assets stored in each data source. The analysis system generates an execution plan for the natural language question. The analysis system finds data assets that match the received question based on the metadata. The analysis system ranks the data assets and presents the ranked data assets to users for allowing users to modify the execution plan. The analysis system may use execution plans of previously stored questions for executing new questions. The analysis system supports selective preprocessing of data to increase the data quality. 1. (canceled)2. A computer-implemented method comprising:storing a plurality of natural language questions, each natural language question processing data obtained from one or more data sources; generating an execution plan comprising instructions for accessing data from the one or more data sources for answering the natural language question;', 'storing the plurality of natural language questions and their execution plans;, 'for each of the plurality of natural language questionsreceiving a new natural language question;matching the new natural language question with one or more stored natural language questions;identifying a subset of stored natural language questions matching the new natural language question;sending information describing the subset of stored natural language questions;receiving a selection of a stored natural language question; andexecuting an execution plan for the new natural language question, the execution plan determined from the execution plan of the selected stored natural language question.3. The computer-implemented method of claim 2 , wherein identifying the subset of stored natural language questions matching the new natural language question comprises:ranking the stored natural language ...

Hybrid Column Store Providing Both Paged and Memory-Resident Configurations

Disclosed herein are system, method, and computer-program product embodiments for generating a paged and in-memory representation of a database object. An embodiment operates by maintaining in-memory and paged form primitives unique to the database object or a substructure thereof in a database such that the in-memory and paged form primitives are capable of providing the in-memory and paged representations of the database objects, respectively. Thereafter, a load configuration for the database object is determined. Based on the load configuration, the in-memory and/or paged representations of the database object are generated using the in-memory form primitive or the paged form primitive unique to the database object, respectively. Subsequently, the in-memory and/or paged representations of the database object are stored in the database. 1. A database system , comprising: an in-memory store configured to store a representation of a database object;', 'an on-disk store comprising an in-memory primitive store and a paged primitive store, and configured to store a primitive for the representation of the database object, wherein the primitive is saved as an in-memory form primitive in the in-memory primitive store or a paged form primitive in the paged primitive store, wherein the in-memory form primitive and the paged form primitive are a byte-compatible representation of the database object to provide a unified persistence format for the database object., 'a hybrid column store, comprising2. The database system of claim 1 , wherein the representation of the database object includes the database object or a substructure of the database object.3. The database system of claim 2 , wherein the substructure of the database object includes a dictionary claim 2 , a data vector claim 2 , an index claim 2 , one or more values claim 2 , or one or more value identifiers corresponding to the one or more values.4. The database system of claim 1 , wherein the database object ...

METHOD FOR BUILDING DATABASE IN WHICH VOICE SIGNALS AND TEXTS ARE MATCHED AND A SYSTEM THEREFOR, AND A COMPUTER-READABLE RECORDING MEDIUM RECORDING THE SAME

According to an embodiment, a method of building a database in which voice signals match texts comprises providing a captcha-purposed voice signal including a first voice signal matched with a first text and a second voice signal matched with no text, sending a request for a first input text and a second input text for the captcha-purposed voice signal, when the first input text and the second input text are received, comparing the first text with the first input text, and when the first text is identical to the first input text, matching the second voice signal with the second input text and storing the match. Embodiments of the present invention may be related to artificial intelligence (Al) modules, unmanned aerial vehicles (UAVs), robots, augmented reality (AR) devices, virtual reality (VR) devices, and 5G service-related devices. 1. A method of building a database in which voice signals match texts , the method comprising:providing a captcha-purposed voice signal including a first voice signal matched with a first text and a second voice signal matched with no text;sending a request for a first input text and a second input text for the captcha-purposed voice signal;based on confirming that the first input text and the second input text are received, comparing the first text with the first input text; andbased on confirming that the first text is identical to the first input text, matching the second voice signal with the second input text and storing the match.2. The method of claim 1 , wherein providing the captcha-purposed voice signal is provided upon preventing auto-registration in a website.3. The method of claim 1 , wherein providing the captcha-purposed voice signal includes setting a random order in which the first voice signal and the second voice signal are provided.4. The method of claim 1 , wherein the second voice signal includes logging data for a website or a speech recognition electronic device.5. The method of claim 1 , wherein matching the ...

Systems and Methods For Providing Data-Driven Evolution of Arbitrary Data Structures

A system and process for generalizing an evolutionary process applied to a particular domain involving different problems includes a researcher module for generating a configuration specification applicable to a particular problem. An evolution module parses the configuration specification into a representative tree structure, assembles policies for each node in the tree structure, and generates candidate genomes using the policies for each node in the tree structure. The policies may be applied to new data or data from prior runs to generate candidate genomes. The evolution module translates internal representations of the generated candidate genomes into known representations of the candidate genome for evaluation in accordance with the particular domain parameters by a candidate evaluation module.

INFORMATION PROCESSING DEVICE AND NON-TRANSITORY COMPUTER READABLE MEDIUM

An information processing device includes: a processor configured to: specify plural parts for manufacturing an ordered product; specify plural processes required from receiving an order of the product to completion of the product using plural parts; for an intermediate part generated by processing at least two of the plural parts, generate an intermediate object indicating intermediate part; for each of the plural parts, generate work objects indicating processes required for manufacturing the part; and create workflow information that arranges and displays, for each of the plural parts, the work objects indicating processes required for manufacturing the part in an order of the plural processes, and relates and displays, for each of the plural parts, work objects indicating processes executed continuously, in which in the workflow information, the intermediate object indicating intermediate part is associated with the work objects for the at least two parts used to generate the intermediate part. 1. An information processing device comprising: specify a plurality of parts for manufacturing an ordered product;', 'specify a plurality of processes required from receiving an order of the product to completion of the product using the plurality of parts;', 'for an intermediate part generated by processing at least two of the plurality of parts, generate an intermediate object indicating the intermediate part;', 'for each of the plurality of parts, generate work objects indicating processes required for manufacturing the part; and', arranges and displays, for each of the plurality of parts, the work objects indicating the processes required for manufacturing the part in an order of the plurality of processes, and', 'relates and displays, for each of the plurality of parts, work objects indicating processes executed continuously, wherein, 'create workflow information that'}], 'a processor configured toin the workflow information, the intermediate object indicating the ...

Determining metadata of a dataset

The present disclosure relates to a method for enabling a processing of a dataset of records having a set of attributes. The method comprises: selecting a first attribute of the set of attributes and a subset of one or more second attributes of the set of attributes. Distinct values of the subset of second attributes may be determined from the dataset. For each distinct value of the determined distinct values records of the dataset that have said each distinct value may be identified, and a group of words may be formed from values of the first attribute of the identified records. Distinct word sequences may be identified in the formed groups and a level of presence of each word sequence of the word sequences in each of the formed groups may be determined. At least part of the levels of presence may be provided as metadata.

SYSTEM FOR GENERATION OF RESOURCE IDENTIFICATION NUMBERS TO AVOID ELECTRONIC MISREADS

Embodiments of the invention are directed to a system, method, or computer program product structured for generating resource identification strings to avoid electronic misreads. In some embodiments, the system is structured for generating a new technology resource string of characters, comparing the new string to existing technology resource strings, and determining whether the new string is the same as an existing string. The system is also structured for, in response to determining it is not, for each existing string, pairing characters of the strings and determining whether the strings have at least a threshold number of matching character pairs; if there are, for at least one of the existing strings, determining whether characters of the non-matching pairs are commonly misread characters and determining whether there are a threshold combination of matching/commonly misread pairs; and if there are, discard the new string and generate a second new technology resource string. 1. A system for generating resource identification strings to avoid electronic misreads:a memory device with computer-readable program code stored thereon;a communication device; and receive a request for a new technology resource;', 'generate a new technology resource string of characters, each character having a position in the new technology resource string;', 'compare the new technology resource string to a plurality of existing technology resource strings, each existing technology resource string comprising a string of characters, each character having a position in the existing technology resource string, wherein each existing technology resource string is associated with an existing technology resource;', 'determine whether the new technology resource string is the same as an existing technology resource string;', pair each character of the new technology resource string with a character in a corresponding position in the existing technology resource string,', 'determine whether the ...

SYSTEMS AND METHODS FOR IDENTIFYING A SEQUENCE OF EVENTS AND PARTICIPANTS FOR RECORD OBJECTS

Methods, systems, and storage media for identifying a sequence of events and participants for record objects are disclosed. Exemplary implementations may: access record objects of a system of record; identify a subset of record objects associated with a group entity and having a first record object status; identify one or more electronic activities linked to the record objects; determine an event-participant pattern based on the electronic activities linked to the record object; identify electronic activities linked with a second record object; determine that a first event is performed by the a participant type and a second event is not yet performed by a second participant type; generate a content item identifying an action to trigger a performance of the second event; and transmit the content item to a device of a participant of at least one electronic activity linked with the second record object. 1. A method , comprising:accessing, by one or more processors, a plurality of record objects of a system of record of a data source provider, each record object of the plurality of record objects corresponding to a respective group entity, each record object comprising one or more object field-value pairs and linked to one or more electronic activities;identifying, by the one or more processors, a subset of record objects of the plurality of record objects associated with a group entity and having a first record object status;identifying, by the one or more processors, for each record object of the subset of record objects, one or more electronic activities linked to the record object, each electronic activity identifying one or more participants and corresponding to at least one event;determining, by the one or more processors, for each record object of the subset of record objects, an event-participant pattern based on the electronic activities linked to the record object, the event-participant pattern including at least a first event performed by a first participant ...

FRIEND RECOMMENDATION METHOD AND SYSTEM ORENTED TOWARD SUBWAY PASSENGERS

A friend recommendation method oriented towards subway passengers is disclosed, including: obtaining the source data associated with subway station passengers and subway operation; preprocessing the obtained source data; estimating passenger travel paths according to the preprocessed source data; calculating a detailed train operation timetable based on the subway train timetable and train departure intervals; matching each passenger to a specific train based on the estimated passenger travel paths and calculated train operation timetable; and extracting and measuring the interactions between passengers based on the matched passengers and specific trains, and accordingly making a friend recommendation. A friend recommendation system oriented towards subway passengers is further disclosed. 1. A friend recommendation method oriented towards subway passengers , comprising the following operations:a) obtaining source data associated with subway passengers and subway operation;b) preprocessing the obtained source data;c) estimating travel paths of the subway passengers based on the preprocessed source data;d) calculating a detailed train operation timetable based on a subway train timetable and train departure intervals;e) matching each of the subway passengers to a specific train based on the estimated travel paths of the subway passengers and the calculated train operation timetable; andf) extracting and measuring interactions between the subway passengers based on the matched subway passengers and specific trains, and accordingly making a friend recommendation.2. The method as recited in claim 1 , wherein operation b) comprises:processing original subway card-swipe data;obtaining complete travel OD (original to destination) data based on the original subway card-swipe data that has been processed above; andperforming abnormal OD data cleaning on the obtained complete travel OD data.3. The method as recited in claim 2 , wherein operation c) comprises:in conjunction ...

OPERATION MANAGEMENT APPARATUS, METHOD, AND NON-TRANSITORY COMPUTER READABLE MEDIUM

An object is to provide an operation management apparatus, a method, and a program capable of automatically repairing a system. An operation management apparatus according to the present disclosure includes an acquisition unit configured to acquire an operation setting value S from a system and acquire an expected value E from a design information database storing design information of the system, the operation setting value S being a setting value for operating the system, the expected value E being a setting value that is obtained when the system is normally operated, and an updating unit configured to update, when the operation setting value S does not match the expected value E, the operation setting value S to the expected value E. 1. An operation management apparatus comprising:at least one memory storing instructions, andat least one processor configured to execute the instructions to;acquire an operation setting value from a system and acquiring an expected value from a design information database storing design information of the system, the operation setting value being a setting value for operating the system, the expected value being a setting value that is obtained when the system is normally operated; andwhen the operation setting value does not match the expected value, update the operation setting value to the expected value.2. The operation management apparatus according to claim 1 , wherein the at least one processor is further configured to detect whether or not the operation setting value matches the expected value.3. The operation management apparatus according to claim 1 , wherein the at least one processor is further configured to store the expected value claim 1 , and configured to store the operation setting value.4. The operation management apparatus according to claim 1 , wherein the at least one processor is further configured to summarize a plurality of tasks for updating the operation setting value as an updating procedure workflow ...

OUTPUT VALIDATION OF DATA PROCESSING SYSTEMS

A method is provided for output validation of data processing systems, performed by one or more processors. The method comprises aggregating at least a portion of a first data table, which is an output of a data pipeline of a first data processing system, into a first aggregated data table; aggregating at least a portion of a second data table, which is an output of a data pipeline of a second data processing system, into a second aggregated data table; the second data processing system being designed to perform essentially a same functionality as the first data processing system; performing a data comparison between the first aggregated data table and the second aggregated data table to obtain a data differentiating table; performing a schema comparison between the first aggregated data table and the second aggregated data table to obtain a schema differentiating table; generating a summary from the data differentiating table and the schema differentiating table; and deriving a value from the summary that indicates a similarity between the output of the data pipeline of the first data processing system and the output of the data pipeline of the second data processing system. 1. A computer-implemented method for output validation of data processing systems , performed by one or more processors , the method comprising:aggregating at least a portion of a first data table, which is an output of a data pipeline of a first data processing system, into a first aggregated data table;aggregating at least a portion of a second data table, which is an output of a data pipeline of a second data processing system, into a second aggregated data table; the second data processing system being designed to perform essentially a same functionality as the first data processing system;performing a data comparison between the first aggregated data table and the second aggregated data table to obtain a data differentiating table;performing a schema comparison between the first aggregated ...

MEDICAL INFORMATION REGISTRATION SUPPORT DEVICE, MEDICAL INFORMATION REGISTRATION SUPPORT METHOD, AND PROGRAM

A medical information registration support device according to a first aspect of the present invention includes an input accepting unit configured to accept input of medical information, a determining unit configured to determine whether the accepted medical information and registration information match each other, a candidate generating unit configured to generate a candidate for the registration information for the accepted medical information by using a trained model that is constructed through machine learning, standardizes input medical information according to a type of the medical information and outputs the standardized medical information when the accepted medical information and the registration information do not match each other, and a registering unit for registering, as the registration information, medical information selected from the candidate or medical information obtained by correcting the candidate in association with the accepted medical information. 1. A medical information registration support device comprising:an input accepting unit configured to accept input of medical information;a determining unit configured to determine whether the accepted medical information and registration information match each other;a candidate generating unit configured to generate a candidate for the registration information for the accepted medical information by using a trained model that is constructed through machine learning, standardizes input medical information according to a type of the medical information and outputs the standardized medical information when the accepted medical information and the registration information do not match each other; anda registering unit configured to register, as the registration information, medical information selected from the candidate or medical information obtained by correcting the candidate in association with the accepted medical information.2. The medical information registration support device according to ...

Method and Device for Determining a Measure of Causal Influence Between Components of Complex Systems

Disclosed is a computer-implemented method for determining a measure of the causal interdependence of a source dataset S and a target dataset Y in the simultaneous presence of a non-empty confounding dataset B. The method includes a dimensional modification step to reduce the complexity of the data and an augmentation step to add information to the dimensionally modified data without a significant increase in size or complexity of the data. The augmented dimensionally modified data is used to calculate a measure of the causality or relatedness between the source dataset S and the target dataset Y. The method enables linear or nonlinear causality analysis of high-dimension multivariate time-series or features datasets, such as time-series datasets generated by functional MRI full-brain scans.

Field Variability based TCAM Splitting

A collection of rules comprising fields that may have wildcard values. The method includes defining first and second subsets of the fields, the second subset being exclusive of the first subset. Intersections of overlapping fields of the first subset are added to the first subset to form an augmented first subset. Metadata from the augmented first subset and the fields not selected for the first subset are combined to define second parts of the rules. Data items are classified by matching a search key to one of the first parts and one of the second parts of the rules.

METHOD TO DETECT DATABASE MANAGEMENT SYSTEM SQL CODE ANOMALIES

The present disclosure describes a computer-implemented method that includes: populating a metadata shell database with one or more hash values, wherein: each hash value corresponds to a verified installation of a database system, and the metadata shell database is maintained within a locked-down environment on an enterprise network; and monitoring metadata information of one or more database systems on the enterprise network based on periodically accessing metadata information of one or more database systems; and determining whether a database system on the enterprise network has been compromised based on a hash value of the metadata information of the database system and the one or more hash values from the metadata shell database. 1. A computer-implemented method comprising:{'claim-text': ['each hash value corresponds to a verified installation of a database system, and', 'the metadata shell database is maintained within a locked-down environment on an enterprise network; and'], '#text': 'populating a metadata shell database with one or more hash values, wherein:'}monitoring metadata information of one or more database systems on the enterprise network based on periodically accessing metadata information of one or more database systems; anddetermining whether a database system on the enterprise network has been compromised based on a hash value of the metadata information of the database system and the one or more hash values from the metadata shell database.2. The computer-implemented method of claim 1 , further comprising:computing a respective hash value of the metadata information of each of the one or more databases; andcomparing the respective hash value with a hash value from the metadata shell database that corresponds to the verified installation of the database system.3. The computer-implemented method of claim 2 , further comprising:determining whether the hash value of the database system on the enterprise network matches the hash value from the ...

Generating data structures for storing database metadata

The subject technology generates a first data structure including first metadata and a second data structure including second metadata, the first metadata corresponding to a set of micro-partitions, the second metadata for a grouping of the first metadata, the second data structure including information associating the second metadata to the first metadata. The subject technology stores the first data structure and the second data structure in storage as a first file and a second file. The subject technology stores third metadata for a table, the third metadata comprising: cumulative table metadata comprising global information about a plurality of micro-partitions of the table, the cumulative table metadata being stored in a metadata micro-partition associated with the table.

STORING METADATA USING DATA STRUCTURES IN DATABASE SYSTEMS

The subject technology receives first metadata corresponding to a set of micro-partitions. The subject technology stores a first data structure and a second data structure in storage as a first file and a second file, first data structure including the first metadata and a second data structure including second metadata, the first metadata corresponding to a set of micro-partitions, the second metadata for a grouping of the first metadata, the second data structure including information associating the second metadata to the first metadata. The subject technology stores third metadata for a table, the third metadata comprising: cumulative table metadata comprising global information about a plurality of micro-partitions of the table, the cumulative table metadata being stored in a metadata micro-partition associated with the table. 1. A system comprising:at least one processor; anda memory device including instructions, which when executed by the at least one processor, cause the at least one processor to perform operations comprising:receiving first metadata corresponding to a set of micro-partitions;storing a first data structure and a second data structure in storage as a first file and a second file, first data structure including the first metadata and a second data structure including second metadata, the first metadata corresponding to a set of micro-partitions, the second metadata for a grouping of the first metadata, the second data structure including information associating the second metadata to the first metadata; andstoring third metadata for a table, the third metadata comprising:cumulative table metadata comprising global information about a plurality of micro-partitions of the table, the cumulative table metadata being stored in a metadata micro-partition associated with the table.2. The system of claim 1 , wherein the first file comprises:a header, file metadata including a serialized list of metadata objects, expression properties for a first ...

SYSTEMS AND METHODS FOR UNIVERSAL MONITORING AND ACTION

Various embodiments address problems with managing student engagement and managing the need to identify and resolve underlying causes for problem behavior and other schooling issues (e.g., attendance, etc.). Embodiments can be provided and tailored to respective school systems, school districts, and/or custom student bodies. For example, the system can include components to manage communication with students and/or families based on defined communication triggers, continuous analysis of students and modeled parameters (e.g., intelligent models), communication scripting, etc. The system can use automatic communication sessions as intervention for students having or predicted to have issues with engagement, as well to identify or derive sources for engagement issues. Various embodiment train intelligent models to select communications automatically that elicit information, and to provide responsive communication automatically to identified issues. Each communication session can be used to update intelligent models and improve communication, and further improve student engagement. 1. A monitoring and response system comprising:at least one processor operatively connected to a memory; 'automatically capture student location and activity data;', 'a monitor component, executed by the at least one processor, configured to match student location and activity data to student performance models; and', 'trigger intervention via an automated chat interface responsive to a prediction of reduced performance; and, 'a machine learning component configured to select scripted communication elements responsive to an intervention trigger;', 'request responses from a respective that include student generated causal information; and', 'select one or more communication responses based at least in part on student response, context, and machine learning models of effective communication responses., 'the automated chat interface configured to2. The system of claim 1 , further comprising an ...

Pattern Processor

To achieve a better overall performance, a preferred pattern processor offsets large latency with massive parallelism. The preferred pattern processor could be either a pattern-processor die comprising 3-D non-volatile memory (3D-NVM) arrays, or a pattern-processor doublet comprising a 3D-NVM die and a pattern-processing die bonded face-to-face. A searchable storage comprises a plurality of storage-like pattern processors, each of which not only stores data but also has in-situ searching capabilities. 123-. (canceled)24. A pattern processor , comprising a single-crystalline semiconductor substrate , an input bus for transferring at least a first portion of a first pattern , and a plurality of storage-processing units (SPU's) communicatively coupled with said input bus , each of said SPU's comprising:at least a three-dimensional non-volatile memory (3D-NVM) array including memory cells for storing at least a second portion of a second pattern, wherein said memory cells are neither in contact with nor interposed therebetween by any semiconductor substrate including said single-crystalline semiconductor substrate; and, said memory cells do not comprise any single-crystalline semiconductor material;a pattern-processing circuit and at least a portion of a peripheral circuit of said 3D-NVM array disposed on said single-crystalline semiconductor substrate, wherein said pattern-processing circuit performs pattern processing for said first and second patterns; said peripheral circuit is communicatively coupled with said pattern-processing circuit; and, said pattern-processing circuit and said portion of said peripheral circuit comprise at least a single-crystalline semiconductor material;a plurality of inter-storage-processor (ISP) connections for communicatively coupling said memory cells and said peripheral circuit, wherein said ISP-connections do not penetrate through any semiconductor substrate including said single-crystalline semiconductor substrate; and, said memory ...

COMPUTER-READABLE RECORDING MEDIUM STORING DATA PROCESSING PROGRAM, DATA PROCESSING DEVICE, AND DATA PROCESSING METHOD

A non-transitory computer-readable recording medium stores a data processing program for causing a computer to execute processing including: obtaining a similarity between each of a plurality of attributes included in first table data and each of a plurality of attributes included in second table data; and associating each of the plurality of attributes included in the first table data with any attribute of the plurality of attributes included in the second table data on the basis of the similarity, an order of the plurality of attributes included in the first table data, and an order of the plurality of attributes included in the second table data. 1. A non-transitory computer-readable recording medium storing a data processing program for causing a computer to execute processing comprising:obtaining a similarity between each of a plurality of attributes included in first table data and each of a plurality of attributes included in second table data; andassociating each of the plurality of attributes included in the first table data with any attribute of the plurality of attributes included in the second table data on the basis of the similarity, an order of the plurality of attributes included in the first table data, and an order of the plurality of attributes included in the second table data.2. The non-transitory computer-readable recording medium storing a data processing program according to claim 1 , wherein the processing of associating each of the plurality of attributes included in the first table data with any attribute of the plurality of attributes included in the second table data includes processing of selecting a first attribute and a second attribute adjacent to the first attribute from among the plurality of attributes included in the first table data on the basis of the order of the plurality of attributes included in the first table data claim 1 , processing of selecting a third attribute and a fourth attribute adjacent to the third attribute ...

OPTIMIZING METHOD OF SEARCH FORMULA FOR PATENT DOCUMENT AND DEVICE THEREFOR

The present disclosure provides an optimization method for a patent literature search formula, including: a step of receiving the patent literature search formula; a step of classifying the received patent literature search formula into a plurality of groups based on a preset search operator; a step of adding at least one search word having a high-degree of relevance to each search word included in each classified group by using a first search operator; a step of generating a first final search formula by connecting and combining, with a second search operator, a plurality of groups to which the at least one search word is added; and a step of providing a user with the first final search formula. 1. An optimization method for a patent literature search formula , comprising:a step of receiving the patent literature search formula;a step of classifying the received patent literature search formula into a plurality of groups based on a preset search operator;a step of adding at least one search word having a high-degree of relevance to each search word included in each classified group by using a first search operator;a step of generating a first final search formula by connecting and combining, with a second search operator, a plurality of groups to which the at least one search word is added; anda step of providing a user with the first final search formula.2. The optimization method for a patent literature search formula of claim 1 ,wherein the first search operator is an ‘or’ operator or an ‘and’ operator, and the second search operator is the ‘and’ operator or the ‘or’ operator.3. The optimization method for a patent literature search formula of claim 1 ,wherein the preset search operator corresponds to at least one of the item field operator, the ‘and’ operator, the ‘or’ operator, a parenthesis operator, and a ‘not’ operator.4. The optimization method for a patent literature search formula of claim 3 ,wherein the preset search operator excludes an ‘and’ operator ...

Systems and Methods For Associating Data Entries

In one embodiment, a first entry in a first database is modified to include data from a highest-ranked one of one or more available data tables that correspond to the first entry. Each of one or more characters fields of the modified first entry are converted into a respective one or more first-entry tokens, and each of one or more character fields of each of a plurality of second entries in a second database is converted into a respective one or more second-entry tokens. The first-entry tokens are compared to the second-entry tokens, and, in response to the comparison, it is determined whether the first entry matches one of the second entries. In response to determining that the first entry matches one of the second entries, the first entry and the matching second entry are associated with one another in one or both the first and second databases. 1. A method , comprising:modifying, by a computing device, a first entry in a first database to include data from a highest-ranked one of one or more available data tables that correspond to the first entry;converting, by a tokenizer of the computing device, each of one or more character fields of the modified first entry into a respective one or more first-entry tokens;determining a first set of weights for the first-entry tokens based on a frequency of the first-entry tokens;converting, by the tokenizer, each of one or more character fields of each of a plurality of second entries in a second database into a respective one or more second-entry tokens;determining a second set of weights for the second-entry tokens based on a frequency of the second-entry tokens;comparing, by the computing device, the first-entry tokens to the second-entry tokens;determining, by the computing device, whether the first entry matches one of the second entries based on the comparison, the first set of weights for the first-entry tokens, and the second set of weights for second-entry tokens; andassociating, by the computing device in the ...

CONTROLLER INCLUDING MAP CACHE AND MEMORY SYSTEM INCLUDING CONTROLLER

The present technology includes a controller and a memory system including the same. The controller includes a descriptor manager configured to generate descriptors including logical addresses and physical addresses respectively mapped to the logical addresses, a map cache configured to store the descriptors in a linear structure and a binary tree structure, and a map search engine configured to search for a descriptor corresponding to a logical address received from an external device among the descriptors stored in the map cache by performing a linear search method, a binary search method, or both, according to a status of the map cache. 1. A controller comprising:a descriptor manager configured to generate descriptors including logical addresses and physical addresses respectively mapped to the logical addresses;a map cache configured to store the descriptors in a linear structure and a binary tree structure; anda map search engine configured to search for a descriptor corresponding to a logical address received from an external device among the descriptors stored in the map cache by performing a linear search method, a binary search method, or both, according to a status of the map cache.2. The controller of claim 1 , wherein the descriptor manager is configured to store the descriptors in the map cache in the linear structure and the binary tree structure.3. The controller of claim 1 , wherein the descriptor manager comprises:a descriptor generator configured to sequentially generate the descriptors, each including a logical address and a corresponding physical address; anda temporary buffer configured to sequentially queue and output the descriptors generated by the descriptor generator.4. The controller of claim 1 , wherein the map cache comprises:a sub queue configured to store descriptors in the linear structure;a main queue configured to store descriptors in the binary tree structure; anda status buffer configured to store status information on whether the ...

Content Agnostic Memory Pageable Storage Model

Disclosed herein are system, method, and computer program product embodiments for storing an object onto a first or second page. An embodiment operates by receiving the object and determining that the first page has sufficient unused space for storing at least one byte of the object. Thereafter, a data block of the object is created to comprise at least one byte of the object. The data block is then stored on the first page or the second page, and a location of the object's first data block is recorded. Thereafter, a pointer corresponding to the location of the object's first data block for loading the object is provided. 1. A computer-implemented method for storing a data object , comprising:receiving the data object, wherein the data object comprises one or more bytes;determining that a page of an on-disk store of a database has sufficient unused space for storing a subset of bytes of the data object, wherein the subset of bytes includes a first byte of the one or more bytes;creating a data block of the data object to store the subset of bytes;storing the data block in the page of the on-disk store;determining a location of the data block stored in the page of the on-disk store; andgenerating a pointer corresponding to the location of the data block, wherein the pointer is used as a key to access the data object.2. The computer-implemented method of claim 1 , wherein the page of the on-disk store includes contiguous blocks of memory.3. The computer-implemented method of claim 1 , wherein the data block includes a header and a payload claim 1 , the header includes a metadata unique to the data block claim 1 , and the payload includes the subset of bytes of the data object.4. The computer-implemented method of claim 1 , wherein the receiving the data object comprises receiving the data object by a buffer of an in-memory store of the database.5. The computer-implemented method of claim 4 , wherein the storing the data block in the page of the on-disk store comprises: ...

SYSTEMS AND METHODS FOR GENERATING A COGNITIVE ANALYTICS HUB AND PREDICTIVE ACTIONS FROM DISTRIBUTED DATA MODELS

A cognitive database system matches a particular data element, that is specified as part of received user input, to a first set of data elements in a set of data models based on semantic commonality, and matches the particular data element to a second set of data elements in the set of data models based on visual commonality between graphical representations of the particular data element and the second set of data elements. The cognitive database may determine interdependency between the particular data element and a particular subset of the first and second sets of data elements based on a measure of semantic commonality and/or visual commonality, and may generate a response to the user input with values from the particular subset of data elements that are updated directly from the interdependency that is determined upon receiving the user input. 1. A device , comprising: receive user input that is directed to a particular data element in at least a first data model of a plurality of data models, wherein each data model of the plurality of data models comprises a plurality of data elements;', 'match the particular data element to a first set of data elements in the plurality of data models based on semantic commonality between the particular data element and the first set of data elements;', 'match the particular data element to a second set of data elements in the plurality of data models based on visual commonality between graphical representations of the particular data element and the second set of data elements in the plurality of data models;', 'determine interdependency between the particular data element and a particular subset of data elements from the first set of data elements and the second set of data elements based on a measure of similarity between the particular subset of data elements and the particular data element; and', 'generate a response to the user input comprising values from the particular subset of data elements that are updated directly ...

Internal key hash directory in table

Provided is a system and method for searching for a target key in a database, the method including populating a hash-offset table of a sorted key table with hash-offset table entries, the hash-offset table entries having a hash-value corresponding to a respective key, and a hash offset, sorting the hash-offset table entries based on the hash-values, searching for a target hash-value of the hash-values corresponding to a target key in the hash-offset table, locating a target key-value pair corresponding to the target key based on the target hash-value, and saving a location of the target key-value pair.

ASSOCIATING USER-PROVIDED CONTENT ITEMS TO INTEREST NODES

System and methods are presented for associating a user-posted content item with an interest node of an interest taxonomy. A corpus of content items and an interest taxonomy are maintained. The interest taxonomy comprises interest nodes organized in a hierarchical organization, each node having a text label descriptive of the interest node. Additionally, the content items of the corpus are associated with one or more interest nodes of the interest taxonomy. Upon receiving a user-posted content item, feature sets of the received content item are generated, these feature sets based on features and/or aspects of the received content item. After generating at least one feature set, the at least one feature set is provided to an interest prediction model that generates candidate interest nodes for the user-posted content item. At least some of the candidate interest nodes are associated with the user-posted content item in the corpus. 1. A computer-implemented method for matching a content item to an interest node in an interest taxonomy , the method comprising:maintaining a corpus of content items and an interest node taxonomy, wherein the interest node taxonomy comprises a plurality of interest nodes organized in a hierarchical organization, and wherein content items of the corpus of content items are associated with one or more interest nodes of the interest taxonomy;receiving a content item to be added to the corpus of content items;determining at least one feature set of the received content item according to aspects of the received content item;providing the at least one feature set of the received content item to an interest prediction model, wherein the interest prediction model is a trained machine learning model to generate a list of candidates for a content item according to one or more feature sets of the content item;obtaining a set of predicted interest node candidates for the received content item from the interest prediction model; andassociating at least ...

METHOD AND APPARATUS FOR QUERYING SHORTEST PATH OF GRAPH, AND STORAGE MEDIUM

The present disclosure provides a method and an apparatus for querying the shortest path of a graph, and a storage medium. The method includes: performing a breadth-first search in a distributed graph database with a start entity to be searched and an end entity to be searched as root nodes respectively, and obtaining a layer of new entities for each search; performing an intersection checking on the new entities and entities of the highest layer from a search set on an opposite side, so as to determine whether an intersection between the new entities and the entities of the highest layer exists; and when the intersection exists, determining intersection points, and performing path backtracking through the intersection points to find the shortest path from the start entity to the end entity. 1. A method for querying the shortest path of a graph , comprising:performing a breadth-first search in a distributed graph database with a start entity to be searched and an end entity to be searched as root nodes respectively, and obtaining a layer of new entities for each search;performing an intersection checking on the new entities and entities of the highest layer from a search set on an opposite side, so as to determine whether an intersection between the new entities and the entities of the highest layer exists; andwhen the intersection exists, determining intersection points, and performing path backtracking through the intersection points to find the shortest path from the start entity to the end entity.2. The method according to claim 1 , performing the breadth-first search in the distributed graph database with the start entity to be searched and the end entity to be searched as the root nodes respectively comprising:performing the breadth-first search in the distributed graph database alternatively with the start entity to be searched and the end entity to be searched as the root nodes respectively.3. The method according to claim 2 , performing the breadth-first ...

METHOD AND SYSTEM FOR SEARCHING A KEY-VALUE STORAGE

The present teaching relates to a method, system and programming for recovering a data storage. In response to a failure of the data storage, a last checkpointed version is retrieved from a checkpoint file created previously for the failure of the data storage. A recovery table is updated to indicate the last checkpointed version and an incarnation number indicating a number of previous recovery of the data storage. The data storage is recovered based on the recovery table. A version number of the last checkpointed version is reset to zero upon a successful recovery of the data storage. The incarnation number is incremented.

SYSTEMS AND METHODS FOR DETERMINING THE SHAREABILITY OF VALUES OF NODE PROFILES

The present disclosure relates to determining the shareability of values of node profiles. Record objects and electronic activities of a system of record corresponding to a data source provider may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Values of fields corresponding to a predetermined type of field including fewer than a predetermined threshold number of data source providers may be identified. A restriction tag used to restrict populating other node profiles may be generated. Provision of the value with a second data source provider may be restricted. 1. A method comprising:accessing, by one or more processors, at least one of i) a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers or ii) a plurality of record objects of one or more systems of record associated with the one or more data source providers;maintaining, by the one or more processors, a plurality of node profiles, each node profile of the plurality of node profiles including one or more field-value pairs, each field-value pair including a value determined from data of one or more of the plurality of electronic activities or the plurality of record objects;identifying, by the one or more processors, for a first node profile, a value of a field corresponding to a predetermined type of field that is included in one or more electronic activities or record objects accessed from a set of first data source providers including fewer than a predetermined threshold number of data source providers;generating, by the one or more processors, a restriction tag used by the one or more processors to restrict populating other node profiles of the plurality of node profiles or systems of record with the value of the node field-value pair of the first node profile; andrestricting, by the one or more processors, provision of the ...

SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES TO RECORD OBJECTS USING FEEDBACK BASED MATCH POLICIES

Systems and methods for matching electronic activities to record objects using feedback based match policies can include accessing a plurality of electronic activities and record objects. The systems and method can include identifying candidate record objects by applying a matching model. The systems and methods can include selecting a record object based on a match score. The systems and methods can include configuring the matching model in a first configuration responsive to a first feedback type or configuring the matching model in a second configuration responsive to a second feedback type. 1. A method , comprising:accessing, by one or more processors, a plurality of electronic activities transmitted or received via electronic accounts of one or more data source providers;accessing, by the one or more processors, a plurality of record objects of one or more systems of record, each record object of the plurality of record objects corresponding to a record object type and comprising one or more object fields having one or more object field values, the systems of record corresponding to the one or more data source providers;identifying, by the one or more processors, responsive to applying a matching model for identifying candidate record objects, a plurality of candidate record objects with which to match an electronic activity of the plurality of electronic activities, the matching model used to generate a respective match score for each candidate record object of the plurality of candidate record objects;selecting, by the one or more processors, a first record object from the plurality of candidate record objects based on a first match score for the first record object;configuring, by the one or more processors, responsive to a first feedback type regarding the selection of the first record object, the matching model in a first configuration to generate a second match score between the electronic activity and the first record object greater than the first match ...

METHOD AND/OR SYSTEM FOR PROCESSING DATA STREAMS

Embodiments of methods, apparatuses, devices and/or systems for manipulating character expressions to determine relationships among such character expressions. 1112.-. (canceled)113. A method of processing characters in a stream of characters expressing words , mathematical expressions , numerical expressions , acronyms and/or multicharacter symbols in a particular spoken and/or written language , the method comprising:parsing a stream of characters to obtain one or more first character expressions from the stream of characters, the one or more first character expressions being descriptive of corresponding events and/or transactions;concatenating binary expressions representing individual characters of at least one of said one or more first character expressions in one or more first binary strings, said at least one said one or more first character expressions representing a first alphanumeric value of a first alphanumeric expression, the first alphanumeric expression comprising a concatenation of said individual characters representing digit values at associated positions in the first alphanumeric expression, indicative of ones of said digit value having exactly one of three or more possible unique values; andprocessing a query based, at least in part, on an application of an operator to at least one of said one or more first binary strings to provide a comparison of said first alphanumeric value of said first alphanumeric expression represented by said concatenation of individual characters of said at least one of said one or more first character expressions with a second alphanumeric value represented by one or more second character expressions of said query.114. The method of claim 113 , wherein said first alphanumeric value comprises a sum of products claim 113 , said products comprising individual ones of said digit values multiplied by a position value associated with positions of said digit values multiplied by position values associated with positions of ...

SYSTEMS AND METHODS FOR DETECTING EVENTS BASED ON UPDATES TO NODE PROFILES FROM ELECTRONIC ACTIVITIES

The present disclosure relates to methods, systems, and storage media for detecting events based on updates to node profiles from electronic activities. Exemplary implementations may access an electronic activity transmitted or received via an electronic account associated with a data source provider; generate a plurality of activity field-value pairs; maintain a plurality of node profiles; identify a first state of a first node profile of the plurality of node profiles; update the first node profile using the electronic activity; identify a second state of the first node profile subsequent to updating the first node profile using the electronic activity; detect a state change of the first node profile based on the first state and the second state; determine that the state change satisfies an event condition; and store an association between the first node profile and an event type corresponding to the event condition. 120-. (canceled)21. A method , comprising:maintaining, by one or more processors, in one or more data structures, a plurality of node profiles, each node profile of the plurality of node profiles including one or more node field-value pairs, each node field-value pair including a node value associated with a node field;updating, by the one or more processors, responsive to a first electronic activity of a plurality of electronic activities, a first node profile of the plurality of node profiles based on the first electronic activity by adding or updating a first node field-value pair corresponding to a company name field of the first node profile;determining, by the one or more processors, responsive to determining that the first node field-value pair corresponds to the company name field of the first node profile, a job change event based on an event detection policy for identifying events based on updates to a value of the one or more node field-value pairs corresponding to predetermined fields of node profiles of the plurality of node profiles; ...

MULTI-LEVEL DATA FOR DATABASE SYSTEMS

The subject technology receives first metadata corresponding to a set of micro-partitions. The subject technology stores a first data structure and a second data structure in storage as a first file and a second file, first data structure including the first metadata and a second data structure including second metadata, the first metadata corresponding to a set of micro-partitions, the second metadata for a grouping of the first metadata, the second data structure including information associating the second metadata to the first metadata. The subject technology stores third metadata for a table, the third metadata comprising information about data stored in a micro-partition of the table. 1. A system comprising:at least one processor; anda memory device including instructions, which when executed by the at least one processor, cause the at least one processor to perform operations comprising:receiving first metadata corresponding to a set of micro-partitions;storing a first data structure and a second data structure in storage as a first file and a second file, first data structure including the first metadata and a second data structure including second metadata, the first metadata corresponding to a set of micro-partitions, the second metadata for a grouping of the first metadata, the second data structure including information associating the second metadata to the first metadata; andstoring third metadata for a table, the third metadata comprising:information about data stored in a micro-partition of the table.2. The system of claim 1 , wherein the information about data stored in the micro-partition comprises a column expression property.3. The system of claim 1 , wherein the operations further comprise:generating, prior to the storing, the first data structure including the first metadata and the second data structure including the second metadata.4. The system of claim 1 , wherein the operations further comprise:storing the first data structure and the ...

SYSTEM AND METHOD FOR ASSESSING VALUATION OF DOCUMENT

A system and method for assessing valuation of a document. The system includes a server arrangement communicably coupled to a client device. The server arrangement is configured to obtain information pertaining to document and ontologically map to identify relevant entities and semantic inter-relationships between identified entities for the current research work in the document; access information about entities and semantic inter-relationships related to existing research work in technical field from publicly accessible knowledge; compare the entities and the semantic inter-relationships related to the current research work in the document with the entities and the semantic inter-relationships related to existing research work determine a novelty of the document; and determine an assessment value of the document, based on the determined novelty of the document with respect to the publicly accessible knowledge, utilizing an expectation maximization algorithm. 1. A system for assessing valuation of a document providing experimental data related to current research work in a technical field , the system comprising a server arrangement comprising a processor communicably coupled via a data communication network with a client device , wherein the processor of the server arrangement is configured to execute machine readable instructions that cause the server arrangement to:obtain, from the client device, information pertaining to the document, and ontologically map the document to identify relevant entities and semantic inter-relationships between identified entities for the current research work in the document;access information about entities and semantic inter-relationships related to existing research work in the technical field from publicly accessible knowledge;compare the entities and the semantic inter-relationships related to the current research work in the document with the entities and the semantic inter-relationships related to existing research work in ...

SYSTEMS AND METHODS FOR DETERMINING A COMPLETION SCORE OF A RECORD OBJECT FROM ELECTRONIC ACTIVITIES

The present disclosure relates to a method for determining a completion score for a record object based on electronic activities. The method includes accessing record objects, each of which corresponds to a record object type and includes object fields having object field-values. The method includes selecting one of the record objects. The method includes identifying electronic activities transmitted or received associated with the record object. Each of the electronic activities has a timestamp indicating a receipt time or transmission time of the respective electronic activity. The method includes determining a participant of each of the electronic activities. The method includes determining a completion score indicating a likelihood of completing an event associated with the record object based on the timestamp of each of the electronic activities and the participant of each of the electronic activities. The method includes storing an association between the record object and the completion score. 1. A method comprising:accessing, by one or more processors, a plurality of record objects of one or more systems of record, each record object of the plurality of record objects corresponding to a record object type and comprising one or more object fields having one or more object field-values;selecting, by the one or more processors, a first record object of the plurality of record objects;identifying, by the one or more processors, a plurality of electronic activities transmitted or received via electronic accounts and associated with the first record object, each of the plurality of electronic activities having a timestamp indicating a receipt time or transmission time of the respective electronic activity;determining, by the one or more processors and responsive to parsing the plurality of electronic activities, at least one participant of each of the plurality of electronic activities;determining, by the one or more processors, a completion score indicating a ...

SYSTEMS AND METHODS FOR MERGING TENANT SHADOW SYSTEMS OF RECORD INTO A MASTER SYSTEM OF RECORD

The present disclosure is related to systems and methods of merging tenant shadow systems of record into a master system of record. First tenant record objects of a first tenant system of record can be accessed. A master record object for a master system of record can be generated using the corresponding first tenant record object. A second tenant record object of a second tenant system of record can be accessed. Whether the second tenant record object is to be merged into the corresponding master record object can be determined. When determined to merge, the second tenant record object can be merged into the corresponding master record object. When determined to not merge, a new master record can be generated. 1. A method , comprising:accessing, by one or more processors, a plurality of first tenant record objects of a first tenant system of record, each first tenant record object of the plurality of first tenant record objects comprising one or more object field-value pairs, the first tenant system of record associated with a first data source provider of a plurality of data source providers;generating, by the one or more processors, for each first tenant record object of the first tenant system of record, a master record object for a plurality of master record objects using the first tenant record object, the master record object including one or more object field-value pairs of the corresponding first tenant record object;accessing, by one or more processors, a plurality of second tenant record objects of a second tenant system of record, each second tenant record object of the second plurality of tenant record objects comprising one or more object field-value pairs, the second tenant system of record associated with a second data source provider of the plurality of data source providers;determining, by the one or more processors, whether to match a second tenant record object of the plurality of second tenant record object with a corresponding first master ...

Systems and methods of generating an engagement profile

The present disclosure relates to systems and methods for determining an engagement profile of a participant by associating electronic activities to a profile. It may generate the engagement profile based on analysis of the electronic activity level. An example implementation may contain the following steps. The system may access for a first record object a plurality of electronic activities linked with the first record object. The system may identify for a participant from the plurality of electronic activities a set of electronic activities including the participant. The system may determine an engagement profile of the participant based on a first number of electronic activities of the set of electronic activities sent by the participant, a second number of the set of electronic activities received by the participant and a temporal distribution of the set of electronic activities. The system may store the engagement profile in one or more data structures.

SYSTEMS AND METHODS FOR CLASSIFYING ELECTRONIC ACTIVITIES BASED ON SENDER AND RECIPIENT INFORMATION

The system and methods described herein can classify electronic activities based on sender and recipient information. The system can determine a relationship between a sender of an electronic activity and at least one recipient of the electronic activity using a sender node profile and a recipient node profile. The system can assign a tag to the electronic activity based on the relationship between the sender and one or more recipients of the electronic activity. The system can process the electronic activity based on the assigned tag. 1. A method comprising:maintaining, by one or more processors, a plurality of node profiles corresponding to a plurality of unique entities, each node profile including a plurality of fields, each field of the plurality of fields including one or more value data structures, each value data structure of the one or more value data structures including a value and one or more entries corresponding to respective one or more data points that include the value of the value data structure;accessing, by the one or more processors, a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers, the one or more processors configured to update the plurality of node profiles using the plurality of electronic activities;identifying, by the one or more processors, an electronic activity of the plurality of electronic activities to process;determining, by the one or more processors, a relationship between a sender of the electronic activity and at least one recipient of the one or more recipients of the electronic activity using the node profiles of the sender and the at least one recipient included in the plurality of node profiles;assigning, by the one or more processors, a tag to the electronic activity based on the relationship between the sender and the one or more recipients; andprocessing, by the one or more processors, the electronic activity based on the assigned tag.2. ...

SYSTEMS AND METHODS FOR RESTRICTING ELECTRONIC ACTIVITIES FROM BEING LINKED WITH RECORD OBJECTS

The present disclosure relates to restricting electronic activities from being linked with record objects. According to at least one aspect of the disclosure, a method can include accessing, by one or more processors, a plurality of electronic activities, accessing a plurality of record objects of one or more systems of record, identifying an electronic activity of the plurality of electronic activities to match to one or more record objects, determining a data source provider associated with providing access to the electronic activity, and identifying a system of record corresponding to the determined data source provider. The system of record can include a plurality of candidate record objects to which to match the electronic activity. The method can include restricting the electronic activity from being linked with the at least one record object. 1. A method comprising:accessing, by one or more processors, a plurality of electronic activities transmitted or received via electronic accounts of one or more data source providers;accessing, by the one or more processors, a plurality of record objects of one or more systems of record, each record object of the plurality of record objects corresponding to a record object type and comprising one or more object fields having one or more object field values, the systems of record corresponding to the one or more data source providers;identifying, by the one or more processors, an electronic activity of the plurality of electronic activities to match to one or more record objects;determining, by the one or more processors, a data source provider associated with providing the one or more processors access to the electronic activity;identifying, by the one or more processors, a system of record corresponding to the determined data source provider, the system of record including a plurality of candidate record objects to which to match the electronic activity; and (a) determining, by applying a rule-based restriction policy ...

SYSTEMS AND METHODS FOR GENERATING NEW RECORD OBJECTS BASED ON ELECTRONIC ACTIVITIES

Methods, systems, and storage media for generating new record objects based on electronic activities are disclosed. Example implementations may: access a plurality of electronic activities; access a plurality of record objects; parse an electronic activity of the plurality of electronic activities; determine, responsive to parsing the electronic activity, that the electronic activity is to be matched to one or more record objects; determine for each candidate record object that a match score indicating a likelihood of electronic activity being matched to the candidate record object is below a threshold; determine an object type of a new record object to generate based on one or more participants of the electronic activity; generate the new record object of the determined type; and store in a data structure an association between the new record object and the electronic activity. 1. A method comprising:accessing a plurality of electronic activities transmitted or received via electronic accounts of one or more data source providers;accessing a plurality of record objects of one or more systems of record, each record object of the plurality of record objects corresponding to a record object type and comprising one or more object fields having one or more object field values, the systems of record corresponding to the one or more data source providers;parsing an electronic activity of the plurality of electronic activities;determining, responsive to parsing the electronic activity, that the electronic activity is to be matched to one or more record objects;generating activity field-value pairs from the electronic activity;identifying a system of record corresponding to the data source provider associated with an electronic account via which the electronic activity was accessed, the system of record including a plurality of candidate record objects with which to match the electronic activity, the plurality of candidate record objects including a first record object type ...

SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES WITH RECORD OBJECTS BASED ON ENTITY RELATIONSHIPS

The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object. 1. A method comprising:accessing, by one or more processors, a plurality of electronic activities transmitted or received via electronic accounts of one or more data source providers;identifying, by the one or more processors, an electronic activity of the plurality of electronic activities accessed from one or more servers of a first entity;identifying, by the one or more processors, a first participant of the electronic activity associated with the first entity and a second participant of the electronic activity associated with a second entity;parsing, by the one or more processors, the electronic activity to extract data for matching the electronic activity to one or more record objects of a system of record of the first entity; determining, by the one or more processors, whether a record object identifier indicating a relationship between the first entity and the second entity is included in the electronic activity;', identifying, by the one or more processors, a first record ...

ENCACHING AND SHARING TRANSFORMED LIBRARIES

Embodiments disclosed herein are directed at applying transformations to computer code residing in original libraries for protection against cyberattacks. For example, the transformations applied on original libraries cause random reorganization of the computer code resulting in a transformed version of an original library. Although a malicious attacker can utilize a known exploit of the original library and launch a cyberattack, such knowledge is of no use on the transformed version of the original library. In some embodiments, the transformed version of the original library is stored in cache memory and shared by multiple executable programs to facilitate efficient memory utilization. By making updates to information within the memory occupied by the executable program, the connection between the transformed version of the original library and the executable program is established, when the executable program attempts to access the functional blocks of the original library, which can be released from memory. 1. A method of enabling efficient memory access to a computer code library that has undergone transformation to impede cyberattacks , the method comprising:performing configuration of a daemon loaded into a first memory location and unobtrusively running in the background is configured to manage access of a cached library available for sharing among two or more executable programs, wherein the cached library included within the first memory location comprises (i) randomly reorganized machine code portions corresponding to respective functional blocks of an original library, (ii) library-specific metadata describing memory addresses of the randomly reorganized machine code portions corresponding to respective functional blocks of the original library, and (iii) relocation data describing a static structure of the functional blocks in the original library;receiving, at the daemon, a query to determine if the cached library is available for access to a client ...

DIGITAL TWIN ARTICLE RECOMMENDATION CONSULTATION

A method, computer system, and a computer program product for consulting a technician on one or more appropriate articles based on a digital twin associated with a physical asset is provided. The present invention may include assigning a technician to a job associated with the physical asset. The present invention may then include associating the digital twin with the physical asset. The present invention may also include matching one or more digital twin resources from a digital twin repository. The present invention may then include identifying a piece of relevant data from the matched one or more digital twin resources to the job associated with the physical asset. The present invention may further include identifying the one or more appropriate articles for the assigned technician to utilize to perform the job associated with the physical asset from the identified piece of relevant data. 1. A computer-implemented method comprising:assigning a technician to a job associated with a physical asset;associating a digital twin with the physical asset;matching one or more digital twin resources from a digital twin repository associated with the associated digital twin to the physical asset;identifying a piece of relevant data from the matched one or more digital twin resources to the job associated with the physical asset; andidentifying one or more appropriate articles for the assigned technician to utilize to perform the job associated with the physical asset from the identified piece of relevant data.2. The method of claim 1 , wherein assigning the technician to the job associated with the physical asset claim 1 , further comprises:identifying the physical asset associated with the job; andconfirming, by the technician, an identity associated with the identified physical asset.3. The method of claim 2 , further comprising:selecting, by the technician, a work order with an enterprise asset management tool to perform the job associated with the physical asset, wherein ...

METHODS AND APPARATUS TO ESTIMATE LARGE SCALE AUDIENCE DEDUPLICATION

An example apparatus includes an association controller to generate a tree structure association for a total audience size that accessed a plurality of media items, the tree structure association including a first node representative of a first media item accessed by first audience members of the total audience size and a second node representative of a second media item accessed by second audience members of the total audience size, a matrix generator to generate a matrix by selecting a sum of probabilities value corresponding to the tree structure association, the sum of probabilities value representative of a probability of the first audience members accessing the first media item and storing the sum of probabilities value in an element of the matrix, and a commercial solver to estimate a deduplicated audience size of the total audience size using the matrix. 1. An apparatus comprising:an association controller to generate a tree structure association for a total audience size that accessed a plurality of media items, the tree structure association including a first node representative of a first media item accessed by first audience members of the total audience size and a second node representative of a second media item accessed by second audience members of the total audience size; selecting a sum of probabilities value corresponding to the tree structure association, the sum of probabilities value representative of a probability of the first audience members accessing the first media item; and', 'storing the sum of probabilities value in an element of the matrix; and, 'a matrix generator to generate a matrix bya commercial solver to estimate a deduplicated audience size of the total audience size using the matrix.2. The apparatus of claim 1 , wherein the first node includes a first index value claim 1 , the second node includes a second index value claim 1 , and the element includes a third index value and a fourth index value.3. The apparatus of claim 2 , ...

CONFIGURABLE CONCISE DATASETS PLATFORM

A scalable configurable universal complete spectrum concise datasets platform is provided that utilizes measure points from sensor-observation-derived representations or concise datasets in the making of selected cyber determinations regarding or utilizing sensor observations or sensor observation subjects. The platform utilizes necessary resources and predetermined criteria in the making of selected cyber determinations, the platform utilizes measure points and personalized processes in the accurate or reliable locating of selected analytically rich aspects, characteristics or features from sensor-observation-derived representations, wherein appropriate informational representations are assigned to selected analytically rich aspects, characteristics, features, measure points or the sensor observation and stored in concise datasets where they may be utilized in real-time or thereafter in the making of selected cyber determinations regarding or utilizing sensor observations or sensor observation subjects. The platform is configurable for being utilized as a touchless user interface, a 100% accurate cyberspace identity test or a universal health metrics monitor. 1. A scalable configurable universal complete spectrum concise datasets platform of processes , procedures , methods , formulas , programming , sensors and computing devices , wherein said concise datasets platform selects , derives or utilizes data for or from concise datasets;wherein, said concise datasets are utilizable in the making of at least one selected cyber determination regarding or utilizing at least one sensor observation or at least one sensor observation subject, said concise datasets platform is comprised of:a set of resources that include (a) at least one computing device, (b) at least one sensor, (c) selected necessary programming, (d) selected information, (e) criteria selected from a spectrum of criteria that may be utilized by said platform, and (f) other necessary resources; wherein said ...

SYSTEM AND METHOD FOR GENERATING TRAINING SETS FOR NEURAL NETWORKS

A system and method for generating training sets for training neural networks. The method includes determining a segmentation based on a column from a columnar database table; generating a group-by query based on the segmentation; generating a plurality of reduced queries based on the group-by query; executing the group-by query on a table of a database to obtain a result table, wherein the result table includes a plurality of results, wherein each result corresponds to a respective reduced query of the plurality of reduced queries; and generating a plurality of training query pairs by pairing each reduced query with its corresponding reduced result. 1. A method for generating training sets for training neural networks , comprising:determining a segmentation based on a column from a columnar database table;generating a group-by query based on the segmentation;generating a plurality of reduced queries based on the group-by query;executing the group-by query on a table of a database to obtain a result table, wherein the result table includes a plurality of results, wherein each result corresponds to a respective reduced query of the plurality of reduced queries; andgenerating a plurality of training query pairs by pairing each reduced query with its corresponding reduced result.2. The method of claim 1 , wherein the segmentation is based on dimensions.3. The method of claim 1 , wherein the segmentation is based on measures.4. The method of claim 4 , further comprising:determining a distribution of values pertaining to the measures, wherein the segmentation is determined based on the distribution of values.5. The method of claim 1 , wherein generating the group-by query further comprises:generating at least one nested query within the group-by query.6. The method of claim 1 , further comprising:generating a plurality of training queries based on a set of queries generated by at least one user.7. The method of claim 6 , wherein generating each training query further ...

GLOBAL MATCHING SYSTEM

A global matching system can include a processing device and a memory device on which instructions can be stored. The processing device can execute the instructions to receive input data to be matched to target data stored in the memory device. The processing device can identify at least one context parameter for the input data. The context parameter indicate a location-specific characteristic or culturally specific characteristic of an entity associated with the input data. The processing device can access program code for matching tools and select a subset of the matching tools' program code based on the identified context parameter. The processing device can identify, based on the identified context parameter, an order of execution for the selected program code. The processing device can execute the selected program code in the identified order of execution and output a matching result for the input data and the target data. 1. A global matching system comprising:a match server including a communications network port for communicatively coupling to a telecommunications network and receiving input data from one or more client devices via the telecommunications network;a processing device communicatively coupled to the match server; and [ receive a first electronic signal including the input data from the match server to be matched to target data stored in data sources communicatively coupled to the match server, the data sources comprising non-transitory computer-readable media for storing target data comprising identifiers of entities and data describing transactions in which the entities have engaged;', 'extract at least one context parameter for the input data by transforming the input data into tokens and matching the tokens to a person classification or business classification, the at least one context parameter being indicative of a location-specific characteristic or culturally specific characteristic of an entity associated with the input data;', 'cause ...

SYSTEMS AND METHODS FOR IDENTIFYING A SEQUENCE OF EVENTS AND PARTICIPANTS FOR RECORD OBJECTS

Methods, systems, and storage media for identifying a sequence of events and participants for record objects are disclosed. Exemplary implementations may: access record objects of a system of record; identify a subset of record objects associated with a group entity and having a first record object status; identify one or more electronic activities linked to the record objects; determine an event-participant pattern based on the electronic activities linked to the record object; identify electronic activities linked with a second record object; determine that a first event is performed by the a participant type and a second event is not yet performed by a second participant type; generate a content item identifying an action to trigger a performance of the second event; and transmit the content item to a device of a participant of at least one electronic activity linked with the second record object. 1. A method , comprising:accessing, by one or more processors, a plurality of record objects of a system of record of a data source provider, each record object of the plurality of record objects corresponding to a respective group entity, each record object comprising one or more object field-value pairs and linked to one or more electronic activities;identifying, by the one or more processors, a subset of record objects of the plurality of record objects associated with a group entity and having a first record object status;identifying, by the one or more processors, for each record object of the subset of record objects, one or more electronic activities linked to the record object, each electronic activity identifying one or more participants and corresponding to at least one event;determining, by the one or more processors, for each record object of the subset of record objects, an event-participant pattern based on the electronic activities linked to the record object, the event-participant pattern including at least a first event performed by a first participant ...

Apparatus and method for detecting impact factor for an operating environment

An apparatus and method for detecting impact factors for an operating environment. The apparatus generates a detection result for each of the first factors of a plurality of first historical records by analyzing a dissimilarity degree of the plurality of first data corresponding to each first factor. Each detection result is a continuous data type or a discrete data type. The apparatus trains a data type recognition model according to the first historical records and the detection results. The apparatus establishes a basic prediction model by a training set of a plurality of second historical records, generates a comparison set by rearranging the second data corresponding to a specific factor in the training set, establishes a comparison prediction model by the comparison set, and determines a degree of importance of the specific factor by comparing the accuracies of the basic prediction model and the comparison prediction model.

METHODS AND DEVICES FOR QUANTIFYING TEXT SIMILARITY

Disclosed herein are computer-implemented methods; computer-implemented systems; and non-transitory, computer-readable media, for quantifying text similarity. One computer-implemented method includes obtaining a plurality of shortest operation paths including one or more edit pairs for correcting an optical correction recognition (OCR) text string with an edit text string, where each of the one or more edit pairs denotes an operation performable to a character of the OCR text string during correction by the edit text string. A plurality of similarity scores is determined, each corresponding to one of the plurality of shortest operation paths and determined by summing historical similarity scores of the one or more edit pairs of each of the plurality of shortest operation paths. A minimum one of the plurality of similarity scores is selected to quantify text similarity between the OCR text string and the edit text string. 1. A computer-implemented device for quantifying text similarity , comprising:at least one processor; and obtain a plurality of shortest operation paths for correcting an optical correction recognition (OCR) text string with an edit text string, wherein each of the plurality of shortest operation paths includes one or more edit pairs, each of the one or more edit pairs denoting an operation performable to a character of the OCR text string during correction by the edit text string,', retrieve the historical similarity scores of the one or more edit pairs from a history data library,', 'add the edit pairs in the shortest operation path having the minimum similarity score into the history data library,', 'calculate frequencies of edit pairs in the history data library corresponding to the edit pairs in the shortest operation path having the minimum similarity score, and', 'update the historical similarity scores for the edit pairs in the history data library, wherein when updating the historical similarity scores, the computer program code further ...

AUTOMATIC TUNING OF THRESHOLDS AND WEIGHTS FOR PAIR ANALYSIS IN A MASTER DATA MANAGEMENT SYSTEM

An approach for tuning a data management system is provided. A processor retrieves one or more samples pairs of record data. A processor determines an error rate regarding the performance of a matching operation of a data management system based on the one or more sample pairs. In response to the error rate being above a value, a processor adjusts at least one threshold value associated with the matching operation of the data management system. 1. A method for tuning a master data management (MDM) system , the method comprising:retrieving, by one or more processors, one or more sample pairs of record data;determining, by the one or more processors, an error rate regarding the performance of a matching operation of the MDM system based on the one or more sample pairs; andin response to the error rate being above a value, adjusting, by the one or more processors, at least one threshold value associated with the matching operation of the MDM system.2. The method of claim 1 , wherein the error rate is based on a false positive rate or a false negative rate of the matching operation of the MDM system.3. The method of claim 1 , wherein the adjusting the at least one threshold value associated with the matching operation of the MDM system further comprises:generating, by the one or more processors, a binary search tree, wherein each depth level of the binary search tree adjusts the at least one threshold value by a pre-determined interval; andadjusting, by the one or more processors, the at least one threshold value associated with the matching operation of the MDM system based on an identification of a node in the binary search tree which minimizes the error rate.4. The method of claim 1 , the method further comprising:identifying, by the one or more processors, one or more attribute weights associated the at least one threshold value;determining, by the one or more processors, an attribute distance range for the one or more attribute weights; anddetermining, by the one ...

SYSTEMS AND METHODS FOR RESTRICTING GENERATION AND DELIVERY OF INSIGHTS TO SECOND DATA SOURCE PROVIDERS

The present disclosure relates to restricting generation and delivery of insights to data source providers. Electronic activities and record objects may be accessed. Each record object may correspond to a record object type and have one or more object field-value pairs. Node profiles may be maintained. Updates to a node graph or corresponding to a record object may be detected. A number of data source providers having respective electronic activities or record objects from which the update to the node graph or corresponding to the record object can be determined. Provisioning of a content item to a second data source provider may be restricted. 1. A method comprising:accessing, by one or more processors, at least one of i) a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers or ii) a plurality of record objects of one or more systems of record associated with the one or more data source providers;maintaining, by the one or more processors, a plurality of node profiles, each node profile of the plurality of node profiles including one or more field-value pairs, each field-value pair including a value determined from data of one or more of the plurality of electronic activities or the plurality of record objects;detecting, by the one or more processors, from one or more electronic activities or record objects of a first data source provider of the one or more data source providers, an update to a node graph including the plurality of node profiles or corresponding to a record object of the first data source provider;determining, by the one or more processors, a number of the one or more data source providers having respective electronic activities or record objects from which the update to the node graph or corresponding to the record object of the first data source provider can be detected; andrestricting, by the one or more processors, responsive to determining that the number does not ...

WELL LOG CHANNEL MATCHING

A method may include calculating a first set of hash values for a set of well log channels, extracting a well log channel snippet from an unknown well log channel, calculating a second set of hash values for the well log channel snippet, identifying, for the unknown well log channel, a matching well log channel by searching the first set of hash values with the second set of hash values, and storing, for the unknown well log channel, a channel context corresponding to the matching well log channel 1. A method , comprising:calculating a first set of hash values for a set of well log channels;extracting a well log channel snippet from an unknown well log channel;calculating a second set of hash values for the well log channel snippet;identifying, for the unknown well log channel, a matching well log channel by searching the first set of hash values with the second set of hash values; andstoring, for the unknown well log channel, a channel context corresponding to the matching well log channel2. The method of claim 1 , further comprising:generating a spectrogram structure from a first well log channel of the set of well log channels;selecting, from the spectrogram structure, an anchor point;selecting, from the spectrogram structure and using the anchor point, a set of target points; andpairing the anchor point with the set of target points to obtain a set of anchor/target pairs,wherein a subset of the first set of hash values is calculated using the set of anchor/target pairs.3. The method of claim 2 ,wherein the anchor point comprises an anchor depth and an anchor frequency,wherein the set of target points comprises a target point comprising a target depth and a target frequency, andwherein the subset of the first set of hash values is calculated using the anchor frequency of the anchor point in the respective anchor/target pair, the target frequency of the target point in the respective anchor/target pair, and the difference between the anchor depth of the anchor ...

Using cross-matching between users and matching against reference data to facilitate content identification

Techniques for identifying video and/or audio content are presented. An identification management component (IMC) groups users determined to be at least potentially be watching the same content based on first content fingerprints associated with respective content viewed by the users on communication devices, and a defined matching criterion. IMC facilitates identifying the content associated with the group of users based on first content fingerprints associated with the group of users and first reference content fingerprints. IMC receives a second content fingerprint associated with a communication device of a user in the group, sends the second content fingerprint to a third-party identification component for comparison with second reference content fingerprints, and receives content identification information in response. IMC identifies the content for the group of users based on the content identification information and/or the content identification made based on the first content fingerprints associated with the group.

TEXT QUERY METHOD AND APPARATUS, DEVICE AND STORAGE MEDIUM

The present application discloses a text query method and apparatus, device and storage medium, and relates to the field of intelligent search technology. A specific implementation scheme includes: identifying intention information and feature information of a query text, where the intention information is used to indicate intention of the query text; according to the intention information, determining a query interface for querying the intention; and querying a query result matching the feature information in information corresponding to the intention through the query interface. The present application can improve query efficiency of text query. 1. A text query method , comprising:identifying intention information and feature information of a query text, wherein the intention information is used to indicate intention of the query text;according to the intention information, determining a query interface for querying the intention; andquerying a query result matching the feature information in information corresponding to the intention through the query interface.2. The method according to claim 1 , wherein the feature information comprises at least one of the following: entity information and time information.3. The method according to claim 2 , wherein the entity information is entity information of the query text identified through a language model; and/or claim 2 ,the time information comprises at least one of time point information and time period information; the time point information is analyzed from time description information; the time period information is analyzed from the time description information according to the time point information; and the time description information is time description information extracted from the query text.4. The method according to claim 3 , wherein the time point information is obtained in the following manner:normalizing the time description information to obtain time normalization information;querying a time ...

LINKING INDIVIDUAL DATASETS TO A DATABASE

The disclosed system links an individual dataset to a database. The system receives a target individual dataset associated with a target individual and identifies candidate individual datasets that are potentially related to the target individual dataset. The system identifies a related individual dataset that has data bits that match some data bits in the target individual dataset. The system then identifies a parent node that is a common parent node to both the target individual dataset and the related individual dataset. The system retrieves a data tree that the parent node belongs to with the data tree containing information describing inter-relationships among datasets in the data tree. A node in the data tree is identified to assign the target individual dataset based on strings of matched data bits and number of the matched strings between the target individual dataset and the datasets in the data tree. 1. A computer-implemented method for linking an individual dataset in a database , the computer-implemented method comprising:receiving a target individual dataset associated with a target individual;identifying a plurality of candidate individual datasets that are potentially related to the target individual dataset;identifying a related individual dataset from the plurality of candidate individual datasets, wherein the related individual dataset has data bits that match at least a portion of data bits in the target individual dataset;identify a parent node that is a common parent node for both the related individual dataset and the target individual dataset;retrieving a data tree that the parent node belongs to, the data tree describing inter-relationships among datasets in the data tree; andidentifying, based on strings of matched data bits and number of the strings of matched data bits between the target individual dataset and the datasets in the data tree, a position in the data tree to which the target individual dataset is assigned.2. The method of ...

SYSTEM AND METHOD FOR ASSOCIATING RELATED RECORDS TO COMMON ENTITIES ACROSS MULTIPLE LISTS

Computer implemented systems and methods are disclosed for associating records across lists, wherein the lists include a plurality of records and the plurality of records is associated with a respective entity. In accordance with some embodiments, the systems and methods further comprise grouping one or more records from a first list into a first group based on fields of the records in the first list, grouping one or more records from a second list into a second group based on fields of the records in the second list, pairing a record from the first group with a record from the second group, assessing each pair of records based on an evaluation of the respective pair according to fields of the pair, and associating records from the first group and records of the second group with an entity based on the assessment. 1. A system for associating records across a first list and a second list to a common entity , the system comprising: a set of instructions; and', 'a first list and a second list, wherein the first list and the second list both include a plurality of records, and wherein the plurality of records includes records that are associated with a respective entity and includes one or more fields;', 'one or more processors configured to execute the set of instructions that cause the one or more processors to:', 'obtain a sample of a plurality of pairs of records, wherein each pair of the plurality of pairs of records includes a record from the first list and a record from the second list;', 'label a subset of pairs of the sample of the plurality of pairs;', 'generate a statistical model based on the labeled pairs;', 'evaluate pairs of the plurality of pairs based on the statistical model, the evaluation based on any of field characteristics of one or more fields of the pairs of the plurality of pairs or field values of the one or more fields of the pairs of the plurality of pairs;', 'output, based on the statistical model, scores representing the likelihood that ...

USING CROSS-MATCHING BETWEEN USERS AND MATCHING AGAINST REFERENCE DATA TO FACILITATE CONTENT IDENTIFICATION

Techniques for identifying video and/or audio content are presented. An identification management component (IMC) groups users determined to be at least potentially be watching the same content based on first content fingerprints associated with respective content viewed by the users on communication devices, and a defined matching criterion. IMC facilitates identifying the content associated with the group of users based on first content fingerprints associated with the group of users and first reference content fingerprints. IMC receives a second content fingerprint associated with a communication device of a user in the group, sends the second content fingerprint to a third-party identification component for comparison with second reference content fingerprints, and receives content identification information in response. IMC identifies the content for the group of users based on the content identification information and/or the content identification made based on the first content fingerprints associated with the group. 1. (canceled)2. A method for identifying content , the method comprising:receiving, using a hardware processor, a first fingerprint associated with a first media content item and a second fingerprint associated with a second media content item;determining, using the hardware processor, that the first media content item is related to the second media content item by comparing a first group of characteristic components associated with the first fingerprint with a second group of characteristic components associated with the second fingerprint;identifying, using the hardware processor, the first media content based on the first content fingerprint, wherein a confidence value is associated with the identification; andin response to determining that the confidence value exceeds a predetermined threshold, identifying, using the hardware processor, the second media content based on the identification of the first media content.3. The method of claim 2 ...

SYSTEMS AND METHODS FOR MATCHING ELECTRONIC ACTIVITIES DIRECTLY TO RECORD OBJECTS OF SYSTEMS OF RECORD

The system described herein can automatically match, link, or otherwise associate electronic activities with one or more record objects. For an electronic activity that is eligible or qualifies to be matched with one or more record objects, the system can identify one or more set of rules or rule sets. Using the rule sets, the system can identify candidate record objects. The system can then rank the identified candidate record objects to select one or more record objects with which to associate the electronic activity. The system can then store an association between the electronic activity and the selected one or more record objects. 1. A method comprising:accessing, by one or more processors, a plurality of electronic activities transmitted or received via electronic accounts of one or more data source providers;accessing, by the one or more processors, a plurality of record objects of one or more systems of record, each record object of the plurality of record objects corresponding to a record object type and comprising one or more object fields having one or more object field values, the systems of record corresponding to the one or more data source providers;identifying, by the one or more processors, an electronic activity of the plurality of electronic activities to match to one or more record objects, the electronic activity of the plurality of electronic activities identifying participants including a sender of the electronic activity and one or more recipients of the electronic activity;determining, by the one or more processors, a data source provider associated with providing the one or more processors access to the electronic activity;identifying, by the one or more processors, a system of record corresponding to the determined data source provider, the system of record including a plurality of candidate record objects to which to match the electronic activity;determining, by the one or more processors, responsive to applying a first policy including ...

SYSTEM FOR DETECTING COMPLIANCE OF A CONTAINER

Systems, methods, and computer-readable storage media for determining compliance of a container with composite signatures are disclosed. The disclosed techniques utilize a first device (e.g., an edge device) to determine characteristics of a container, such as dimensions, weight, indicia, or a combination thereof. Information indicative of the characteristics is sent to a computing device that determines a composite signature (or parameters) of the container based on the information. The computing device compares the composite signature (or parameters) to one or more stored composite signatures to determine compliance of the composite signature (e.g., of the container) with the one or more stored composite signatures (or stored parameters). The computing device also controls a process of managing a release of the container based on the compliance or non-compliance. 1. A system for measuring characteristics of a container , the system comprising: a first sensor configured to generate weight data indicating a weight of a container;', 'a second sensor, a third sensor, or both configured to generate first image data of dimensions of the container;', 'a fourth sensor configured to generate second image data of a particular side of the container;', 'a processor coupled to the first sensor, the second sensor, the third sensor, and the fourth sensor and configured to determine dimension data based on the first image data; and', 'a network interface configured to transmit the weight data, the dimension data, and the second image data as container information to a computing device; and, 'an edge device comprising 'a second processor configured to determine whether the container complies with one or more stored composite signatures based on a composite signature generated based on the container information.', 'the computing device comprising2. The system of claim 1 , wherein the first sensor comprises a scale claim 1 , and wherein the fourth sensor comprises a high-definition ...

SYSTEM AND METHOD FOR RECONSTRUCTING REGRESSION TEST SCENARIOS USING POST-PRODUCTION EVENTS

The present invention provides for a system and a method for reconstructing regression test cases using post production events. The present invention provides for a test case reconstruction engine configured to extract post-production identifiable elements associated with a post-production event and pre-production identifiable elements associated with a pre-production event. The present invention provides for a system and a method for determining similarity between the pre-production event and the post-production event based on a comparison of one or more pre-production parent identifiable elements and one or more pre-production child identifiable elements of a subject identifiable element, with the post-production identifiable elements. The present invention provides for a system and a method for reconstructing a regression test case based on a comparison of functions of the extracted pre-production identifiable elements and the post-production identifiable elements after the determination of similarity between the pre-production event and the post-production event. 1) A system for reconstructing regression test cases using post production events , wherein the system comprises:a memory storing program instructions; [ 'determine similarity between the pre-production event and the post-production event based on a comparison of one or more pre-production parent identifiable elements and one or more pre-production child identifiable elements of a subject identifiable element, with the post-production identifiable elements, wherein the subject identifiable element is the pre-production identifiable element that does not match with a corresponding post-production identifiable element; and', 'extract post-production identifiable elements associated with a post-production event and pre-production identifiable elements associated with a pre-production event;'}, 'reconstruct a regression test case based on a comparison of functions of the extracted pre-production ...

System, method and computer program product for deriving commonalities among data entries

In accordance with embodiments, there are provided mechanisms and methods for deriving commonalities among data entries, These mechanisms and methods for deriving commonalities among data entries can identify characteristics that are known to be common to at least some data entries in addition to unknown characteristics that are common to data entries, The ability to identify common known and unknown characteristics among data entries may allow data entries to be grouped according to the identified common known and unknown characteristics.

DELAYED PROCESSING FOR ELECTRONIC DATA MESSAGES IN A DISTRIBUTED COMPUTER SYSTEM

A computer system is provided that includes a matching engine and a freezing process. The matching engine freezes one side of a two-sided data structure when an order is determined to matchable. The freezing process starts a timer based on the matching determination. Orders that are handled by the matching engine while the side is frozen are added to a queue. When the timer ends, the orders in the queue are processed against those orders that are now resting within the data structure. 1. A distributed computer system comprising:electronic memory configured to store a data structure that includes at least two different types of data transaction requests, wherein a first type of data transaction requests is contra-sided to a second type of data transaction requests;a transceiver configured to receive data transaction requests for processing by the distributed computer system; receive, via the transceiver, a first data transaction request that is of the first type of data transaction requests;', 'determine whether the first data transaction request is matchable against any other data transaction requests that are pending within the data structure and contra-sided to the first data transaction request;', lock the first type of transaction requests from processing against the data structure,', 'store the first data transaction request to a queue, and', 'initiate a timer for a time period; and, 'based on determination that the first data transaction request is matchable, 'as a result of expiration of the timer for the time period, unlock the first type of transaction requests to process against the data structure and process data transaction requests that are included in the queue against a current state of the data structure., 'a processing system that includes at least one hardware processor, the processing system configured to2. The distributed computer system of claim 1 , wherein the processing system is further configured to:execute a matching engine computer process ...

CREATING INDEX IN BLOCKCHAIN-TYPE LEDGER

A method and an apparatus for creating an index in a blockchain-type ledger, and a device are disclosed. According to solutions provided in implementations of the present specification, a service attribute of a data record written to a ledger and a storage location and a sequence number of the data record in the ledger are determined, a mapping relationship is established between the service attribute, the storage location, and the sequence number, and an inverted index with the service attribute as a primary key is created, facilitating subsequent query. 1. A computer-implemented method comprising:obtaining, by a centralized database server, a service attribute and a sequence number comprised in a data record, wherein the data record is stored in a blockchain-type ledger;determining location information of the data record in the blockchain-type ledger, wherein the location information comprises a block height of a data block comprising the data record, and an offset of the data record in the data block;establishing a mapping relationship between the service attribute, the location information, and the sequence number;based on the sequence number, sequentially writing the mapping relationship to an index that uses the service attribute as a primary key, whereineach data block other than an initial data block of the blockchain-type ledger comprises at least one data record and a hash value of the data block itself that is determined based on a hash value of a previous data block and a data record comprised in the data block itself, and wherein block heights of data blocks increase based on a sequence of block forming time.2. The computer-implemented method of claim 1 , wherein obtaining a service attribute and a sequence number comprises:responsive to receiving a data record sent by a user, obtaining the service attribute and the sequence number comprised in a specified identification filed in the data record; ordetermining a data record comprised in a data block in ...

METHOD AND SYSTEM FOR IDENTIFYING A PRODUCT

A method for the at least partially automated identification, in particular, for the invalidation, uniqueness check and/or authenticity check, of a product, at least one representation of the product being recorded in at least one detection step, the representation being compared in at least one test step with at least one reference representation of the product in an original state, a presence being checked of at least one feature of the product that has been added as compared to the original state. 114-. (canceled)15. A method for providing at least partially automated identification of a product , the method comprising:recording, in at least one detection step, a representation of the product;comparing, in at least one test step, the recorded representation with at least one reference representation of the product in an original state; andchecking a presence of at least one feature of the product that has been added as compared to the original state.16. The method of claim 15 , further comprising:performing at least one digital image analysis of at least one image of the product.17. The method of claim 16 , wherein the image analysis encompasses at least one visual character recognition.18. The method of claim 15 , further comprising:performing a data comparison with a database.19. The method of claim 15 , wherein the added feature includes a uniqueness feature.20. The method of claim 19 , wherein a user is prompted in at least one invalidation step to add the feature to the product.21. The method of claim 20 , wherein the added feature is recognized in at least one validation step.22. The method of claim 21 , wherein the added feature recognized in the validation step is assigned in at least one assignment step to at least one stored dataset of the product.23. The method of claim 22 , wherein at least one action is initiated due to the assignment.24. The method of claim 15 , wherein the added feature is situated on a surface of the product.25. The method of ...

MERGING MULTIPLE UNSYNCHRONIZED STREAMS OF RELATED EVENTS AND MULTI-TENANT SUPPORT

A method and system for handling asynchronous data streams in a multi-tenant system. The process includes receiving at least a first stream of data and a second stream of data by a rules engine, determining by pattern matching of the rules engine, whether data in the first stream or data in the second stream meet conditions of a rule defined by a tenant of the multi-tenant system, and implementing by the rules engine the rule including a set of actions to modify data from the second data stream, in response to the data in the first stream matching the conditions the rule. 1. A method for handling asynchronous event streams in a multi-tenant system , the method comprising:receiving at least a first stream of events and a second stream of events by a rules engine;determining by pattern matching of the rules engine, whether data in events of the first stream or data in events of the second stream meet conditions of a rule defined by a tenant of the multi-tenant system; andimplementing by the rules engine the rule including a set of actions to modify data from events of the second stream, in response to the data in the events of the first stream matching the conditions of the rule.2. The method of claim 1 , wherein the rules engine is implemented in a cluster node of a cluster computing environment.3. The method of claim 1 , further comprising:initiating, by a cluster configurator, a set of cluster nodes in a cluster computing environment; andassigning, by the cluster configurator, each cluster node in the set of cluster nodes to process at least a first topic of an event management platform for a first tenant of the multi-tenant system.4. The method of claim 3 , further comprisingconfiguring a payload router to route events from the event management platform to a respective cluster node in the set of cluster nodes according to a topic and tenant.5. The method of claim 1 , further comprising:notifying, by a cluster monitor, a payload router and a set of cluster nodes to ...

IDENTIFYING ANONYMIZED RESUME CORPUS DATA PERTAINING TO THE SAME INDIVIDUAL

Resume data identification implementations are described that identify anonymized resume corpus data pertaining to the same individual. In one implementation, identifying this data in the anonymized resume corpus involves segmenting the corpus into resume snippets and clustering the resume snippets into groups. Within each group the resume snippets potentially pertain to the same individual. In addition, one or more optional filtering operations can be performed to remove snippets from a group that are less likely to be associated with the same person. This filtering is especially useful when the resume corpus is large. 1. A system for identifying data in the anonymized resume corpus that pertains to the same individual , comprising: access an anonymized resume corpus,', 'segment the corpus into resume snippets, and', 'cluster the resume snippets into groups, wherein within each group the resume snippets potentially pertain to the same individual., 'an anonymized resume corpus data identifier comprising one or more computing devices, and an anonymized resume corpus data identification computer program having a plurality of sub-programs executable by said computing device or devices, wherein the sub-programs configure said computing device or devices to,'}2. The system of claim 1 , wherein the sub-program for segmenting the corpus into resume snippets comprises claim 1 , on a per-resume basis claim 1 , sub-programs for:extracting summary-level information from the resume;segmenting the resume into snippets; andassigning the extracted summary-level information to each snippet segmented from the resume.3. The system of claim 2 , wherein the summary-level information comprises at least one of:an entity that the individual who is the subject of the resume works for or is associated with; ora business location of the entity that the individual who is the subject of the resume works for or is associated with, wherein the business location comprises at least one of a city, ...

Shared Anonymized Databases of Telecommunications-Derived Behavioral Data

Telecommunications data may be summarized into mathematical statistics that may not correlate with conventional semantic attributes. Such statistics may be difficult to observe without access to the telecommunications data, and therefore may be much less susceptible to social engineering attacks or other privacy-related vulnerabilities. The mathematical statistics may represent first, second, or higher order behavior-related observations relating to subscribers physical movements, engagement of applications and web browsing on a mobile device, as well as usage and billing of a mobile device. The statistics may not correlate to semantic identifiers for subscribers, and therefore may be difficult to observe and therefore identify specific subscribers whose statistical summaries may be known.

Crowd sourcing for file recognition

Methods for identifying encrypted content in ones of a plurality of encrypted data files in a library of encrypted files without decrypting the data files utilize crowd sourcing for content identification. A method includes selecting, by a computer, content titles for presenting with ones of identifiers for the data files in a data structure. Each of the identifiers includes a hash of metadata for one of the data files and the content titles include a character string that identifies each file's content. The user selection data identifies the content titles that correspond to the data files. The computer determines which content titles satisfy a minimum confidence threshold for associating with one of the identifiers, based on a quality or quantity of the multiple independent clients supplying the user selection data. An apparatus for performing the method includes a memory holding instructions for performing steps of the method as summarized above.

HARDWARE IMPLEMENTATION OF A TOURNAMENT TREE SORT ALGORITHM USING AN EXTERNAL MEMORY

Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator having an external memory. The method includes receiving a plurality of key values by the hardware accelerator, assigning each of the plurality of key values a sequential key number as the plurality of key values are received and performing pairwise comparisons of each of the plurality of key values to identify a winning key and a losing key. The method also includes storing the losing key of each pairwise comparison in a first section of the external memory, wherein a location in the first section is based on the key number of the losing key and storing the winning key of each pairwise comparison in a second section of the external memory, wherein a location in the second section is based on the key number of the winning key. 1. A method for executing a tournament tree sort algorithm on a hardware accelerator that includes an external memory , the method comprising:receiving, at the hardware accelerator, a plurality of keys;sequentially assigning key numbers to the plurality of keys;performing pairwise comparisons of at least a subset of the plurality of keys to determine, a first set of losing keys and a first set of winning keys;storing each losing key in the first set of losing keys in a first section of the external memory;storing each winning key in the first set of winning keys in a second section of the external memory;performing pairwise comparisons of the winning keys to determine a second set of losing keys and a second set of winning keysstoring each losing key in the second set of losing keys in a third section of the external memory;storing each winning key in the second set of winning keys locally on the hardware accelerator;comparing a first locally-stored winning key and a second locally-stored winning key to determine a winner key; andemitting the winner key as an output of the tournament tree sort algorithm.2. The ...

INFORMATION COLLECTION SYSTEM, INFORMATION COLLECTION METHOD, AND RECORDING MEDIUM

An information collection system for efficiently collecting target information from an enormous amount of contents in a variety of formats is provided. The information collection system includes a learning unit and an extraction unit . The learning unit generates, by using learning data, a parser rule for extracting a target character string from data, the target character string being a character string including specific information. The extraction unit extracts the target character string from data by using the parser rule. 1. An information collection system comprising:a memory storing instructions; andone or more processors configured to execute the instructions to:generate, by using learning data, a parser rule for extracting a target character string from data, the target character string being a character string including specific information; andextract the target character string from data by using the parser rule.2. The information collection system according to claim 1 , whereinthe one or more processors are further configured to execute the instructions to:perform at least one of predetermined analysis and control, based on the extracted target character string in accordance with a processing rule.3. The information collection system according to claim 2 , whereinthe one or more processors are further configured to execute the instructions to:determine new learning data, based on the extracted target character string in accordance with the processing rule; andgenerate the parser rule by using the determined new learning data.4. The information collection system according to claim 3 , wherein claim 3 ,as the new learning data, the other data being designated in the extracted target character string is determined.5. The information collection system according to claim 1 , whereinthe one or more processors are further configured to execute the instructions to:save the generated parser rule in association with a service related to the learning data, andthe ...

SYSTEMS AND METHODS FOR DATA QUALITY MONITORING

Systems and methods for data quality monitoring are provided. Various embodiments include a data monitoring system that integrates into a data pipeline. The data monitoring system may receive a call from the data pipeline to analyze data inputs entering the data pipeline. The monitoring system can generate metadata describing the data inputs and compare the generated metadata with previously generated metadata to determine if the data inputs are historically consistent. The data monitoring system may return a consistency measure to the data pipeline. In further embodiments, the data monitoring system can generate metadata describing data outputs from the data pipeline and compare the output metadata to previously generated output metadata. In further embodiments, the data monitoring system may operate as a read only entity in a database. The monitoring system may monitor for changes in the database and determine when adverse changes occur in the database. 1. A method to facilitate data monitoring in a computing system , the method comprising:ingesting unprocessed data from one or more data input streams;generating metadata using the unprocessed data ingested from the one or more data input streams;computing, by utilizing the metadata, one or more expected data outputs from the unprocessed data;ingesting processed data from one or more data output streams, wherein the processed data includes one or more actual data outputs;determining that the one or more actual data outputs does not align with the one or more expected data outputs;generating an alert signifying that the one or more expected data outputs does not align with the one or more actual data outputs; andsending the alert to a client.2. The method of claim 1 , wherein generating the alert further comprises generating a visual error report claim 1 , wherein the visual error report highlights which of the one or more actual data outputs does not align with the one or more expected data outputs.3. The method of ...

USING CROSS-MATCHING BETWEEN USERS AND MATCHING AGAINST REFERENCE DATA TO FACILITATE CONTENT IDENTIFICATION

Techniques for identifying video and/or audio content are presented. An identification management component (IMC) groups users determined to be at least potentially be watching the same content based on first content fingerprints associated with respective content viewed by the users on communication devices, and a defined matching criterion. IMC facilitates identifying the content associated with the group of users based on first content fingerprints associated with the group of users and first reference content fingerprints. IMC receives a second content fingerprint associated with a communication device of a user in the group, sends the second content fingerprint to a third-party identification component for comparison with second reference content fingerprints, and receives content identification information in response. IMC identifies the content for the group of users based on the content identification information and/or the content identification made based on the first content fingerprints associated with the group. 1. A method for identifying content , the method comprising:receiving, using a hardware processor, a first fingerprint associated with a first media content item and a second fingerprint associated with a second media content item;determining, using the hardware processor, that the first media content item is related to the second media content item by determining that characteristic components of a characteristic type match between a first group of characteristic components associated with the first fingerprint and a second group of characteristic components associated with the second fingerprint; andidentifying, using the hardware processor, the second media content item based on an identification of the first media content item.2. The method of claim 1 , further comprising identifying the first media content item based on the first content fingerprint claim 1 , wherein a confidence value is associated with the identification and wherein the ...

Technique of comprehensively support autonomous json document object (ajd) cloud service

The present invention relates to autonomous tuning of a data grid of documents in a database. Herein are techniques for storage cells to autonomously maintain local indices and other optimization metadata and algorithms to accelerate selective access into a distributed collection of documents. In an embodiment, each storage cell persists a respective subset of documents. Each storage cell stores, in memory, respective index(s) that map each item to location(s), in one or more documents of the respective subset of documents, where the item occurs. One or more computers execute, based on at least a subset of the indices of the storage cells, a data access request from a database management system. In an embodiment, a cloud of JSON document services provides an easy-to-use, fully autonomous JSON document database that horizontally and elastically scales to deliver fast execution of document transactions and queries without needing tuning by a database administrator.

DATA LINKAGE ACROSS MULTIPLE PARTICIPANTS

An example operation may include one or more of determining, by a supply-chain node, a plurality of assets of a supply-chain node, and executing, by the supply-chain node, a smart contract to: assign aliases to the plurality of the assets; and match the plurality of the assets with a plurality of assets of a different supply-chain node based on the aliases. 1. A system , comprising:a processor; determine a plurality of assets of a supply-chain node; and', assign aliases to the plurality of the assets; and', 'match the plurality of the assets with a plurality of assets of a different supply-chain node based on the aliases., 'execute a smart contract to], 'a memory on which are stored machine readable instructions that when executed by the processor, cause the processor to2. The system of claim 1 , wherein the instructions further cause the processor to determine a key-value pair for each asset of the plurality of the assets.3. The system of claim 2 , wherein the instructions further cause the processor to generate the aliases for the plurality of the assets based on key-value pairs.4. The system of claim 1 , wherein the instructions further cause the processor to define at least one asset matching rule.5. The system of claim 4 , wherein the instructions further cause the processor to generate the aliases for the plurality of the assets comprising the at least one asset matching rule.6. The system of claim 1 , wherein the instructions further cause the processor to execute the smart contract to generate the aliases based on the plurality of the assets of the supply-chain node.7. The system of claim 1 , wherein the assets of the different supply-chain node have a value-pair assigned to each of the assets.8. A method claim 1 , comprising:determining, by a supply-chain node, a plurality of assets of a supply-chain node; and assign aliases to the plurality of the assets; and', 'match the plurality of the assets with a plurality of assets of a different supply-chain node ...

SPARSE DATA INDEX TABLE

A set of queries on a collection of data records is received. A set of subconditions required to support the set of queries is determined. An index table is maintained, wherein an entry in the index table indicates a subcondition status associated with a data record in the collection of data records. A specific query is received indicating a specified set of subcondition statuses. The specified set of subcondition statuses is matched against the index table. A result set is returned corresponding to matched rows in the index table, wherein the matched rows match the specified set of subcondition statuses. 1. A system , comprising:a processor; and determine a set of subconditions required to support one or more queries on a collection of data records;', 'maintain an index table, wherein an entry in the index table indicates a subcondition status associated with a data record in the collection of data records;', 'receive a specific query indicating a specified set of subcondition statuses;', 'match the specified set of subcondition statuses against the index table; and', 'return a result set corresponding to matched rows in the index table, wherein the matched rows match the specified set of subcondition statuses., 'a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions which when executed cause the processor to2. The system of claim 1 , wherein to maintain the index table comprises to maintain the index table with an index record per data record.3. The system of claim 1 , wherein the processor is further configured to update status fields in the index table as new data is received to reflect a status of affected subconditions.4. The system of claim 1 , wherein the subcondition status comprises a “don't care” state.5. The system of claim 4 , wherein a status type of the subcondition status is binary.6. The system of claim 4 , wherein a status type of the subcondition status is ternary.7. The system of claim 4 , ...

Makeup scheme recommendation method and device, cloud device, and electronic device

The makeup scheme recommendation method provided by embodiments of the present disclosure includes: acquiring makeup parameters of a user, the makeup parameters including at least one of an environment parameter, a body parameter, and a makeup time parameter; searching for a target makeup scheme matching the makeup parameters from a makeup scheme pool; optimizing the target makeup scheme in accordance with cosmetic information about the user, and generating a recommended makeup scheme, the cosmetic information being used to indicate cosmetics owned by the user; and providing the recommended makeup scheme to the user.

AGENT-BASED FILE REPOSITORY INDEXING AND FULL-TEXT FACETED SEARCH SYSTEM

A computer-implemented method includes retrieving a tenant identifier of a plurality of tenant identifiers identifying a set of users with authorized access to one or more data repositories of a plurality of data repositories. An indexing agent associated with the tenant identifier is configured based on indexing configuration information. The indexing configuration information includes at least an identifier of the one or more data repositories, location information for accessing the repositories, and one or more file patterns. Indexed data associated with the tenant identifier is retrieved from an indexing server executing the indexing agent. The indexed data includes text data obtained by the indexing agent during indexing using at least one data file associated with the one or more file patterns and stored in the one or more data repositories, and a cryptographic hash of the at least one data file. 1. A computer-implemented method , the method comprising:retrieving a tenant identifier of a plurality of tenant identifiers, each of the plurality of tenant identifiers identifying a set of users with authorized access to one or more data repositories of a plurality of data repositories;configuring an indexing agent associated with the tenant identifier based on indexing configuration information, the indexing configuration information including at least an identifier of the one or more data repositories, location information for accessing the one or more data repositories, and one or more file patterns;retrieving indexed data associated with the tenant identifier from an indexing server executing the indexing agent, the indexed data including text data obtained by the indexing agent during indexing using at least one data file associated with the one or more file patterns and stored in the one or more data repositories, and a cryptographic hash of the at least one data file;in response to validating a received search query is associated with a user of the set of ...

Fast identification of complex strings in a data stream

A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture having a processor-readable storage medium having instructions stored thereon for execution by a processor, causing the processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

SYSTEMS AND METHODS FOR UPDATING EMAIL ADDRESSES BASED ON EMAIL GENERATION PATTERNS

The present disclosure relates to systems and methods for updating email addresses based on email generation patterns. The method includes accessing a plurality of electronic activities used to update a plurality of member node profiles. The method includes determining that the plurality of member node profiles is linked to a group node profile of a group entity. The methods includes identifying, for each of the plurality of member node profiles, a first field-value pair of the member node profile corresponding to an email address. The method includes determining, for each member node profile, a correlation between the email address, a second field-value pair corresponding to a first name and a third field-value pair corresponding to a last name. The method includes determining, based on the determined correlation, an electronic account identifier pattern. The method includes storing an association between the group node and the electronic account identifier pattern. 1. A method comprising:maintaining, by one or more processors, a plurality of member node profiles corresponding to a plurality of unique member entities, each member node profile including a plurality of field-value pairs;accessing, by the one or more processors, a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers, the plurality of electronic activities used to update the plurality of member node profiles;determining, by the one or more processors, for a group entity, a plurality of member node profiles linked to a group node profile of the group entity;identifying, by the one or more processors, for each member node profile of the plurality of member node profiles, a first field-value pair of the member node profile corresponding to an electronic account identifier of the member node profile, the electronic account identifier identifying an address via which electronic activities are transmitted from or received by the ...

EXTRACTION OF PROTOTYPICAL TRAJECTORIES FOR AUTOMATIC CLASSIFICATION OF NETWORK KPI PREDICTIONS

In one embodiment, a service divides one or more time series for a network key performance (KPI) into a plurality of time series chunks. The service clusters the plurality of time series chunks into a plurality of clusters. The service identifies a sketch that represents a particular one of the clusters. The service associates a label with the identified sketch. The service applies the label to a new KPI time series by matching the sketch to the new KPI time series. 1. A method comprising:dividing, by a service, one or more time series for a network key performance (KPI) into a plurality of time series chunks;clustering, by the service, the plurality of time series chunks into a plurality of clusters;identifying, by the service, a sketch that represents a particular one of the clusters;associating, by the service, a label with the identified sketch; andapplying, by the service, the label to a new KPI time series by matching the sketch to the new KPI time series.2. The method as in claim 1 , wherein the label is indicative of an action to be taken automatically in the network.3. The method as in claim 2 , further comprising:forecasting, by the service, the new KPI time series using a machine learning model.4. The method as in claim 1 , further comprising:quantizing, by the service, the time series chunks, prior to clustering the plurality of time series chunks into the plurality of clusters.5. The method as in claim 1 , wherein associating the label with the identified sketch comprises:presenting the sketch to a user interface; andreceiving the label via the user interface.6. The method as in claim 1 , wherein identifying the sketch that represents the particular cluster comprises:computing the sketch as an aggregate of the time series chunks in the particular cluster.7. The method as in claim 1 , wherein identifying the sketch that represents the particular cluster comprises:selecting one of the time series chunks in the particular cluster as the sketch, based on a ...

METHOD AND SYSTEM FOR HIGH PERFORMANCE DATA MATCHING AND MATCH SET GROUPING

In one aspect, a computer-implemented method for partitioning records in a data set, wherein each record has one or more data elements includes comparing the records to identify pairs of matching records in the data set, wherein records within each pair of matching records are representative of a common entity. Each matching record is assigned to a unique partition wherein said unique partition contains all matching records and does not overlap with any other partition. Each record is updated with a partition identifier representative of said unique partition. In another aspect, a computer-based information handling system for resolving and partitioning matching records in a data set is provided. 1. A computer-implemented method for partitioning records in a data set , each record having one or more data elements , the method comprising:comparing the records to identify pairs of matching records in the data set, wherein records within each pair of matching records are representative of a common entity;assigning each matching record to a unique partition wherein said unique partition contains all matching records and does not overlap with any other partition; andupdating each record with a partition identifier representative of said unique partition.2. The method of claim 1 , further comprising:for each of said pairs of matching records, storing a match record comprising a record identifier associated with each record in the pair of matching records.3. The method of claim 2 , wherein said step of assigning each matching record to a unique partition comprises claim 2 , for each match record claim 2 , the steps of:(a) determining whether a first one of the record identifiers in the match record represents a record that has previously been assigned to a partition;(b) if the first one of the record identifiers in the match record does not represent a record that has previously been assigned to a partition, determining whether a second one of the record identifiers in the ...

DEFINING ATTRIBUTE FEATURE VECTORS FOR MATCHING DATA ENTITIES

Matching records in an entity resolution system by defining entity attribute feature vectors, determining an entity attribute matching score according to a distance between two entity attribute feature vectors, assigning a statistical weight to an entity attribute matching score, adjusting the entity attribute matching score according to the statistical weight and an entity attribute frequency of occurrence, and determining an aggregate entity attribute matching score. 1. A computer implemented method for matching records in an entity resolution system , the method comprising:defining, by one or more computer processors, entity attribute feature vectors;determining, by the one or more computer processors, an entity attribute matching score according to a distance between two of the entity attribute feature vectors;assigning, by the one or more computer processors, a statistical weight to the entity attribute matching score;adjusting, by the one or more computer processors, the entity attribute matching score according to the statistical weight and an entity attribute frequency of occurrence; anddetermining, by the one or more computer processors, an aggregate entity attribute matching score based, at least in part, on the entity attribute matching score and at least one additional entity attribute matching score.2. The computer implemented method according to claim 1 , wherein determining an entity attribute matching score according to a distance between two entity attribute feature vectors comprises determining a probability of matching according to the two entity attribute feature vectors.3. The computer implemented method according to claim 1 , wherein determining an entity attribute matching score according to a distance between two entity attribute feature vectors comprises mapping a probability of matching according to the two entity attribute feature vectors to a distance.4. The computer implemented method according to claim 1 , wherein assigning a ...

DATA RESOLUTION AMONG DISPARATE DATA SOURCES

Cross-matching of match indexes assigned to respective data sources can be performed. Each match index can store at least a portion of data from a subset of data records in the data source to which the match index is assigned. Such data can be stored in the match index as match index records. Responsive to identifying matches between match records of different match indexes, the data records in the data sources to which the match records correspond can be updated to add links between the respective data records. 1. A method , comprising:maintaining a data source registry with which a first data source and at least a second data source are registered, the first data source being assigned a first match index and the second data source being assigned a second match index, wherein at least a portion of data fields from a subset of data records stored in the first data source are stored in the first match index as first match index records and at least a portion of data fields from a subset of data records stored in the second data source are stored in the second match index as second match index records;identifying registration of a third data source with the data source registry, the third data source being assigned a third match index, wherein at least a portion of data fields from a subset of data records stored in the third data source are stored in the third match index as third match index records;responsive to identifying the registration of the third data source with the data source registry, performing a cross-match of the third data source to the first data source and to the second data source, performing, using a processor, the cross-match comprising comparing the third match index records to the first match index records and comparing the third match index records to the second match index records; andresponsive to identifying a match between a first of the third match index records and a first of the first match index records, identifying a first data ...

SYSTEMS AND METHODS FOR DETERMINING DATASET INTERSECTION

A method of determining an indication of an intersection between a first dataset and a second dataset, the first and second datasets each holding entries in association with at least one key, the method comprising: generating for the at least one key in the first dataset location information in a first binary structure by applying a deterministic function to the entries associated with the key; transmitting the first binary structure to a comparison stage; generating for the at least one key in the second dataset, location information in a second binary structure by applying the same deterministic function to the entries associated with the key; and comparing, at the comparison stage, the location information in the first and second binary structures to determine the indication of the intersection between the first dataset and second dataset. 1. A method of determining an indication of an intersection between a first dataset and a second dataset , the first and second datasets each holding entries in association with at least one key , the method comprising:generating for the at least one key in the first dataset location information in a first binary structure by applying a deterministic function to the entries associated with the key;transmitting the first binary structure to a comparison stage;generating for the at least one key in the second dataset, location information in a second binary structure by applying the same deterministic function to the entries associated with the key; andcomparing, at the comparison stage, the location information in the first and second binary structures to determine the indication of the intersection between the first dataset and second dataset.2. The method of claim 1 , wherein said comparing further comprises determining an indication of a duplication level of entries in the first and second datasets.3. The method of claim 2 , further comprising determining a relationship between the intersection and the duplication level.4. ...

SYSTEMS AND METHODS FOR GENERATING NODE PROFILES USING ELECTRONIC ACTIVITY INFORMATION

The present disclosure relates to systems and methods for generating new node profiles using information from electronic activities. The system is configured to maintain node profiles corresponding to unique entities; access electronic activities transmitted or received via electronic accounts associated with data source providers; identify a first email address of a sender and second email addresses of respective recipients of an electronic activity; identify that the first email address matches a value of a field of a first node profile; link the electronic activity to the first node profile; determine that a second email address of a respective recipient of the electronic activity cannot be matched to any node profile associated with the respective participant; and generate, responsive to determining that the electronic activity cannot be matched to any node profile of the plurality of node profiles, a new node profile including the second email address of the respective recipient. 1. A method comprising:maintaining, by one or more processors, a plurality of node profiles corresponding to a plurality of unique entities, each node profile including a plurality of fields, each field of the plurality of fields including one or more value data structures, each value data structure of the one or more value data structures including a value and one or more entries corresponding to respective one or more data points that include the value of the value data structure;accessing, by the one or more processors, a plurality of electronic activities transmitted or received via electronic accounts associated with one or more data source providers, the one or more processors configured to update the plurality of node profiles using the plurality of electronic activities;identifying, by the one or more processors, a first email address of a sender and one or more second email addresses of respective recipients of an electronic activity of the plurality of electronic activities; ...

APPROXIMATE MATCHING

A first set of subconditions is obtained. Approximate matching of the first set of subconditions against a plurality of sets of subconditions is performed. A second set of subconditions among the plurality of sets of subconditions is accessed, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of “don't care”. The first set of subconditions is approximately matched against the second set of subconditions. The first set of subconditions is compared against the second set of subconditions. A matching criterion is determined to be met based on a result of the matching. Information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions is output. 1. A method , comprising:obtaining a first set of subconditions; ["accessing a second set of subconditions among the plurality of sets of subconditions, wherein a representation of a subcondition in the first set and/or the second set of subconditions comprises a value having one of a plurality of states, and wherein the plurality of states comprises a state of “don't care”; and", comparing the first set of subconditions against the second set of subconditions; and', 'determining that a matching criterion is met based on a result of the matching; and, 'approximately matching the first set of subconditions against the second set of subconditions, comprising, 'outputting information indicating that the second set of subconditions is at least an approximate match for the first set of subconditions., 'performing approximate matching of the first set of subconditions against a plurality of sets of subconditions, comprising2. The method of claim 1 , wherein the first set of subconditions comprises subconditions to be matched.3. The method of claim 1 , wherein the second set of subconditions comprises a rule ...