Abstract: A system for indexing and searching includes an input interface and a processor. The interface is to receive a request to search for a term. The processor is to determine a search response based at least in part on a security associated with an index field and the term.

Abstract: Techniques for use in identifying one of more concepts in a knowledge representation (KR). The techniques include obtaining user context information associated with a user, wherein the user context information comprises a plurality of words; Also included are semantic disambiguation techniques comprising obtaining user context information associated with a user, wherein the user context information comprises a first portion and a second portion different from the first portion; and disambiguating between a first and second concept in a knowledge representation (KR) associated with a first meaning of the first portion. Semantic disambiguation techniques further include obtaining user context information associated with a user, wherein the user context information comprises a first portion and a second portion different from the first portion; and disambiguating between a first concept and second concept in a knowledge representation (KR) using a measures of dominance and semantic coherence.

Abstract: Methods for automating a submission of a compliance filing from an organization to a regulatory authority. Methods may include enhancing compatibility of a document submitted by an entity to an organization with the latter's database to facilitate automated submission of a compliance document. Methods may include receiving a populated document in a first format from the entity, using a processor to digitize the document into a digital format, such as bytes, and further into a second format, where the first format may not be compatible with the database and the second format may be compatible with the database. Methods may include updating the database with data from the document. Methods may include using the processor to run a statistical model to determine an appropriate compliance filing relating to change in information about the entity, to populate the compliance filing, and to submit the completed compliance filing with the regulatory authority.

Abstract: Compressing files is disclosed. An input file to be compressed is first aligned. During or prior to aligning the input file, hyperparameters are set, determined, or configured. The hyperparameters may be set, determined, or configured to achieve a particular performance characteristic. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

Abstract: Computer-implemented methods and systems are disclosed for receiving and indexing a plurality of files for later querying, for dynamically generating scripts to be executed during a query of a data store, and for horizontally distributing a query and aggregating results of the distributed query.

Abstract: Computer-implemented methods and systems are disclosed for receiving and indexing a plurality of files for later querying, for dynamically generating scripts to be executed during a query of a data store, and for horizontally distributing a query and aggregating results of the distributed query.

Abstract: A device for managing key-value (KV) data in non-volatile memory, includes a controller and volatile memory storing a hash table. The controller generates a first key from a KV pair, reads a first entry of the hash table based on the first key, reads, based on the first entry, a first page including a set of KV hash entries each containing a location of the non-volatile memory, determine whether the number of entries of the first page reaches a predetermined number, and in response to determining that the number of entries of the first page reaches the predetermined number, store KV data corresponding to the KV pair in a location of the non-volatile memory, write a KV hash entry containing the location of the non-volatile memory, and write a location of the KV hash entry in a second entry of the hash table.

Abstract: Systems and methods for reducing read application in a virtual storage system are provided. According to one embodiment, heuristic data may be tracked and utilized in real-time by a file system of the virtual storage system at the level of granularity of a volume, thereby allowing a fast path flag to be enabled/disabled at a volume level during various phases of operation of a workload. The heuristic data for a given volume may be indicative of a correlation between (i) data blocks stored on the given volume being located within a compressible zone of a zoned checksum scheme and (ii) the respective data blocks containing compressed data and a corresponding checksum. Based on the heuristic data, read requests may be selectively directed to the read path (e.g., a fast path or a slow path) expected to mitigate read amplification when data compression is enabled for a zoned checksum scheme.

Abstract: Query execution on compressed in-memory data includes receiving, at a processor of an instance of a distributed in-memory database, a query for data from a table stored in the distributed in-memory database as compressed table data, obtaining results data responsive to the query from the table, and outputting the results data for presentation to a user. Obtaining results data includes allocating memory to identify allocated memory for decompressing the compressed table data, obtaining uncompressed table data by decompressing the compressed table data into the allocated memory, and obtaining the results data from the uncompressed table data. The allocated memory is deallocated in response to obtaining the results data. Compressing a table to form compressed table data is also described.

Abstract: In some examples, a computer system may receive a plurality of chunks of data of a data object. The system may compress the plurality of chunks of data to obtain a plurality of compressed chunks, and may determine whether the plurality of compressed chunks together are less than a threshold size. Based on determining that the plurality of compressed chunks together are less than the threshold size, the system may add, to respective entries in a map data structure, respective sizes of the plurality of compressed chunks. In addition, the system may compact the map data structure by combining values in at least two of the respective entries, and may store the plurality of compressed chunks and the compacted map data structure.

Abstract: Systems, computer program products, and methods are described herein for event-driven batch processing with granular operational access. The present disclosure is configured to retrieve, from one or more feature databases, one or more attributes to process one or more records associated with a first batch cycle; retrieve, from one or more configuration databases, one or more resources associated with the one or more records; generate a dashboard interface for the one or more records, wherein the dashboard interface comprises the one or more attributes, the one or more resources, and one or more operational access parameters associated with the processing of the one or more records; and provide, to a user input device associated with a user, the dashboard interface.

