Abstract: A data item identification service may use locality sensitive hashing to identify data items which are relevant to a search based on a hash of a search vector based on the search. Hashes of vectors based on data items may be stored using a set of bitmaps, where a given bitmap corresponds to a given bit position of a hash. Data items with matching or similar hashes may be related to each other. The data item identification service may perform searches by generating a hash for a search vector and comparing the hash to hashes for data items using one or more logical operations on the set of bitmaps to identify related data items.

Abstract: Techniques for document sorting with bitmap indexes are described. A request to sort a set of documents is received. A bitmap that identifies the set of documents to be sorted is obtained. An ordered set of sort bitmaps is obtained, each sort bitmap in the ordered set of sort bitmaps corresponding to a bit in an encoding of a data type to be sorted. A series of passes of bitwise operations is performed with the ordered set of sort bitmaps, each pass to identify a next document identifier to add to a sorted set of document identifiers by processing an initial bitmap with bitwise operations in order against at least a portion of the ordered set of sort bitmaps. The initial bitmap of the first pass in the series of passes is initialized with the obtained bitmap. The sorted set of document identifiers is stored.

Abstract: Devices, systems, and methods for tokenizing search attributes and terms of a search query for an index-based search. A method may include receiving, by a search service of a provider network, a first search query to search a first searchable document set, the first search query including a first search term in a first language; applying a first tokenization rule to identify the first search term in the first search query; determining that the first search term is in the first language; applying a second tokenization rule to tokenize the first search term based on the first search term being in the first language; causing a launch of a search instance by a managed compute service of the provider network, the search instance to execute a search function for a keyword-based text search using the tokenized first search term.

Abstract: Devices, systems, and methods for tokenizing search attributes and terms of a search query for an index-based search. A method may include receiving, by a search service of a provider network, a first search query to search a first searchable document set, the first search query including a first search term in a first language; applying a first tokenization rule to identify the first search term in the first search query; determining that the first search term is in the first language; applying a second tokenization rule to tokenize the first search term based on the first search term being in the first language; causing a launch of a search instance by a managed compute service of the provider network, the search instance to execute a search function for a keyword-based text search using the tokenized first search term.

Abstract: Embodiments of an application programming interface (API) for a Storage Area Network (SAN) access layer. A SAN may include a SAN access layer as an interface between SAN components and client applications. A SAN access layer API may be provided which enables a client application to access SAN access layer functionality such as storage management and configuration services. Through the SAN access layer API, a client application may invoke some or all of the functionalities of the SAN access layer. The SAN access layer may provide SAN information gathered from the SAN to the client application through the SAN access layer API. Embodiments of the SAN access layer API may provide security and licensing restrictions to client applications. Embodiments of the SAN access layer API may encapsulate message conversion and network transport functions so that client application developers are not required to implement these functions.

Abstract: A process and system for analyzing executable portion of computer code for processors with unprotected pipelines is provided. The process assumes a worst set of current processor states; analyzes plural control paths for possible hazards by computing an induced set of processor states after executing a computer instruction; and adjusts the worst set of current processor states based on program annotations to the computer instruction.