G06F16/90339

Search infrastructure

A system for real-time search, including: a set of partitions, each including a set of segments, each segment corresponding to a time slice of messages posted to the messaging platform, and a real-time search engine configured to receive a search term in parallel with other partitions in set the set of partitions, and search at least one of the set of segments in reverse chronological order of the corresponding time slice to identify document identifiers of messages containing the search term; and a search fanout module configured to: receive a search query including the search term; send the search term to each of the set of partitions for parallel searching; and return, in response to the search query, at least one of the identified document identifiers of messages containing the search term.

Tenant-isolated custom annotations for search within a public corpus

Annotations are customized for a tenant-specific search within a public corpus. In a non-limiting embodiment of the invention, a cartridge file is received by a semantic search application. The cartridge file includes a new attribute definition that is not available in an index of the semantic search application. The new attribute definition is incorporated within the index based on an approximation of one or more existing attributes in the index. One or more documents are retrieved from the public corpus based on a concept search using the incorporated new attribute definition and the one or more documents are annotated based on the incorporated new attribute definition. The annotated one or more documents are stored in a tenant-specific dataset separate from the public corpus.

Blockchain-based data verification method, apparatus, and electronic device
11562375 · 2023-01-24 · ·

The present application provides blockchain-based anti-counterfeiting methods, apparatuses, and systems. One method includes: obtaining an anti-counterfeiting verification request submitted by a user for a product; initiating anti-counterfeiting verification of the product in response to the anti-counterfeiting verification request, wherein the anti-counterfeiting verification comprises integrity verification of anti-counterfeiting information generated by a plurality of anti-counterfeiting participants on a blockchain, wherein the anti-counterfeiting information comprises a plurality of types of anti-counterfeiting identification information corresponding to the product; and returning an anti-counterfeiting verification result for the product to the user.

Graph based recommendation system
11537663 · 2022-12-27 · ·

Techniques are disclosed to provide a graph based recommendation system. A recommendation engine definition that includes for each of a plurality of pipeline phases a corresponding phase definition and data indicating a location of the phase in a pipeline defined by the recommendation engine definition is stored in a memory of other storage device. The recommendation engine definition is used to generate programmatically one or more procedures to provide a recommendation engine that implements the pipeline. An API usable by a client to obtain a recommendation from the recommendation engine is generated programmatically and exposed.

ENCODING VARIABLE LENGTH CHARACTERS USING SIMULTANEOUS PROCESSING
20220405460 · 2022-12-22 ·

Embodiments are directed to managing character encoding. A plurality characters that are each encoded as code units based on a character code may be provided such that the code units for each character represents a code point of a character encoding scheme. An encoding model may be determined based on the character code, one or more processor features, and a target character code. Process features may be employed to transform the code units into target code units based on the encoding model such that the target code units are based on the target character code and such that the target code units encode the code point for each character. The plurality of target characters may be provided to a target stream such that each target character may be encoded as the target code units.

High Bandwidth Content Addressable Memory (CAM) Based Hardware Architecture For Datacenter Networking
20220382783 · 2022-12-01 ·

A communication protocol system is provided for reliable transport of packets. A content addressable memory hardware architecture including a reorder engine and a retransmission engine may be utilized for the reliable transport of the packets. The content addressable memory module includes a primary CAM that may be logically partitioned into a plurality of physical sub-CAMs. One or more processors are in communication with the content addressable memory module. The one or more processors receive a set of data packets. A lookup operation is performed by the one or more processors to access data entries stored in each of the sub-content addressable memories. An update operation is performed by the one or more processors at a selected sub-content addressable memory from the plurality of the sub-content addressable memories.

Proactive corrective actions in memory based on a probabilistic data structure

The present disclosure includes apparatuses and methods for proactive corrective actions in memory based on a probabilistic data structure. A number of embodiments include a memory, and circuitry configured to input information associated with a subset of data stored in the memory into a probabilistic data structure and proactively determine, at least partially using the probabilistic data structure, whether to take a corrective action on the subset of data stored in the memory.

Technologies for tuning performance and/or accuracy of similarity search using stochastic associative memories

Technologies for tuning performance and/or accuracy of similarity search using stochastic associative memories (SAM). Under a first subsampling approach, columns associated with set bits in a search key comprising a binary bit vector are subsampled. Matching set bits for the subsampled columns are aggregated on a row-wise basis to generate similarity scores, which are then ranked. A similar scheme is applied for all the columns with set bits in the search key and the results for top ranked rows are compared to evaluate a tradeoff between throughput boost versus lost accuracy. A second approach called continuous column read, and iterative approach is employed that continuously scores the rows as each new column read is complete. The similarity scores for an N-1 and Nth-1 iteration are ranked, a rank correlation is calculated, and a determination is made to whether the rank correlation meets or exceeds a threshold.

GRAPH BASED RECOMMENDATION SYSTEM
20230081880 · 2023-03-16 ·

Techniques are disclosed to provide a graph based recommendation system. A recommendation engine definition that includes for each of a plurality of pipeline phases a corresponding phase definition and data indicating a location of the phase in a pipeline defined by the recommendation engine definition is stored in a memory of other storage device. The recommendation engine definition is used to generate programmatically one or more procedures to provide a recommendation engine that implements the pipeline. An API usable by a client to obtain a recommendation from the recommendation engine is generated programmatically and exposed.

ALGORITHMIC TCAM BASED TERNARY LOOKUP

An algorithmic TCAM based ternary lookup method is provided. The method stores entries for ternary lookup into several sub-tables. All entries in each sub-table have a sub-table key that includes the same common portion of the entry. No two sub-tables are associated with the same sub-table key. The method stores the keys in a sub-table keys table in TCAM. Each key has a different priority. The method stores the entries for each sub-table in random access memory. Each entry in a sub-table has a different priority. The method receives a search request to perform a ternary lookup for an input data item. A ternary lookup into the ternary sub-table key table stored in TCAM is performed to retrieve a sub-table index. The method performs a ternary lookup across the entries of the sub-table associated with the retrieved index to identify the highest priority matched entry for the input data item.