Abstract: Data base performance is improved using write-behind optimization of covering cache. Non-volatile memory data cache includes a full copy of stored data file(s). Data cache and storage writes, checkpoints, and recovery may be decoupled (e.g., with separate writes, checkpoints and recoveries). A covering data cache supports improved performance by supporting database operation during storage delays or outages and/or by supporting reduced I/O operations using aggregate writes of contiguous data pages (e.g., clean and dirty pages) to stored data file(s). Aggregate writes reduce data file fragmentation and reduce the cost of snapshots. Performing write-behind operations in a background process with optimistic concurrency control may support improved database performance, for example, by not interfering with write operations to data cache. Data cache may store (e.g., in metadata) data cache checkpoint information and storage checkpoint information. A stored data file may store storage checkpoint information (e.g.

Abstract: Data base performance is improved using write-behind optimization of covering cache. Non-volatile memory data cache includes a full copy of stored data file(s). Data cache and storage writes, checkpoints, and recovery may be decoupled (e.g., with separate writes, checkpoints and recoveries). A covering data cache supports improved performance by supporting database operation during storage delays or outages and/or by supporting reduced I/O operations using aggregate writes of contiguous data pages (e.g., clean and dirty pages) to stored data file(s). Aggregate writes reduce data file fragmentation and reduce the cost of snapshots. Performing write-behind operations in a background process with optimistic concurrency control may support improved database performance, for example, by not interfering with write operations to data cache. Data cache may store (e.g., in metadata) data cache checkpoint information and storage checkpoint information. A stored data file may store storage checkpoint information (e.g.

Abstract: Data base performance is improved using write-behind optimization of covering cache. Non-volatile memory data cache includes a full copy of stored data file(s). Data cache and storage writes, checkpoints, and recovery may be decoupled (e.g., with separate writes, checkpoints and recoveries). A covering data cache supports improved performance by supporting database operation during storage delays or outages and/or by supporting reduced I/O operations using aggregate writes of contiguous data pages (e.g., clean and dirty pages) to stored data file(s). Aggregate writes reduce data file fragmentation and reduce the cost of snapshots. Performing write-behind operations in a background process with optimistic concurrency control may support improved database performance, for example, by not interfering with write operations to data cache. Data cache may store (e.g., in metadata) data cache checkpoint information and storage checkpoint information. A stored data file may store storage checkpoint information (e.g.

Abstract: Data base performance is improved using write-behind optimization of covering cache. Non-volatile memory data cache includes a full copy of stored data file(s). Data cache and storage writes, checkpoints, and recovery may be decoupled (e.g., with separate writes, checkpoints and recoveries). A covering data cache supports improved performance by supporting database operation during storage delays or outages and/or by supporting reduced I/O operations using aggregate writes of contiguous data pages (e.g., clean and dirty pages) to stored data file(s). Aggregate writes reduce data file fragmentation and reduce the cost of snapshots. Performing write-behind operations in a background process with optimistic concurrency control may support improved database performance, for example, by not interfering with write operations to data cache. Data cache may store (e.g., in metadata) data cache checkpoint information and storage checkpoint information. A stored data file may store storage checkpoint information (e.g.

Abstract: Technologies for assigning a user-generated issue report to an appropriate team for investigation are disclosed. A log file associated with an issue report is parsed to create an object model. The object model is a hierarchy of objects containing data emitted over time by a computer application associated with the issue report. Rules analyze the content of the object model, and when a rule is satisfied, the issue report is assigned to a team associated with the rule for investigation. Rules may access objects in the object model on a per-component level, thereby allowing issues to be assigned to teams at the level of individual components. Rules may also perform a root cause analysis of the issue based on the object model.

Abstract: Technologies for assigning a user-generated issue report to an appropriate team for investigation are disclosed. A log file associated with an issue report is parsed to create an object model. The object model is a hierarchy of objects containing data emitted over time by a computer application associated with the issue report. Rules analyze the content of the object model, and when a rule is satisfied, the issue report is assigned to a team associated with the rule for investigation. Rules may access objects in the object model on a per-component level, thereby allowing issues to be assigned to teams at the level of individual components. Rules may also perform a root cause analysis of the issue based on the object model.

Abstract: Techniques are described for streaming video content between computing devices. For example, a computing device can stream encoded video content to one or more receiving devices. The computing device can detect whether video content to be encoded is static content or dynamic content and switch the coding structure accordingly. For example, if the video content is determined to be static video content, then the static content can be encoded using a first predictive coding structure in which the first video frame is encoded as a single key frame and subsequent video frames are encoded as predicted frames that are non-reference frames and that only reference the single key frame. If the video content is determined to be dynamic video content, then the dynamic content can be encoded using a second predictive coding structure different from the first predictive coding structure.