Techniques for cloning, writing to, and reading from file system metadata. Cloning involves identifying a first set of pointers included in a first root node in a file system metadata tree structure that stores file system metadata in leaf nodes of the tree structure, creating a first copy of the first root node that includes the first set of pointers, creating a second copy of the first root node that includes the first set of pointers, associating the first copy with a first view, and associating the second copy with a second view. Reading generally involves traversing the tree structure towards a target leaf node that contains data to be read. Writing generally involves traversing the tree structure in the same manner, but also creating copies of any nodes to be modified if those nodes are deemed to have a different treeID than a particular root node.

A method and system associate conditional formats with selected data points or groups of data points within a summary table. In one embodiment, related groups of data are determined based upon currently highlighted cells in a summary table. A user then selects from the groups and identifies conditional formats to be associated with the specified data points. The conditional formats are associated with currently displayed as well as non-displayed data within the summary table. The associated conditions are saved relative to the data points rather than the original cell positions so that the conditions remain associated with the data points following a reorganization of the summary table.

Store data chunks associated with data objects to data store files. Determine for each of the data store files reference counts for each of the data chunks indicating number of data objects associated with respective data chunks. Move data chunks to one of the data store files based on whether respective reference counts of respective data chunks exceeds a threshold.

Systems and methods are disclosed for stateless stream handling and resharding. In one implementation, a first shard including one or more messages is generated. The first shard is associated with a first shard version attribute. The first shard and the first shard version attribute are provided as a first atomic update within a data stream. The first shard is resharded into at least a second shard. The second shard is associated with a second shard version attribute. The second shard and the second shard version attribute are provided as a second atomic update within the data stream.

Technology is described for data archiving in a service provider environment. A first archive data package may be received from an archival data store in the service provider environment. The first archive data package may include first data blocks and first key block data. Second data blocks and second key block data may be received from a source data store in the service provider environment. Merged data blocks may be created by combining the first data blocks with the second data blocks. The merged data blocks may be sent to the archival data store while merged key block data is being created. The merged data blocks and the merged key block data may be included in a second archive data package that is stored at the archival data store.

A query processing method includes decomposing an SQL into logical plans based on data source feature information, to obtain a logical plan set, where the data source feature information is stored in an internal data source feature library of a query engine, and the internal data source feature library is stored in cache space of the query engine; generating physical plans for the logical plan set based on the data source feature information, to obtain a physical plan set; determining query costs of the physical plan set based on the data source feature information, to obtain a physical plan with a highest priority; and executing the physical plan with the highest priority, to obtain a query result queried by a user. A data source registration method and a query engine is further disclosed.

A method for to manage concurrent access to a shared resource in a distributed computing environment. A reference counter counts is incremented for every use of an object subtype in a session and decremented for every release of an object subtype in a session. A session counter is incremented upon the first instance of fetching an object type into a session cache and decremented upon having no instances of the object type in use in the session. When both the reference counter and the session counter are zero, the object type may be removed from the cache.

A computing device can receive communications sent using one or more communication modalities. The communications can be determined to be a single interaction. A communication object can be generated for the single interaction with a structure being consistent across different communication modalities. A policy can be identified that defines which communication objects to review. The communications can be reviewed along with one or more additional communications similar to the communication object.

One or more computing devices, systems, and/or methods for automated materialized view table generation and maintenance are provided. A log, comprising queries and latencies of processing the queries, is evaluated to identify a list of combinations of fields that occur greater than a threshold frequency and/or occur in queries having latencies greater than a threshold latency. A materialized view generation script is executed against a main database to generate a materialized view table associated with a combination of one or more fields from the list. A middleware component is configured to selectively direct a query to the main database or to the materialized view table based upon whether the materialized view table comprises preliminary query results for fields specified by the query.

The present teaching relates to a method, system and programming for recovering a data storage. In response to a failure of the data storage, a last checkpointed version is retrieved from a checkpoint file created previously for the failure of the data storage. A recovery table is updated to indicate the last checkpointed version and an incarnation number indicating a number of previous recovery of the data storage. The data storage is recovered based on the recovery table. A version number of the last checkpointed version is reset to zero upon a successful recovery of the data storage. The incarnation number is incremented.