Abstract: Technologies for managing metadata of files in unstructured data storage are described. Embodiments include receiving, by selecting a set of datapath patterns. Embodiments include building an index from the selected set of datapath patterns that refers to at least one particular portion of a file path. Embodiments include receiving an identifier for the data file. Embodiments include matching the identifier to a datapath pattern of the set of datapath patterns using the index. Embodiments include determining a metadata label associated with the datapath pattern. Embodiments include associating the metadata label with the data file.

Abstract: A data generation device according to an embodiment includes one or more processors. The one or more processors classify each of a plurality of users having attributes similar to one another into any one of a plurality of clusters based on user information representing the respective attributes of the users. The one or more processors estimate whether a search result is useful to each of the users based on a similarity between information included in the search result and information representing attributes of the clusters, and output learning data of a ranking model for determining an order of a plurality of the search results, the learning data being data including the search results and estimation information representing whether the search results are useful.

Abstract: In a hierarchical storage management system including: a hierarchical storage that is provided in an individual data center and has at least one storage medium; and a hierarchical storage control apparatus that manages at least one hierarchical storage, the hierarchical storage control apparatus includes a calculation unit that performs processing for obtaining, for individual data managed by the hierarchical storage control apparatus, a storage medium in a data center that satisfies an operation policy by calculating power consumption needed for storing the data, a cost needed for storing the data, and communication time for transferring the data from a data center to a reference source area and by comparing the calculated power consumption, cost, and communication time with the operation policy set for the data.

Abstract: Provided is a system and method which may execute a find operation on a union mount via individual find operations on the underlying file systems that make up the union mount rather than perform the find operation through the union mount itself. As a result, processing time of can be significantly reduced. In one example, the method may include receiving a request for a data item to be retrieved from a union-mounted file system comprising a plurality of layers of files which have been merged together, simultaneously executing, via a file manager, a plurality of find operations on the plurality of layers, respectively, without merging the plurality of layers together, receiving a plurality of sets of search results of the plurality of find operations from the plurality of layers in response to the executing, and merging and displaying the plurality of sets of search results.

Abstract: In accordance with one or more embodiments of the invention, a method is provided for re-tiering files and folders located in a cloud-based file system without crawling all the files and folders in the cloud-based file system. The method utilizes the meta-data for the files and folders to determine, based upon provided rules, which tier a file or folder should be assigned to. By utilizing the meta-data, the use of expensive cloud resources may be minimized when there is a need for re-tiering the files and folders into appropriate cloud tiers.

Abstract: Automated event monitoring is performed utilizing a Knowledge Graph (KG) constructed by grouping and consolidation of a variety of log Entry Types. A log entry is received by a knowledge graph parser (Kg parser). That parser finds contiguous sub-strings in a log entry that have a parameterized basic-format. The parser figures out which basic-formats are present, where, and with which parameters. Given a sub-string, its basic-format and its parameters, the parser can correctly parse the sub-string to components (e.g., keys and values if a key-value format; fields if a structured format). A result of the parsing is an entity type tree structure. Next, a grouping and consolidation capability functions to modify the KG to incorporate an incoming new entry type structure. The KG may be consumed by a user (e.g., visualization; querying), and may provide an artifact to an event monitoring system to automatically trigger certain actions (e.g., alerts).

Abstract: Provided are a storage device, system, and method for throttling host writes in a host buffer to a storage device. The storage device is coupled to a host system having a host buffer that includes reads and writes to pages of the storage device. Garbage collection consolidates valid data from pages in the storage device to fewer pages. A determination is made as to whether a processing measurement at the storage device satisfies a threshold. A timer value is set to a positive value in response to determining that the processing measurement satisfies the threshold. The timer is started to run for the timer value. Writes from the host buffer are blocked while the timer is running. Writes remain in the host buffer while the timer is running. A write is accepted from the host buffer to process in response to expiration of the timer.

Abstract: A system can establish a primary file system on a block array of computer storage, wherein the block array comprises a range of addresses, wherein the primary file system is configured to address the range of addresses. The system can establish a shadowed file system on the block array, wherein the shadowed file system is configured to access portions of the block array that are unused by the primary file system. The system can, in response to receiving a request to write data to the primary file system, and in response to determining that an amount of the block array utilized by the primary file system is full, transfer a first portion of the block array utilized by the shadowed file system to the primary file system.

Abstract: A query is converted into a structured query tokenization. One or more query results visualizations for the query are determined by applying a supervised machine learning model to the structured query tokenization into which the query has been converted. Query results of the query are displayed using the determined query results visualizations.

Abstract: Embodiments of the present invention provide a computer system, a computer program product, and a method that comprises analyzing a performed query by identifying a plurality of indicative markers based on a pre-stored classification database associated with the performed query; generating a plurality of facets based on the analysis of the performed query; selecting at least two facets within the generated plurality of facets by determining a quantitative similarity value between each respective facet and the plurality of identified indicative markers associated with the performed query; dynamically ranking the selected facets by prioritizing the selected facets based on a calculated overall score associated with assigned weighted values for each selected facet in the generated plurality of facets using a supervised machine learning algorithm; and displaying the dynamically ranked facets within a user interface of a computing device associated with a user.

