Embodiments of the present disclosure relate to a method for closing a plurality of webpages in a browser. According to the method, one or more records are acquired in response to receiving an instruction to close a first webpage. Each record comprises at least two URLs having a parent-child relationship. A URL chain of the first webpage is acquired based on the acquired one or more records in response to receiving an instruction to close a plurality of webpages related to the URL chain. The URL chain consists of a plurality of URLs having a multi-level parent-child relationship. The plurality of webpages related to the URL chain are closed.

Method and system are provided for storage handling guidance for host input/output (I/O) operations. The method includes: providing a guidance array of indications of storage operations handling instructions, the guidance array having multiple dimensions of performance characteristics with each dimension having multiple levels; and associating a reference vector with one or more I/O operations, wherein the reference vector points to a level for each dimension of the array to obtain an indication of a storage operations handling instruction at an intercept of the dimension levels for application by a storage system controller for the one or more I/O operations.

Systems and methods are provided for generating a plurality of documents for a seed keyword, generating candidate keywords from extracted words of the plurality of documents, ranking the candidate keywords by a frequency with which each candidate keyword appears in a particular document of the plurality of documents and a frequency with which each candidate keyword appears across all of the plurality of documents, and determining a selection of the ranked candidate words to store as selected keywords.

Methods, apparatus and computer program product for generating tiered search index fields based on a divided group-based communication data corpus in a group-based communication platform are described herein. In some embodiments, the system provides for receiving a group-based communication data corpus, generating a retrieval score, and assigning each group-based communication data object associated with a retrieval score. Each group-based communication data object may meet or exceed a retrieval score threshold of a high retrieval probability corpus. Each group-based communication data object associated with a retrieval score below the retrieval score threshold may be assigned to a low retrieval probability corpus. High and a low retrieval probability search index fields may be generated and associated with the high and low retrieval probability corpus.

A memory device includes a memory cell array including a plurality of memory cells on which a programming loop is executed a plurality of times; a voltage generator configured to apply a verifying voltage to the memory cells, for verifying at least one programming state of the memory cells; and a voltage controller configured to control the voltage generator to change a level of the verifying voltage as a program loop count increases, based on temperature information about a temperature inside or outside the memory device.

Techniques are provided for managing objects within an object store. An object is maintained within an object store. In an embodiment, a rule is enforced for the object that in-use slots of the object are non-modifiable and unused slots of the object are modifiable. Metadata of additional information for a slot within the object is attached to the object header. A first application allowed to access user data within the slot is provided access to the user data without being provided access to the metadata. A second application allowed access to the user data and the additional information is provided with access to the user data and the metadata for identifying a location of additional information within the object.

Herein are computerized techniques for processing a heterogeneous graph according to scan-avoidant query planning. In an embodiment, a computer respectively stores a first and second kind of vertices of a property graph into a first and second vertex tables. The computer generates, without scanning the second vertex table: a) an initial partial result of a query of the property graph based on the first vertex table, and b) a subsequent partial result of the query based on the initial partial result and the second kind of vertices. Herein are graph encodings that are dense, without requiring extra computation, and that exploit graph heterogeneity to achieve an aggregation granularity that reduces data working set scope, optimizes for caching, and encourages compression. Herein are query execution mechanisms and techniques that intelligently avoid accessing circumstantially extraneous data and/or structures and that can horizontally scale.

A data storage system performs partial compression and decompression of a set of memory items. The memory items each include a data block and a tag with a prefix making up at least part of the tag. The memory items are ordered based on the prefixes. A code word is created containing compressed information representing values of the prefixes for the set of memory items. The code word and block data for each of the memory items are stored in a memory. The code word is decompressed to recover the prefixes.

Embodiments relate to processing a data set stored in a computer system. In one aspect, a method of processing a data set stored in a computer system includes providing one or more parameters for quantifying data quality of the data set. A processor generates, for each parameter of the one or more parameters, a reference pattern indicating a dysfunctional behavior of the values of the parameter. The data set is processed to obtain values of the one or more parameters. A parameter of the one or more parameters is identified whose obtained values match a corresponding reference pattern of the generated reference patterns. The identified parameter is assigned a resource weight value indicating the amount of processing resources required to fix the dysfunctional behavior of the identified parameter.

Systems, methods, and related techniques and apparatus containing instructions which when executed by one or more computing devices for determining dataset rankings by determining, from the lineage order requirement, one or more first lineage level datasets from the collection of datasets, generating one or more first lineage level asset ranks respectively for each one of the one or more first lineage level datasets, determining at least one second lineage level dataset having an outflow to the one or more first lineage level datasets, and generating a first dataset rank for the at least one second lineage level dataset as a first function of the outflow and at least one of the one or more first lineage level asset ranks.