Abstract: A computing device may include a memory configured to store instructions and a processor configured to execute the instructions to receive a selection of a content catalog item or a search query from a user; generate an input vector based on the selected content catalog item or the search query; and map the generated input vector onto one or more points on a self-organizing map associated with the user. The processor may be further configured to select a set of points within a particular distance of the one or more points; reverse map the selected set of points to a plurality of content catalog items using the self-organizing map associated with the user; and present one or more of the plurality of content catalog items to the user as recommended content catalog items for the user.

Abstract: A logging management server is provided for enhanced centralized monitoring of cloud computing platforms. The processor is configured to receive logging data sub-streams from the cloud computing platform. Each of the logging data sub-streams includes compressed logging data. The processor is also configured to apply a transformation function to each of the logging data sub-streams to obtain a transformed centralized logging data stream. The processor is further configured to transmit the transformed centralized logging data stream to write to a centralized object storage container. The processor is also configured to decompress a portion of the compressed logging data of the centralized logging data stream. The processor is further configured to identify the appended account identifier and the appended log group associated with the decompressed portion of logging data. The processor is also configured to route the decompressed portion of logging data to a sorted object storage container.

Abstract: A query is preprocessed for features identified by a Data Manipulation Language (DML) in the text of the query. A machine-learning algorithm uses the features as input and provides as output a predicted query parsing execution time needed by a query parser to parse the query. The predicted query parsing time is provided as input to a query optimizer. The query optimizer uses the predicted query parsing time as a factor in optimizing a query execution plan for the query. Subsequently, the query execution plan is executed against a database as the query.

Abstract: Various embodiments are described for tracking and enabling access to information about key access patterns for database tables managed by a database service of a service provider network. Storage nodes can store data as key-value pairs (or key-document pairs), where the records or documents of a database are addressed by a unique key for each record. The storage nodes over time receive requests to perform various operations (for example, to get, put, update, or delete data in a table) associated with records stored by the storage nodes. Key access information extractors collect information regarding the keys accessed and send the information to a key tracking service. Key tracker nodes of the service can collect the data and send it to aggregator nodes. The aggregator nodes can determine a frequency with which such requests are received for keys of a partition or table to which the aggregator node is assigned.

Abstract: Systems and methods of determining physical capacity of logical space units are disclosed. The method populates a first smart filter to track a physical capacity of a first logical space unit (LSU). The method adds fingerprints from the first LSU to register(s) of the first smart filter. The method populates a second smart filter to track fingerprints deleted by garbage collection (GC). The method adds the deleted fingerprints to register(s) of the second smart filter. Using the first and second smart filters, the method determines an intersection cardinality of the first LSU and the deleted fingerprints. The method determines a cardinality of unique fingerprints in the first LSU based on the intersection cardinality of the first LSU and the deleted fingerprints. The method determines the physical capacity of the first LSU based at least on the cardinality of unique fingerprints in the first LSU.

Abstract: A decompression apparatus comprises a number of stages including: a first stage which always reads a binary symbol from a first stage indicator file for each symbol which is to be decoded; one or more mid stages which conditionally read a binary symbol from successive indicator files based on the value of the last symbol read from a previous indicator file; and a final stage which conditionally reads a symbol from a reduced file based on the value of the last symbol read from the last stage indicator file.

Abstract: In general, embodiment relate to a method for provisioning a plurality of client application nodes in a distributed system using a management node, the method comprising: creating a file system in a namespace; associating the file system with a scale out volume; mounting the file system on a metadata node in the distributed system, wherein mounting the file system comprises storing a scale out volume record of the scale out volume; storing file system information for the file system in a second file system on the management node, wherein the file system information specifies the file system and the metadata node on which the file system is mounted; wherein storing the file system information triggers distribution of the file system information to at least a portion of a plurality of client application nodes.

Abstract: This disclosure generally covers systems and methods that create sequential segments from analytics data to enable investigation of events that occurred before or after a certain sequence of events—that is, pre-sequence or post-sequence events. In particular, certain embodiments of the disclosed systems and methods receive a segment query of certain analytics data to identify events that occurred before or after a defined sequence of events within a network and—in response to the segment query—provide a query result that identifies pre-sequence events or post-sequence events. By providing such query results, the disclosed systems and methods enable users to examine correlations between a sequence of events and any pre-sequence or post-sequence events, including any data associated with those events at a granular level.

Abstract: An apparatus manages a data storage device storing data entries. The apparatus includes the data storage device configured to store a log-structure comprising segments each storing data entries, each data entry including a data field storing data and a time parameter indicative of an age of the data stored in the data field, and a processor configured to modify data stored in the data field of a certain data entry of a certain segment of the log-structure, and update the time parameter of the certain data entry according to the modified data. Modifying the data stored in the data field of the segment of the log-structure improves computational performance in comparison to, for example, other methods that append new and/or modified data to the single log head of the log-structure, which causes contention for the concurrent write operations.