Abstract: The present disclosure relates to folder-based data organization method and system. The method may include obtaining a keyword hierarchy for a plurality of documents. The keyword hierarchy may be configured for organizing the plurality of documents and include a plurality of levels for the keyword hierarchy. The method may further include generating a folder directory in a data storage system based on the keyword hierarchy. A folder hierarchy of the folder directory reflects at least a portion of the keyword hierarchy and folders in the folder hierarchy are named based on corresponding keywords in the at least a portion of the keyword hierarchy. The method may further include determining a target folder for storing one of the documents in the folder directory based on the keyword hierarchy path associated with the document and storing the document to the target folder in the folder directory.

Abstract: System and methods for performing analytical operations are described. A hardware-based regular expression (RegEx) engine performs a regular expression operation on a stream of data units based on a finite automata (FA) graph. Performing includes configuring a regular expression engine of a hardware-based regular expression accelerator to, beginning at a root node in the plurality of nodes of the FA graph, step the regular expression engine through one or more nodes of the FA graph until the regular expression engine arrives at a skip node and to consume, at the skip node, two or more data units from the stream of data units before traversing one of the directional arcs to another node.

Abstract: An anomaly detection apparatus according to an embodiment of the present disclosure includes: a global tree structure creation unit configured to create a global tree structure for dividing a plurality of data pieces into a plurality of groups, a local tree structure creation unit configured to create a local tree structure for further dividing the data pieces divided into the plurality of groups for each of the plurality of groups, and a score calculation unit configured to calculate a score indicating an anomaly level of the plurality of data pieces using a depth from a root node to a leaf node of the local tree structure.

Abstract: Aspects of the present disclosure relate to systems and methods for performing targeted searching based on a user profile. In examples, a user profile including a user embedding may be retrieved based on the receipt of a user indication. The user embedding may be created based on one or more user interest. A plurality of document embeddings may be identified based on the user embedding, where each document embedding of the plurality of document embeddings is determined to be within a first distance of the user embedding. In examples, a ranking for each document embedding of the plurality of document embeddings may be generated, where the ranking for each document embedding of the plurality of document embeddings is based on the user embedding. At least one document may be recommend based on a ranking associated with a document embedding.

Abstract: Systems and methods are disclosed herein for modifying the spelling of a list of names based on a score associated with a first name. The systems and methods may receive a media asset, determine a first source of data corresponding to the media asset, and receive, from the first source of data, a list of names, each name in the list of names being associated with a respective copy of the media asset. The systems and methods may generate a reduced list of names, retrieve a criterion from storage, determine a set of scores corresponding to each name from the reduced list of names based on the criterion, select a first name from the reduced list of names based on the set of scores, and modify the spelling of a second name in the list of names based on the first name.

Abstract: Systems and methods for curation of content, such as e-learning content or online instructional materials, according to particular criteria such as the amount of pictorial representations contained therein, the amount of verbal expression contained therein, and whether the content contains a summary. Other criteria may also be employed. Users may select any one or more of these and other criteria. Content is then sorted according to the selected criteria and presented as an ordered list of content that users can select for viewing.

Abstract: The technologies described herein are generally directed toward using logical operation coalescing to concurrently update file system objects. According to an embodiment, a system can comprise a processor and a memory that can enable performance of operations including receiving a first data update from first node equipment for a first part of an entry of a data structure comprising multiple linked entries, and a second data update from second node equipment for a second part of the entry of the data structure. The operations can further include locking, by the first computing equipment, the first part and the second part of the entry. Further, the operations can include, based on the first data update and the second data update, updating, by the first computing equipment, respectively, the first part and the second part of the entry.

Abstract: Performance of a collection of machines, arranged in a linear sequence of machines that form a linear communication orbit (LCO), is monitored. Multiple machines in the LCO receive, via the LCO, a set of rules (or various subsets of the same set of rules), each rule specifying one or a combination of conditions (e.g., a performance metric and corresponding criterion) for satisfying the rule, evaluate those rules with respect to locally occurring events and local processes, and store results of those evaluations in a local database. In response to a query sent to the machines via the LCO, each of the machines returns a report, including information identifying processes whose performance during the specified time period satisfies at least one rule in the set of one or more rules. Those reports are aggregated and used to generate a merged report reflecting performance information with respect to a set of machines.

Abstract: Techniques are provided for timestamp consistency. An operation targeting a first storage object having a synchronous replication relationship with a second storage object is intercepted. A timestamp is assigned to the operation. A replication operation is created as a replication of the operation. The same timestamp is assigned to the replication operation. The operation is implemented upon the first storage object and the replication operation is implemented upon the second storage object.

Abstract: Embodiments of the technology described herein, provide improved visual search results by combining a visual similarity and a textual similarity between images. In an embodiment, the visual similarity is quantified as a visual similarity score and the textual similarity is quantified as a textual similarity score. The textual similarity is determined based on text, such as a title, associated with the image. The overall similarity of two images is quantified as a weighted combination of the textual similarity score and the visual similarity score. In an embodiment, the weighting between the textual similarity score and the visual similarity score is user configurable through a control on the search interface. In one embodiment, the aggregate similarity score is the sum of a weighted visual similarity score and a weighted textual similarity score.