20th week of 2022 patent applcation highlights part 52 |
Patent application number | Title | Published |
20220156237 | SYSTEMS AND METHODS FOR DATABASE QUERY EFFICIENCY IMPROVEMENT - Methods and systems for database query efficiency improvement are disclosed. In one embodiment, a method includes mirroring a primary database to a secondary database; creating a testing database comprising the schema; receiving a query; running the query on the testing database; and evaluating the query by: identifying predicates in the query; determining most common values for each column name by querying the secondary database; creating, for each column name, a list comprising at least one of the most common values; creating a test predicate comprising one of the column names and an entry for the list corresponding to the column name; creating a test query comprising one or more test predicates; determining a resource utilization of the query by running each of the test queries on the secondary database; and providing, to a user interface for display, an efficiency improvement recommendation when the resource utilization exceeds a threshold. | 2022-05-19 |
20220156238 | CONTINUOUS DATA PROTECTION USING RETROACTIVE BACKUP SNAPSHOTS - Embodiments of the present invention include generating, at a first time, a first copy of a database including multiple tables, the first copy including a set of first structured text files. During a time period subsequent to the first time, queries that request updates to the tables during the time period are periodically generated and conveyed to a system managing the database. Responsively to the periodic queries, any updates to the tables and their respective update times are received and stored to a journal including one or more second structured text files. At a subsequent time, a request to generate a second copy of the database is received, the second copy including a state of the database at a specified time during the time period. The first copy of the database is updated with the updates whose update times are prior to the specified time, thereby generating the second copy. | 2022-05-19 |
20220156239 | CUSTOM TAG DEFINITION AND TRANSLATION IN A DATABASE - A method includes generating a table in a relational database, the table comprising an empty column reserved for a custom tag. The column has a default column name. The method also includes, in response to an instruction to create the custom tag, generating a column mapping that maps a name of the custom tag to the column name. The column mapping is stored outside the relational database and is used by a parser to translate between the name of the custom tag and the column name. | 2022-05-19 |
20220156240 | HIERARCHICAL SCRIPT DATABASE AND DATABASE APPLICATIONS - A tree database includes nodes organized as one or more tree data structures. The nodes contain both function and data properties in the form of script files in an interpreter environment. The database is event-driven. Responsive to an event, a node can spawn a new child node in the tree, which contains a data item associated with the event, enabling the tree database to grow as events and data arrive. Query events, initialization, and purging are also supported. Example applications of a communication appliance, an educational quiz, and a music database are provided. | 2022-05-19 |
20220156241 | Multi-Dimensional Data Tagging and Reuse - Aspects of the disclosure relate to multi-dimensional data tagging and reuse. A computing platform may receive first response data associated with responses to a first set of queries. Subsequently, the computing platform may apply data tags to the first response data, which may include tagging the first response data based on multiple dimensions. Then, the computing platform may prompt a user of a computing device from which the data originated to validate the data tags applied to the first response data. Next, the computing platform may analyze a second set of queries which may be associated with the same content type. Thereafter, the computing platform may generate second response data associated with responses to the second set of queries based on the data tags applied to the first response data and send the second response data in response to the second set of queries. | 2022-05-19 |
20220156242 | METHOD AND SYSTEM FOR AUTOMATICALLY TAGGING DATA - Systems and methods relate to auto-tagging of data in a data lake or a data storage. Generating a statistical summary of the data lake and interactively receiving data in a selected column of an exemplar data addresses an issue of efficiently and accurately auto-tagging data in a data lake. The present disclosure automatically generates a statistical summary of the data lake using a lightweight off-line processing. A graphical user interface interactively receives an exemplar data file with a selection of a column in the exemplar data file. A list of candidate data-tagging patterns is generated based on the statistical summary and updates the list by removing candidate data-tagging patterns that under-generalize the data. The present disclosure determines a data-tagging pattern by selecting a candidate data-tagging profile from the list based on having the least number of matching columns in the data lake. | 2022-05-19 |
20220156243 | METHOD, DEVICE, AND COMPUTER PROGRAM PRODUCT FOR MANAGING STORAGE SYSTEM - Management of a storage system is enabled. In an example, a partition index associated with the partition is obtained, the partition index comprising a group of nodes, a node in the group of nodes indicating metadata of an object in the group of objects. A valid node in the partition index is identified, the valid node indicating valid metadata of an object associated with the valid node in the storage system. A local index for the partition index is generated based on the valid node. In response to receiving an access request for a target object in the group of objects, the target object in the storage system is accessed based on the local index. With the foregoing example implementations, metadata in the storage system may be accessed more efficiently, and the overall response speed of the storage system may be increased. | 2022-05-19 |
20220156244 | DETERMINING TIMESTAMPS TO BE ASSOCIATED WITH EVENTS IN MACHINE DATA - Methods and apparatus are disclosed to automatically timestamp events within streaming machine data. The streaming machine data is broken into a set of events using breaking rules. Each event can be analyzed by iterating over own time stamp format patterns from a list of known time stamp format patterns to determine whether a matching pattern exists in the event. When an individual event broken out from the streaming machine data includes time information according to at least one known time stamp format pattern of the list of known time stamp format patterns, a timestamp can be created for the event by extracting a time value from event ng the matching pattern determined to exist in the event. | 2022-05-19 |
20220156245 | SYSTEM AND METHOD FOR MANAGING CUSTOM FIELDS - A method may include obtaining a table including a table schema including definitions of native fields, adding a value of a custom field to the table by inserting, in a native field, a native field value including (i) an identifier (ID) of the custom field and (ii) the value of the custom field, and storing a definition of the custom field in a custom field registry external to the table. The custom field may be undefined by the table schema. The method may further include receiving a request to perform an operation on the table, generating, from the request, a query on a subset of the native fields and the custom field, executing the query to obtain query results, and transmitting, in response to the request, the query results. | 2022-05-19 |
20220156246 | TRACKING CHANGE DATA CAPTURE LOG HISTORY - A method includes obtaining a first snapshot of a source system and deriving a set of key-value pairs reflecting the first snapshot. A mirror operation of the source system is performed to obtain CDC change operations. The method obtains a first CDC log as a first sequence of key-value pairs. A second snapshot of the source system is obtained and a set of key-value pairs is derived, which reflects the second snapshot. The first sequence of key-value pairs is compared with the set of key-value pairs to derive corrective CDC operations, captured as a set of key-value pairs. The corrective CDC operations represent corrections to be performed with respect to the first sequence of key-value pairs. A second CDC log is obtained as a second sequence of key-value pairs. The corrective CDC operations ensure that the second sequence of key-value pairs are coherent with the set of key-value pairs. | 2022-05-19 |
20220156247 | EVENT RECORDS IN A LOG FILE - Examples of analyzing a log file are described. In an example, a log file comprising a plurality of event records is obtained from a computing device. The event records in the plurality of log files may be processed. Thereafter, an occurrence of anomaly in the log file may be ascertained. | 2022-05-19 |
20220156248 | METHOD AND APPARATUS FOR CONSISTENT PAGE SPLIT OPERATION IN A MULTI-MASTER DATABASE - Methods and apparatus are described for splitting a page (or node) in an index tree database index for a multi-master database. The methods include creating a first split page of a first page. The first page belongs to a first set of pages and comprises a hinge page. The hinge page also belongs to a second set of pages. Updating the first set of pages may cause the hinge page itself to split, creating a split of the hinge page. The second set of pages is updated in response to creating the split of the hinge page. Described are techniques whereby the updates to the first and second sets of pages are atomic, that is, they all succeed or they all fail, which may realize any of several benefits. | 2022-05-19 |
20220156249 | CORRELATING DIFFERENT TYPES OF DATA OF A DISTRIBUTED LEDGER SYSTEM - Systems and methods are described to correlate different types of data obtained from a distributed ledger system. The distributed ledger system can generate transaction notifications, log data, and/or metrics data. At least some of the data generated by the distributed ledger system can be obtained by a data intake and query system via a distributed ledger system monitor. The data from the distributed ledger system can be stored in the data intake and query system and correlated. Based on the correlation, the data intake and query system can determine a history of a transaction in the distributed ledger system, relationships between components of the distributed ledger system, and/or an architecture of the distributed ledger system. | 2022-05-19 |
20220156250 | RESTRICTED VIEWS TO CONTROL INFORMATION ACCESS IN A DATABASE SYSTEM - A restricted view definition is received by a database system. The restricted view definition defines a view over a database table with one or more restrictions on use of the view. The view over the database table is generated based on the restricted view definition. A query directed at the view is received by the database system. The database system determines whether the query directed at the view is permitted based on the one or more restrictions on the use of the view. | 2022-05-19 |
20220156251 | TENANT SPECIFIC AND GLOBAL PRETAGGING FOR NATURAL LANGUAGE QUERIES - A database system may receive a natural language query that is associated with a tenant of a multi-tenant system. The natural language query may be parsed into a set of tokens, and the set of tokens may be tagged, using a tenant specific tagging model associated with the tenant, the set of tokens with at least one pre-configured data type identifier that is configured for the plurality of tenants. A global tagging model that supports the plurality of tenants of the multi-tenant system may tag the set of tokens with at least one category identifier. The global tagging model may use the natural language query and the pre-configured data type identifier to identify the at least one category identifier. The system may execute a database query on a database associated with the tenant using the at least one pre-configured data type identifier and the at least one category identifier. | 2022-05-19 |
20220156252 | SYSTEM AND METHOD FOR DATA COLLECTION TO VALIDATE LOCATION DATA - A data collection system that provides the means to collect, store and make data available for a location analytics inference pipeline. The system incorporates a feedback mechanism enabling algorithms produced from the inference pipeline to drive the collection strategy to yield higher data quality and to produce reference data for model validation. | 2022-05-19 |
20220156253 | COMPACT DISPLAY OF MATCHING RESULTS - Provided is a system and method which provides visually-compacted search results with attribute information embedded therein. In one example, the method may include receiving, via a user interface, a search request based on a set of attributes, identifying search results that match the search request based on attributes of the search results with respect to the set of attributes, and displaying, via the user interface, a plurality of circular objects corresponding to the plurality of search results, respectively, each circular object comprising a round-shaped outer bar arranged around an outer boundary of the circular object which includes attribute information of a search result corresponding to the circular object embedded therein. | 2022-05-19 |
20220156254 | FEATURE ENGINEERING SYSTEM - A system for generating machine learning feature vectors or examples is disclosed herein. The system comprises at least one database configured to store data indicative of events associated with a plurality of entities, an application programming interface (API) server configured to receive a user query from at least one user device, and at least one computing node in communication with the API server and the at least one database. The at least one computing node is configured at least to receive, from the API server and at a first time, a first indication of the user query. The at least one computing node is configured to generate, based at least on the data indicative of events and the first indication of the user query, results associated with the user query, wherein the results comprise one or more feature vectors or examples for use with a machine learning algorithm. The at least one computing node is configured to cause storage of data indicative of the results in the at least one database. | 2022-05-19 |
20220156255 | SYSTEM AND METHOD FOR SUBSET SEARCHING AND ASSOCIATED SEARCH OPERATORS - Embodiments as disclosed may provide a search operator that addresses the problem of query construction for finding objects that include some number (N) of a set of terms (M). Moreover, embodiments as disclosed herein may efficiently implement the searches specified by such subset operators using a subset process that combines results from a set of term processes where only one term process may be needed for each search term (or search term variant). | 2022-05-19 |
20220156256 | TECHNIQUES FOR GENERATING A BOOLEAN SWITCH INTERFACE FOR LOGICAL SEARCH QUERIES - A computing system may receive a first user input providing an indication for a search of stored data. The system may generate a list of search criteria in a first graphical user interface. The system may receive a first selection of one or more search criteria from the list of search criteria. The system may generate a selected search criteria interface in a second graphical user interface comprising a graphical Boolean switch between each of adjoining search criteria. The system may receive a second user input for setting the graphical Boolean switch. The system may generate a first logical expression for a search based at least in part on the selected search criteria and positions of a plurality of graphical Boolean switches between the selected search criteria. The system may generate a search result of the stored data based at least in part on the first logical expression. | 2022-05-19 |
20220156257 | AUTOMATICALLY EXPANDING SEGMENTS OF USER EMBEDDINGS USING MULTIPLE USER EMBEDDING REPRESENTATION TYPES - The present disclosure relates to systems, non-transitory computer-readable media, and methods for expanding user segments automatically utilizing user embedding representations generated by a trained neural network. For example, a user embeddings system expands a segment of users by identifying holistically similar users from uniform user embeddings that encode behavior and/or realized traits of the users. Further, the user embeddings system facilitates the expansion of user segments in a particular direction and focus to improve the accuracy of user segments. | 2022-05-19 |
20220156258 | TREE STRUCTURE DATA PROCESSING SYSTEM, TREE STRUCTURE DATA PROCESSING METHOD, TREE STRUCTURE DATA PROCESSING DEVICE, AND TREE STRUCTURE DATA PROCESSING PROGRAM - [Problem] In reconfiguration of a tree structure in a relational database, to reduce a service response-disabled time by an update lock, and to maintain data retrieving and reading performance without deterioration. | 2022-05-19 |
20220156259 | DYNAMICALLY RESIZABLE STRUCTURES FOR APPROXIMATE MEMBERSHIP QUERIES - A method for efficiently supporting deletion in a probabilistic data structure, and related computing or storage system are described. A processor, computing system or storage system constructs a table and a summary table for determining whether there is an entry for a value in the table. The summary table has buckets pointed to by address fields of values. Each bucket has a prefix table, a transit table, signature table and a first indicator. The system tracks deletion and addition of items of the table and summary table through the first indicators. | 2022-05-19 |
20220156260 | Columnar Techniques for Big Metadata Management - A method for managing big metadata using columnar techniques includes receiving a query request requesting data blocks from a data table that match query parameters. The data table is associated with system tables that each includes metadata for a corresponding data block of the data table. The method includes generating, based on the query request, a system query to return a subset of rows that correspond to the data blocks that match the query parameters. The method further includes generating, based on the query request and the system query, a final query to return a subset of data blocks from the data table corresponding to the subset of rows. The method also includes determining whether any of the data blocks in the subset of data blocks match the query parameters, and returning the matching data blocks when one or more data blocks match the query parameters. | 2022-05-19 |
20220156261 | INFORMATION PROCESSING APPARATUS, ANALYSIS SYSTEM, DATA AGGREGATION METHOD, AND COMPUTER READABLE MEDIUM - An information processing apparatus ( | 2022-05-19 |
20220156262 | ENAHANCED DATA INDEXING AND SEARCHING - Methods, systems, and apparatus, including computer-readable media, for authentication enhanced data indexing and searching. In some implementations, a search service is configured to receive and process queries from a plurality of different application servers, where each application server has an associated data repository. The search service receives a query associated with a user of a client device. The search service provides the query to a search backend having a search index for the plurality of application servers, where the search index describes contents of each of the respective data repositories of the application servers. Search results are received from the search backend, including search results representing data elements from different data repositories of the different application servers. At least some of the search results are provided as an output of the search service as a response to the query. | 2022-05-19 |
20220156263 | QUERY INTAKE FOR LEGACY DATABASES - A query syntax analysis and postprocessing system and method receives a query request specifying values of a data type directed to a database without native support for the queried data type. A query engine or process for receiving a query request defined by a query syntax traverses the query request for a specification of an unsupported value or expression. In a large, distributed database environment, the query request may implicate multiple physical data stores, each having specific formats and recognized syntax. Values of unsupported or non-native types, or expressions that evaluate to an unsupported or non-native type, are identified and replaced with an expression that is recognized by the legacy database. | 2022-05-19 |
20220156264 | PRUNING USING PREFIX INDEXING - A table organized into a set of batch units is accessed. A set of N-grams are generated for a data value in the source table. The set of N-grams include a first N-gram of a first length and a second N-gram of a second length where the first N-gram corresponds to a prefix of the second N-gram. A set of fingerprints are generated for the data value based on the set of N-grams. The set of fingerprints include a first fingerprint generated based on the first N-gram and a second fingerprint generated based on the second N-gram and the first fingerprint. A pruning index that indexes distinct values in each column of the source table is generated based on the set of fingerprints and stored in a database with an association with the source table. | 2022-05-19 |
20220156265 | DIGITAL CONTENT DATA GENERATION SYSTEMS AND METHODS - A system includes hardware processors and a non-transitory memory storing instructions that, when executed by the hardware processors, causes the hardware processors to perform actions including receiving an input data set related to digital content, where the input data set includes a plurality of input entries. The actions also include matching one or more input words of each input entry of the plurality of input entries to one or more baseline words of one or more baseline entries of a baseline data set and generating an output data set including a plurality of output entries. Each respective input entry corresponds to a respective output entry of the plurality of output entries, and each respective output entry includes a baseline entry of the one or more baseline entries having a highest probability of matching the respective input entry and additional data associated with the respective input entry. | 2022-05-19 |
20220156266 | World Knowledge Triggers - Methods, systems, and apparatus, for associating actions with events that are determined independent of the action type of the action. A system receives, from a user device, identification of an action to be taken, the action being one of a plurality of action types, and an identification of a first event that is determined independent of the action type and for which the occurrence of the first event may be determined by the system. They system associates the action and the first event with instructions for determining if the first event has occurred, and then determines whether the first event has occurred. In response to determining that the first event has occurred, the system causes the action to occur. | 2022-05-19 |
20220156267 | REVISING CATALOG METADATA BASED ON PARSING QUERIES - Systems and methods are disclosed for annotating a metadata catalog in a data intake and query system based on a query received by the data intake and query system. The metadata catalog can store information about datasets associated with the data intake and query system, including dataset configuration records of the datasets, which can be used to process queries for execution by the data intake and query system. The data intake and query system can receive a query identifying a set of data to be processed and a manner of processing the set of data. The data intake and query system can parse the query to identify datasets and/or data fields associated with the query. Based on the identified datasets and/or fields, the data intake and query system can generate one or more annotations, and use the annotations to update the metadata catalog. | 2022-05-19 |
20220156268 | METHODS AND SYSTEMS FOR GENERATING SEARCH RESULTS - Methods and systems for generating search results based on a search query, the method includes: receiving a first search query including one or more search terms; obtaining a list of search results for the first search query; determining, based on user interactions with unmodified search results for one or more previous search queries that included the one or more search terms, a first engagement score associated with the first search query; determining that the first engagement score is lower than a first threshold; responsive to determining that the first engagement score is lower than the first threshold, and modifying the list of search results. | 2022-05-19 |
20220156269 | ENFORCING DIVERSITY IN RANKED RELEVANCE RESULTS RETURNED FROM A UNIVERSAL RELEVANCE SERVICE FRAMEWORK - In general, embodiments of the present invention provide systems, methods and computer readable media for a universal relevance service framework for ranking and personalizing items. | 2022-05-19 |
20220156270 | Data-Driven Academia and Industry Matching Platform - The present invention relates to a method for matching research grants with relevant researchers and generating a report based on that match. Descriptions of grants and information on researchers are entered into a database. The entered information is converted into vectors based on a set of parameters using a natural language processing model. A neural network is trained by iterating data sets to identify relevant matches between vectors. The neural network includes a plurality of convolution layers filtering the relevant vectors matching based on the assigned parameters. A report comprising the matches as well as a numerical rating indicating the relevance of the matches. | 2022-05-19 |
20220156271 | SYSTEMS AND METHODS FOR DETERMINING THE PROBABILITY OF AN INVENTION BEING GRANTED A PATENT - This invention provides the ability for an inventor to determine the probability of their invention being granted a patent. The invention disclosure and/or any type of patent document is classified before, during or after being filed by using any of the existing classification systems (e.g., CPC codes) or others such as a new and novel business vernacular classification system (as described as part of this disclosure). This newly created invention persona (classified document) is then compared to the existing patent database to discover granted patents that are similar and may be compared to other public and non-public databases to discover prior art. An analysis is then performed using various algorithms pertaining to the similarity of the classification by examining the branches, proximity, density etc. of the various assigned codes which will uncover the novelty, non-obviousness, and utility of the invention disclosure. A further search can then be undertaken to discover the “white spaces’ and the inventor then has the ability to use the analysis and search discovery to adjust the invention to better reflect the “white spaces” for maximum probability of a patent being granted. | 2022-05-19 |
20220156272 | Transition Regularized Matrix Factorization For Sequential Recommendation - Apparatuses, methods, and systems are provided for making sequential recommendations using transition regularized non-negative matrix factorization. A non-application specific collaborative filtering based personalized recommender system can recommend a next logical item from a series of related items to a user. The recommender system can recommend a next desirable or series of next desirable new items to the user based on the historical sequence of all user-item preferences and a user's most recent interaction with an item. An asymmetric item-to-item transition matrix can capture aggregate sequential user-item interactions to design a loss function for matrix factorization that incorporates the transition information during decomposition into low-rank factor matrices. | 2022-05-19 |
20220156273 | PRIMING-BASED SEARCH AND DISCOVERY OF CONTENT - A method, a device, and a non-transitory storage medium are described in which a priming-based search and discovery service for contents uses a data structure that stores metadata pertaining to the contents, activation values, threshold values, and a distance parameter that limits the search space relative to primed nodes that are relevant to search terms. | 2022-05-19 |
20220156274 | LIGHT DATA INTEGRATION - Methods, systems, and apparatus, including computer programs encoded on computer storage media, for a light integration. One of the methods includes receiving a plurality of objects from a functional logic tier of an application, each object representative of data stored in a data tier of the application, a first portion of the stored data being stored in a first persistent data store and a second portion of the stored data being stored in a second persistent data store. The method includes presenting in a first area of the user interface information from the plurality of objects, the information selected from the first portion of the data. The method includes receiving an indication of an object being selected from the plurality of objects. The method includes presenting in a second area of the user interface information from the second part of data corresponding to the selected business object. | 2022-05-19 |
20220156275 | Data Analytics - A computer-implemented method and computing system for providing unified data analytics, include receiving data from one or more data sources, and processing the data. One or more statistics are computed by aggregating an output of the processing i) at an instantaneous point in time; and ii) over a predetermined duration of time. | 2022-05-19 |
20220156276 | GENERATION OF A DATASET IN THE FORMAT OF A MACHINE LEARNING FRAMEWORK - A dataset formatted in a first format is generated, wherein the dataset formatted in the first format includes at least a plurality of data elements that comprise data. A selection is made of machine learning framework, wherein the machine learning framework operates on datasets formatted in a second format that is different from the first format. The dataset is converted from the first format to the second format and links are generated from the converted dataset formatted in the second format to the plurality of data elements of the dataset formatted in the first format to avoid creating additional copies of the plurality of data elements. | 2022-05-19 |
20220156277 | DATA SYNCHRONIZATION IN A DATA ANALYSIS SYSTEM - A computer implemented method comprises receiving at least one log record. A type of operation performed in a source database system may be determined based on the log record. Based on the type of operation, an update strategy may be selected from a set of pre-defined update strategies, wherein the update strategy specifies a sequence of replication operations to be performed in order to apply changes described in the at least one log record to a target database system. | 2022-05-19 |
20220156278 | Database Data Replication Tool - Data replication between databases is provided. The method comprises receiving, through an API integrated into a data replication tool, a request from a system of record (SoR) application for a replication setup and initialization. A number of data instances are imported through the API from a source database associated with the SoR. A manager engine integrated into the data replication tool initiates a separate replication process for each data instance. The manager engine is configured to support multiple data instances on a single virtual machine instance. If a difference between a data description language (DDL) of the replicated data instances and a DDL of a target database is detected, the DDL of the replicated data instances is automatically changed to the DDL of the target database. The replicated data instances are then exported to the target database. | 2022-05-19 |
20220156279 | CENTRALIZED DATABASE MANAGEMENT SYSTEM FOR DATABASE SYNCHRONIZATION USING INVERTIBLE BLOOM FILTERS - A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency. The system manages data synchronization and data reconciliation across multiple databases managed by multiple DBMS across different client servers. The system generates and sends instructions that encode each data table into an invertible bloom filter and identifies differences between the two databases by performing a subtraction operation on the two invertible bloom filters. The system may generate a third invertible bloom filter comprising information associated with differences between the two data tables. The system may send instructions to the source and the destination databases, where a first and a second invertible bloom filters are encoded for the source and the destination databases, respectively. The system may decode the third invertible bloom filter, identify the different elements, and generate instructions to the source and/or the destination database. | 2022-05-19 |
20220156280 | DATABASE MANAGEMENT USING INVERTIBLE BLOOM FILTERS - A centralized database management system performs data synchronization with lower bandwidth consumption and higher efficiency. The system manages data synchronization and data reconciliation across multiple databases managed by multiple DBMS across different client servers. The system generates and sends instructions that encode each data table into an invertible bloom filter and identifies differences between the two databases by performing a subtraction operation on the two invertible bloom filters. The system may generate a third invertible bloom filter comprising information associated with differences between the two data tables. The system may send instructions to the source and the destination databases, where a first and a second invertible bloom filters are encoded for the source and the destination databases, respectively. The system may decode the third invertible bloom filter, identify the different elements, and generate instructions to the source and/or the destination database. | 2022-05-19 |
20220156281 | RESOURCE PROVISIONING SYSTEMS AND METHODS - A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/ Furthermore, the device processes the set of queries using the updated set of processors. | 2022-05-19 |
20220156282 | RESOURCE PROVISIONING SYSTEMS AND METHODS - A method and apparatus managing a set of processors for a set of queries is described. In an exemplary embodiment, a device receives a set of queries for a data warehouse, the set of queries including one or more queries to be processed by the data warehouse. The device further provisions a set of processors from a first plurality of processors, where the set of processors to process the set of queries, and a set of storage resources to store data for the set of queries. In addition, the device monitors a utilization of the set of processors as the set of processors processes the set of queries. The device additionally updates a number of the processors in the set of processors provisioned based on the utilization/ Furthermore, the device processes the set of queries using the updated set of processors. | 2022-05-19 |
20220156283 | RESOURCE MANAGEMENT SYSTEMS AND METHODS - Example resource management systems and methods are described. In one implementation, a resource manager is configured to manage data processing tasks associated with multiple data elements. An execution platform is coupled to the resource manager and includes multiple execution nodes configured to store data retrieved from multiple remote storage devices. Each execution node includes a cache and a processor, where the cache and processor are independent of the remote storage devices. A metadata manager is configured to access metadata associated with at least a portion of the multiple data elements. | 2022-05-19 |
20220156284 | METHODS AND SYSTEMS FOR SYNCHRONIZING COMMUNICATION RECORDS IN COMPUTER NETWORKS BASED ON DETECTING PATTERNS IN CATEGORIES OF METADATA - Methods and systems are described herein for synchronizing communication records in computer networks. For example, the methods and systems may determine whether or not a first communication relates to a second and generate a recommendation that the communications relate to a single communication. In particular, the methods and systems described herein describe synchronizing communication records in computer networks based on detecting patterns in categories of metadata. For example, the methods and systems retrieve specific types of metadata and compare this metadata between communications in order to synchronize and/or deduplicate them. | 2022-05-19 |
20220156285 | Data Tagging And Synchronisation System - A computer implemented method of synchronizing data between a central database and at least one individual database including the steps of: acquiring data from at least one external source; forming an intelligence dataset, wherein the intelligence dataset includes multiple intelligence datum; storing the intelligence dataset in a central database; applying a machine learning ML tagging algorithm to the stored dataset to assign at least one tag to each intelligence datum in the stored dataset, forming a tagged intelligence dataset including multiple tagged intelligence datum; and copying each tagged intelligence datum from the central database to at least one individual database based on the assigned tag. | 2022-05-19 |
20220156286 | ELASTIC CONNECTION POOLS FOR DATABASE NODES - Elastic connection pools for database nodes are described. A system receives a user request that references data in a database, and uses the user request to identify a partition of multiple partitions of the database. The system uses the identified partition to identify a database node in a cluster of database nodes. The system uses the identified database node to identify a connection pool of multiple connection pools provided by an application server. If the identified connection pool does not have any available connections to the identified database node, the system uses connection criteria to select another connection pool of the remainder of the connection pools. The system enables the user request to access the referenced data in the identified partition of the database by providing the user request with an available connection, from the other connection pool, to another database node in the cluster. | 2022-05-19 |
20220156287 | SYSTEMS, METHODS, AND DEVICES FOR STORAGE SHUFFLE ACCELERATION - A method of processing data in a system having a host and a storage node may include performing a shuffle operation on data stored at the storage node, wherein the shuffle operation may include performing a shuffle write operation, and performing a shuffle read operation, wherein at least a portion of the shuffle operation is performed by an accelerator at the storage node. A method for partitioning data may include sampling, at a device, data from one or more partitions based on a number of samples, transferring the sampled data from the device to a host, determining, at the host, one or more splitters based on the sampled data, communicating the one or more splitters from the host to the device, and partitioning, at the device, data for the one or more partitions based on the one or more splitters. | 2022-05-19 |
20220156288 | Method, Apparatus, and Management Node for Managing Data in Partition Table, and Storage Medium - In a method for managing data in a partition table, a server, and a storage medium, a management node obtains a creation duration range of data of a target partition in the partition table, further obtains a geographical area to which the target partition belongs, historical access information of the target partition, or a service type of the target partition; and then, when the creation duration range of the data of the target partition meets a predetermined time range of a first storage stage and a preset condition is met, the management node alters the data that is of the target partition and that has been stored based on a storage policy corresponding to a second storage stage to be stored based on a storage policy corresponding to the first storage stage. | 2022-05-19 |
20220156289 | GENERATING A MULTI-COLUMN INDEX FOR RELATIONAL DATABASES BY INTERLEAVING DATA BITS FOR SELECTIVITY - A multi-column index is generated based on an interleaving of data bits for selectivity for efficient processing of data in a relational database system. Two or more columns may be identified for inclusion in the multi-column index for a relational database table. Based, at least in part, on the interleaving of data bits for selectivity from the identified columns, a multi-column index is generated for the relational database table that provides a respective index value for each entry in the relational database table. The entries of the relational database table may then be stored according to the index values of the multi-column index. | 2022-05-19 |
20220156290 | METHODS AND SYSTEMS FOR CLASSIFYING DATABASE RECORDS BY INTRODUCING TIME DEPENDENCY INTO TIME-HOMOGENEOUS PROBABILITY MODELS - Methods and systems are described herein for improving data processing efficiency of classifying user files in a database. More particularly, methods and systems are described herein for improving data processing efficiency of classifying user files in a database in which the user files have a temporal element. The methods and system described herein accomplish these improvements by introducing time dependency into time-homogeneous probability models. Once time dependency has been introduced into the time-homogeneous probability models, these models may be used to improve the data processing efficiency of classifying the user files that feature a temporal element. | 2022-05-19 |
20220156291 | GEOSPATIAL DATA ANALYTICS AND VISUALIZATION PLATFORM - The disclosure relates to a system and method for facilitating geospatial processing and analysis of datasets and providing a visualization of geospatial analytics data over a network. The platform utilizes a discrete global grid system to partition an area (e.g., a map, a city, a state, a country, a continent, the world, etc.) into a set of discrete grid cells. The set of grid cells can be subdivided into finer resolutions of grids. In examples, the platform generates and employs the use of hex tiles for the grid cells. | 2022-05-19 |
20220156292 | SYSTEMS AND METHODS FOR GENERATING AND USING AGGREGATED SEARCH INDICES AND NON-AGGREGATED VALUE STORAGE - Systems, methods and computer program products for using searchable aggregate indices associated with non-aggregated value storage. In one method, a search system stores metadata values for each of a plurality of objects in a storage unit. The metadata values are stored in corresponding value storage locations that are associated with an identifiable metadata fields. An aggregate index is provided which includes a dictionary of terms that are contained in metadata values associated with a designated set of the metadata fields. The aggregate index is searched for one or more specific search terms, and one or more of the metadata values are retrieved from the value storage locations in response to the search, where the individual metadata fields associated with the retrieved metadata values are identified. | 2022-05-19 |
20220156293 | Demand Based Dynamic Creation Of Data Analytics Query Accelerators - A system and method for processing queries including splitting a query into sub-queries, mapping the sub-queries to respective sets of filter properties, mapping the sets of filter properties to respective reconfiguration bitstreams, configuring a plurality of filters within a field programmable gate array (FPGA) according to respective ones of the respective reconfiguration bitstreams, wherein each filter is formed in a respective reconfigurable region of the FPGA. | 2022-05-19 |
20220156294 | Text Recognition Method and Apparatus - A text recognition method and apparatus are provided and relate to the field of information classification. A text and profile information of a user may be obtained ( | 2022-05-19 |
20220156295 | PROFILE GENERATION DEVICE - A profile generation device | 2022-05-19 |
20220156296 | TRANSITION-DRIVEN SEARCH - Methods, systems, and computer programs are presented for searching the content of voice conversations. The conversations are translated into text and analysis of the conversation is performed to identify information in the conversation. The information identified includes turns taking data in the conversation and states identified within each state. A powerful user interface (UI) is provided to review the conversations and add annotations that tag the different turns. Additionally, parameter values are extracted from the text. A powerful search engine is provided with multiple search options, such as searching for text, searching by state within the conversation, searching by parameters extracted from the conversation, or a combination thereof. | 2022-05-19 |
20220156297 | EFFICIENT AND COMPACT TEXT MATCHING SYSTEM FOR SENTENCE PAIRS - A method, computer program, and computer system is provided for query matching of sentences based on co-attention scores. Two or more query inputs to a neural network are received. A correlation factor between the two or more query input is identified based on attention weights. A feature vector is generated based on the attention weights. A probability value corresponding to the two or more query inputs is determined based on the generated feature vector. | 2022-05-19 |
20220156298 | PROVIDING AGENT-ASSIST, CONTEXT-AWARE RECOMMENDATIONS - Techniques for agent-assist systems to provide context-aware, subdocument-granularity recommended answers to agents that are attempting to answer queries of users. The agent-assist system may obtain collections of documents that include information for responding to queries, and analyze those documents to identify subdocuments that are associated with different semantics or meanings. Subsequently, any queries received can be analyzed to identify their semantics, and relevant subdocuments can be identified as having similar semantics. When the agent-assist system presents the agent with the relevant documents, it may highlight or otherwise indicate the relevant subdocument within the document for quick identification by the agent. Further, the agent-assist system may collect feedback from the agent and/or user to determine a relevancy of the recommended answers. The agent-assist system can use the feedback to improve the quality of the recommended answers provided to the agents. | 2022-05-19 |
20220156299 | DISCOVERING OBJECTS IN AN ONTOLOGY DATABASE - A computer-implemented method, system and computer program product for discovering objects in a database containing a populated ontology. A first network is constructed with objects as the nodes and the shared concepts as the edges between the objects. A second network is constructed with nodes corresponding to the terms related to the search term and the search term synonyms and objects associated with the search term and the search term synonyms, where the edges correspond to the relationships between the terms and the objects. First and second scores are generated for each object in an ontology database based on the first and second networks, respectively, which are combined to form a final score for each object in the ontology database. After ranking the objects in the ontology database based on their associated final scores, objects from the ontology database are presented to the user based on their rank. | 2022-05-19 |
20220156300 | DEEP DOCUMENT PROCESSING WITH SELF-SUPERVISED LEARNING - A document processing system processes documents including typewritten and/or handwritten data by converting them to document images for entity extraction. A received document is initially processed to generate a deep document data structured and for classification as one of a structured or an unstructured document. If the document is classified as a structured document, it is processed for entity extraction based on a matching template and image alignment of the document image with the matching template. If the document is classified as an unstructured document, entities are extracted by obtaining nodes and providing the nodes to a self-supervised masked visual language model. | 2022-05-19 |
20220156301 | FILTERING BASED ON A RANGE SPECIFIER - Data processing apparatuses, methods and computer programs are disclosed. A range definition register is arranged to store a range specifier and filtering operations are performed with respect to a specified transaction by reference to the range definition register. The range definition register stores the range specifier in a format comprising a significand and an exponent, wherein a range of data identifiers is at least partially defined by the range specifier. When the specified transaction is with respect to a data identifier within the range of data identifiers, the filtering operations performed are dependent on attribute data associated with the range of data identifiers. | 2022-05-19 |
20220156302 | IMPLEMENTING A GRAPHICAL USER INTERFACE TO COLLECT INFORMATION FROM A USER TO IDENTIFY A DESIRED DOCUMENT BASED ON DISSIMILARITY AND/OR COLLECTIVE CLOSENESS TO OTHER IDENTIFIED DOCUMENTS - A method of implementing a graphical user interface to collect information from a user is provided. The method includes (i) dynamically displaying, by the graphical user interface, K>1 groupings of M>1 documents from a catalog of documents in an embedding space, wherein a distance between each pair of the documents in the embedding space corresponds to a predetermined measure of dissimilarity between the pair of documents, and the K groupings are formed using K-medoid clustering analysis, (ii) receiving a user selection of one grouping of the K groupings, (iii) dynamically displaying a predetermined number P>0 documents of the cluster which corresponds to the selected grouping, (iv) receiving user feedback with respect to one of the P | 2022-05-19 |
20220156303 | METHODS AND SYSTEMS FOR REUSE OF DATA ITEM FINGERPRINTS IN GENERATION OF SEMANTIC MAPS - A method for using distributed representations of data items within a first set of data documents clustered in a first two-dimensional metric space to generate a cluster of distributed representations in a second two-dimensional metric space includes clustering in a first two-dimensional metric space, by a reference map generator, a set of data documents, generating a semantic map. A parser generates an enumeration of data items occurring in the set of data documents. A representation generator generates a distributed representation using occurrence information about each data item. A sparsifying module receives an identification of a maximum level of sparsity and reduces a total number of set bits within the distributed representation. The reference map generator clusters, in a second two-dimensional metric space, a set of SDRs retrieved from the SDR database and selected according to a second at least one criterion, generating a second semantic map. | 2022-05-19 |
20220156304 | RELATIONSHIP DISCOVERY AND QUANTIFICATION - Aspects of the present disclosure relate to identifying and quantifying relationships between entities. Data sources can be queried to receive data regarding a party. Entities can be extracted from the data to receive a set of entities, wherein the party is a first entity of the set of entities. An ontological structure can be built that interrelates entities within the set of entities. An initial relationship strength can be determined between the first entity and a second entity based on co-occurrence between the first and second entities, wherein the second entity is a second party. A relationship score can be calculated between the first and second entities based on the initial relationship strength and at least one additional factor. | 2022-05-19 |
20220156305 | LABELING/NAMES OF THEMES - By formulizing a specific company's internal knowledge and terminology, the ontology programming accounts for linguistic meaning to surface relevant and important content for analysis. The ontology is built on the premise that meaningful terms are detected in the corpus and then classified according to specific semantic concepts, or entities. Once the main terms are defined, direct relations or linkages can be formed between these terms and their associated entities. Then, the relations are grouped into themes, which are groups or abstracts that contain synonymous relations. The disclosed ontology programming adapts to the language used in a specific domain, including linguistic patterns and properties, such as word order, relationships between terms, and syntactical variations. The ontology programming automatically trains itself to understand the domain or environment of the communication data by processing and analyzing a defined corpus of communication data. | 2022-05-19 |
20220156306 | SELECTING SHOTS FOR SCHEDULING - A method for use in an automated media scheduling system includes generating a shots representing potential playlists of media items. Each of the shots includes multiple shot positions. A shot-position-dependent score of a current content item being considered for insertion into a particular shot position of a particular shot is generated, and indicates how closely the current content item conforms to a predetermined set of factors associated with the particular shot position of the particular shot. The current content item is inserted into the particular shot position of the particular shot based, at least in part on a comparison of the shot-position-dependent score of the current content item with shot-position-dependent scores of other content items, and the shot positions of each of the shots are populated with eligible content items. One of the shots is selected for scheduling based on aggregate scores of eligible content associated with each individual shot. | 2022-05-19 |
20220156307 | TEMPORAL MULTI-FACTOR RATING AND DATA VISUALIZATION SYSTEM - A data analysis and social media platform is described for receiving and displaying user ratings covering a subject according to a predetermined set of parameters. A subject may be a musical artist or performer, and the parameters a series of quantifiable criteria, characteristics, or core skills that fans may already use in everyday conversation to describe and analyze those artists. The platform may encompass a web server, application engine, database engine, and ratings engine that communicate with browser software running on a computing device to track a subject over time. A rating and skillset breakdown of an artist may be presented visually to the user, who may enter their own ratings for these skillsets. Ratings may be made public and presented with visualizations that convey overall characteristics of the data including average overall rating, average rating by skillset, rating frequency, and most recently rated, among others. | 2022-05-19 |
20220156308 | STATION LIBRARY CREATON FOR A MEDIA SERVICE - A machine may form all or part of a network-based system configured to provide media service to one or more user devices. The machine may be configured to define a station library within a larger collection of media files. In particular, the machine may access metadata that describes a seed that forms the basis on which the station library is to be defined. The machine may determine a genre composition for the station library based on the metadata. The machine may generate a list of media files from the metadata based on a relevance of each media file to the station library. The machine may determine the relevance of each media file based on a similarity of the media file to the genre composition of the station library as well as a comparison of metadata describing the media file to the accessed metadata that describes the seed. | 2022-05-19 |
20220156309 | MULTIMEDIA MANAGEMENT SYSTEM (MMS) - A multimedia management system (MMS) manages media acquisition, storage and retrieval, quickly retrieving relevant media records with minimal effort and may also provide controlled and/or restricted on-line access to media records. The reduction in effort to control, manage and access information rich media allows the use of media to become a more efficient and prolific means of general media documentation for intra- and inter-communication between entities such as businesses, government organizations, and institutions, as well as for individuals. Moreover, the system also provides media acquisition aids, acquisition device management aids and display aids that further improve the efficiency of accessing relevant media in a timely manner further reducing barriers to using digital media as a practical media documentation tool. | 2022-05-19 |
20220156310 | Time-series analytics for Database Management Systems - Methods, apparatuses and computer program products implement embodiments of the present invention that include capturing a series of point-in-time images of a database including one or more tables, each of the tables including one or more fields. Upon receiving, from a user, a query with respect to a variation of a given field over a specified period of time, the point-in-time images are analyzed in order to extract the variation; and the extracted variation is presented to the user. | 2022-05-19 |
20220156311 | IMAGE RETRIEVAL METHOD AND IMAGE RETRIEVAL SYSTEM - Image retrieval is facilitated. An image retrieval device is a device for retrieving an image with high similarity that is stored in a server computer by using a query image. In an image registration mode, a plurality of first images are supplied to a code generation portion, and the code generation portion resizes the number of pixels of the first image, converts the number of pixels of the first image into the number of pixels of a second image, and extracts a first feature value from the second image. The control portion links the first image to the first feature value corresponding to the first image and stores the first image and the first feature value in a storage portion. In an image selection mode, a first query image is supplied to the code generation portion, and the code generation portion resizes the number of pixels of the first query image, converts the number of pixels of the first query image into the number of pixels of a second query image, and extracts a third feature value from the second query image. The first image having the first feature value with high similarity with the second feature value is selected by an image selection portion, and the selected image is used as a query response. | 2022-05-19 |
20220156312 | PERSONALIZED IMAGE RECOMMENDATIONS FOR AREAS OF INTEREST - One example method involves operations for receiving a query that includes a keyword. The search query is associated with a user profile. Operations further include recommendation matrix that includes a set of images based on (a) an area of interest determined from the search query and the user profile and (b) content tags associated with the images. In addition, operations include calculating a recommendation score for a candidate image included in the recommendation matrix. The recommendation score includes a weighted average of row vectors of the recommendation matrix. Further, operations involve including the candidate image in a search result for the search query based on the recommendation score. Additionally, operations include generating, for display, a search result that includes the candidate image. | 2022-05-19 |
20220156313 | MATCHING RESULT DISPLAY DEVICE, MATCHING RESULT DISPLAY METHOD, PROGRAM, AND RECORDING MEDIUM - The present invention provides a matching result display device, a matching result display method, a program, and a recording medium, which allow, at the time of displaying feature points of objects determined as matching on the basis of matching result information provided by a matching system, visual check of the displayed feature points to be performed easily. The matching result display device according to the present invention includes: a feature point acquiring unit that acquires a plurality of feature points common to at least two pieces of image data to be matched against each other; a display position setting unit that sets display positions of corresponding symbols to be assigned to the feature points common to the at least two pieces of image data in such a manner that, when the same corresponding symbols are assigned to corresponding feature points, respectively, a display line connecting each feature point and the corresponding symbol assigned thereto on each of the at least two piece of image data does not overlap with display lines connecting other feature points and corresponding symbols assigned thereto, respectively; and a display unit that provides the corresponding symbols at the display positions and displays the feature points and the corresponding symbols assigned thereto in a state where they are connected with display lines, respectively. | 2022-05-19 |
20220156314 | WIDE AREA AUGMENTED REALITY LOCATION-BASED SERVICES - Apparatus, methods and systems of providing AR content are disclosed. Embodiments of the inventive subject matter can obtain an initial map of an area, derive views of interest, obtain AR content objects associated with the views of interest, establish experience clusters and generate a tile map tessellated based on the experience clusters. A user device could be configured to obtain and instantiate at least some of the AR content objects based on at least one of a location and a recognition. | 2022-05-19 |
20220156315 | METHOD AND APPARATUS FOR MANAGING DIGITAL FILES - A computer-implemented method of associating digital tags with digital files comprises storing a plurality of digital files having embedded therein content data and metadata including tags; receiving, via a user interface device of a client device, a first tag label containing alphanumeric text created and inputted by a user of the client device; modifying, using a controller device, a selected first one of the tags of the metadata in a first of the digital files to include the first tag label; receiving, via the user interface device or another user interface device, an instruction to search for all of the digital files having at least the first tag label; responsive to receiving the instruction, automatically searching for all of the digital files having at least the first tag label; and displaying, on a video display device associated with the client device, a first indication of the first tag label. | 2022-05-19 |
20220156316 | Device, System, and Method of Capturing the Moment in Audio Discussions and Recordings - Devices, systems, and methods of Capturing the Moment in audio discussions and recordings. A user utilizes an electronic device to record audio, or to participate in an audio conversation or an audio/video conversation. During the conversation, the user clicks on presses a button to create an audio bookmark at desired time-points. Later, the system generates separate a short audio-clip for a few sentences that were spoken before and after each such audio bookmarks. The system further generates an aggregated clip or summary of the bookmarked segments, as well as textual transcription of the bookmarked content. | 2022-05-19 |
20220156317 | GENERATING LOOPED VIDEO CLIPS - Systems, methods and non-transitory computer readable media for generating looped video clips are provided. A still image may be received. The still image may be analyzed to generate a series of images. The series of images may include at least first, middle and last images. The first image may be substantially visually similar to the last image, and the middle image may be visually different from the first and last images. The series of images may be provided. Playing the series of images in a video clip that starts with the first image and finishes with the last image, and repeating the video clip from the first image immediately after completing the playing of the video clip with the last image may create visually smooth transaction in which the transition from the last image to the first image is visually indistinguishable from the transactions between frames within the video clip. | 2022-05-19 |
20220156318 | PROPAGATING CHANGES FROM ONE VISUAL CONTENT TO A PORTFOLIO OF VISUAL CONTENTS - Systems, methods and non-transitory computer readable media for propagating changes from one visual content to other visual contents are provided. A plurality of visual contents may be accessed. A first visual content and a modified version of the first visual content may be accessed. The first visual content and the modified version of the first visual content may be analyzed to determine a manipulation for the plurality of visual contents. The determined manipulation may be used to generate a manipulated visual content for each visual content of the plurality of visual contents. The generated manipulated visual contents may be provided. | 2022-05-19 |
20220156319 | SYSTEMS AND METHODS FOR VIDEO ARCHIVE AND DATA EXTRACTION - Systems and methods for full motion video search are provided. In one aspect, a method includes receiving one or more search terms. The search terms include one or more of a characterization of the amount of man-made features in a video image and a characterization of the amount of natural features in the video image. The method further includes searching a full motion video database based on the one or more search terms. | 2022-05-19 |
20220156320 | METHOD AND APPARATUS FOR IDENTIFYING DEVICES USING COLLECTIVE INTELLIGENCE - Provided is a method performed by a computing device for identifying a device. The method include receiving a target packet from an identification target device, extracting a pattern of the target packet, the target packet being transmitted by the identification target device from the packet, matching the pattern of the target packet with at least one of packet patterns stored in an identification information DB, comparing a first model name with a second model name, the first model name being corresponding to the matched pattern stored in the identification information DB, the second model name being selected by a user of a user terminal, and transmitting a proposed model name to the user terminal based on determining that the first model name and the second model name are different, the proposed model name being used for connection between the user terminal and the identification target device. | 2022-05-19 |
20220156321 | DISTANCE MEASUREMENT FOR TIME SERIES - A time series distance estimation system may receive two time series and estimate a distance or a degree of dissimilarity between the two time series. The system may calculate a time warp function for the two time series, and perform a trend filtering alternately in a multi-level framework to further accelerate the speed of computation. | 2022-05-19 |
20220156322 | GRAPH REORDERING AND TILING TECHNIQUES - Graph reordering and tiling techniques are described herein. In one example, large graphs (e.g., for inferencing with graph neural networks) can be reordered, tiled, or both, to achieve maximal data reuse and uniform compute load distribution. In one example, a reordering method involves performing breadth first search (BFS) renumbering on a graph data set with the highest degree destination node as the root node to generate a reordered graph data set. BFS is then performed again with candidate nodes from the last level of the reordered graph. The second reordered graph data set with the lowest bandwidth or best profile can be selected for further processing. In one example, a method of tiling involves dividing a graph data set into tiles to balance expected compute time. | 2022-05-19 |
20220156323 | FIELD OF TECHNOLOGY - Systems and methods for providing a consolidated transfer ecosystem are provided. Systems may include a graph database. The graph database may include a plurality of nodes representing a plurality of entities. The system may receive a plurality of transfer requests and represent each transfer request as an edge on the graph database. The system may include a consolidation engine that may consolidate the edges in the graph database to produce a consolidated database. The system may execute the transfers according to the consolidated database. | 2022-05-19 |
20220156324 | GRAPH REFACTORIZATION METHOD AND GRAPH REFACTORIZATION APPARATUS - A graph refactorization method is provided, and relate to the field of communication technologies, to implement parallel graph processing with load balancing, low communication costs, and short execution time. The method includes: A first machine selects a first vertex from a local vertex set of a subgraph (S | 2022-05-19 |
20220156325 | BINARY-ADDITION TREE ALGORITHM-BASED NETWORK ASSESSMENT METHOD AND SYSTEM THEREOF - A binary-addition tree algorithm-based network assessment method includes performing a parameter setting step, an arc enumerating step and an evaluating step. The parameter setting step is performed to set a plurality of state values of a state vector of one of a plurality of paths to 0, wherein the state vector of the one of the paths is represented by a binary value, and the state values of the state vector of the one of the paths are corresponding to a plurality of arcs, respectively. The arc path enumerating step is performed to enumerate all of the state values of the state vectors of the paths by adding 1 to the binary value corresponding to the state values of the state vector of the one of the paths according to a binary-addition tree algorithm. The evaluating step is performed to evaluate the state of the paths. | 2022-05-19 |
20220156326 | Method, System, and Computer Program Product for Generating a Customized Photochromic Optical Article Recommendation - A method of generating a customized photochromic optical article recommendation for a user includes: for each of a plurality of photochromic optical articles, determining a plurality of performance attributes; receiving, from a user device, feedback data associated with each of the plurality of performance attributes; based on the plurality of performance attributes and the feedback data, generating, for each of the plurality of photochromic optical articles, a compatibility score; and based on the compatibility score for each of the plurality of photochromic optical articles, generating a user-specific recommendation including at least one of the plurality of photochromic optical articles. A system and computer program product for generating a customized photochromic optical article recommendation for a user are also disclosed. | 2022-05-19 |
20220156327 | DYNAMIC SEARCH INTERFACES - Systems and methods are disclosed for dynamic search interfaces. In one implementation, a search query is received from a user within a content retrieval interface. The search query is processed with respect to a first content source to determine a relevance of the first content source with respect to the search query. Based on a determination that the first content source exceeds a defined relevance threshold, content from the first content source is requested and/or received. The content received from the first content source is presented within the content retrieval interface. | 2022-05-19 |
20220156328 | Accelerated Operations on Compressed Data Stores - A data operations system receives compressed data and a search term. The data operations system completes a modified decoding of the compressed data, resulting in distinguishable data terms that are smaller than the corresponding data terms, and loads modified decoded terms into a data register. The data operations system generates a truncated search term and loads instances of the truncated search term into a query register. The data operations system performs a parallel data operation, such as a query operation, by comparing each of the modified decoded terms to an instance of the truncated search term. The data operations system returns the results of the operation. | 2022-05-19 |
20220156329 | MASK-AUGMENTED INVERTED INDEX - The embodiments disclosed herein are related to a computing system for generating a mask-augmented inverted index. The mask-augmented inverted index is structured to allow phrase query searching while minimizing the amount of computing system processing and memory resources needed to generate the mask-augmented inverted index. In one embodiment, a first token is mapped to a first listing of documents that include the first token. A first mask is included that comprises a probabilistic representation of a set of integers corresponding to one or more locations of the first token in each of the individual documents of the first listing. A second mask is included that comprises a probabilistic representation of a set of integers that indicate a positional relationship between the first token and one or more other tokens in each of the individual documents of the first listing. | 2022-05-19 |
20220156330 | Performance Metrics Collection And Promulgation From Within A Mobile Application - A mobile communication device. The device comprises a central processing unit (CPU), a graphics processing unit (GPU), and a memory comprising a mobile application incorporating a search client that. When executed by at least one of the CPU and the GPU, the application receives an input selecting the search client, begins execution in a trusted security zone execution mode wherein instructions of the search client execute in the GPU, creates a genesis block of a block chain via the search client instructions executing in the GPU, creates an event block of the block chain via the search client instructions executing in the GPU, attaches the event block to the block chain via the search client instructions executing in the GPU, transmits the block chain to a data store, and reverts to execution in a normal execution mode. | 2022-05-19 |
20220156331 | METADATA TAGGING OF DOCUMENT WITHIN SEARCH ENGINE - A shard of a selected document is identified. A hierarchy of documents including the selected document are to be tagged with metadata in a data store of a search engine so that the related documents are queryable by the metadata using the search engine. The shard specifies a location of the related documents within the data store of the search engine. For each related document, a tagging operation is generated within a script, the tagging operation specifying the metadata, the shard, an identifier of the related document, and an identifier of the selected document. The script including the generated tagging operation for each related document is transmitted to the search engine to execute to tag the related documents in the data store with the metadata and with the selected document as a source of the metadata. | 2022-05-19 |
20220156332 | METHOD AND SYSTEM FOR IDENTIFYING USER SEARCH SCENARIO - The present invention discloses a method and a system for identifying user search scenario. The method includes the following steps: receiving a search text and finding out one or multiple valid word elements in the search text; subjecting the valid word elements to level filtering and category filtering to obtain valuable word elements having a single category; and setting up a corresponding search scenario tag for the search text according to the category or a category combination of the valuable word elements. Implementation of the present invention extracts data that are necessary to a user from a massive amount of data in a user search scenario, accurately identifies the user's search demand, searches out corresponding contents for the user, quickly resolves the user's demand, and improves user's experience of search. | 2022-05-19 |
20220156333 | SYSTEMS AND METHODS FOR MACHINE LEARNING MODELS FOR SEARCH ENGINE PERFORMANCE OPTIMIZATION - Methods, systems, and computer-readable media for updating a machine learning model utilized in a search engine operation. The method identifies a set of search queries in stored search queries corresponding to a service and apply the identified set of search queries to the search engine to generate one or more search results for the service. Each search result has an assigned aggregate based on values of a set of parameters associated with the service. The method then analyzes the values of the set of parameters to determine a tradeoff point of each parameter to determine one or more weights to apply to the machine learning model based on the tradeoff points. The method stores the determined one or more weights and applies them to the machine learning model for a search query corresponding to the service. | 2022-05-19 |
20220156334 | USER PROFILE MATCHING USING LISTS - Systems and methods for list matching and/or user matching using lists is described. A method includes receiving first data associated with a first user profile including a first set of ranked items and a first title having one or more keywords. The method further includes identifying second data associated with a second user profile including a second set of ranked items and a second title including one or more keywords. The first title and the second title are within are threshold proximity based on the keywords of the first title and the second title. The method further includes determining that the first set of ranked items is most similar to the second set of ranked items by performing a rank-weighted similarity comparison. The method further includes providing a rank-ordered list for presentation on the user device. | 2022-05-19 |
20220156335 | STREAMING DATA PROCESSING - Systems and methods are disclosed for processing streaming data. The data can come from various sources. Worker nodes can be configured to process the streaming data, without delays that may be caused by indexing the data. The data can be filtered and/or transformed as it is processed. In some cases, data can be stored in a data store without transformation. The data in the data store can be accessed and processed at a later time. | 2022-05-19 |
20220156336 | PROJECTING QUERIES INTO A CONTENT ITEM EMBEDDING SPACE - Systems and methods for recommending content to an online service user are presented. In response to a request from a user, a set of n-grams of the request are generated, with each n-gram comprising one or more terms from the request and each n-gram of the set of n-grams being unique. Embedding vectors projecting the n-grams into a content item embedding space are generated, and the embedding vectors are combined into a representative embedding vector for the request. The nearest content items are identified according to a distance measure between a projection of the representative embedding vector and embedding vectors of content items of a corpus of content items in the content item embedding space. At least some of the nearest content items are returned as recommended content in response to the request from the user. | 2022-05-19 |