Microsoft Technology Licensing, LLC

Alibaba Group Holding Limited

Zhejiang University

Alibaba Singapore Holding Private Limited

Appbugs, Inc.

Alibaba Innovation Private Limited

Rui Wang

Yu Ying Wang

Shuo Chen

Yikang Xu

Qun Guo

Wanli Min

Jiesheng Wu

Peng Xu

Qingda Lu

Michael Habben

Yu Du

Hujun Bao

Peter Byrne

Zhu Pang

Jiqiu Xu

Jinming Wang

Robin Dhananjay Dhamankar

Shaz Qadeer

Yuri Gurevich

Liang Zhu

Yixue Zhu

Xiaowei Jiang

Shuya Ye

Yuchen Zhou

Baining Guo

John Michael Snyder

Kun Zhou

Peter-Pike Johannes Sloan

Artem A Oks

Dennis Tighe

Vishal Kathuria

Mahesh K Sreenivas

Xinguo Liu

Zhong Ren

Yazhen Yuan

Weiwei Fu

Peng Song

Leigh M Stewart

Gopal Ashok

Bo Sun

Tianlei Hu

Bowen Yu

Yunjin Zhang

A client device may transmit a data stream including an object (such as a data file or record) to a storage system for storing the object in a storage device. In response to receiving the data stream, the storage system may store or write data of the object into a plurality of logical blocks of the storage device with an end-to-end data protection based at least in part on a comparison of a combination of check codes of a header of the object, the object and padding data with a combination of a plurality of check codes that are generated separately for metadata associated with the object and corresponding parts of the object stored in the plurality of logical blocks. The storage system may further provide an end-to-end data protection for reading data of an object stored in multiple logical blocks of a storage device.

End to end check code protection in storage engine

A key-value store is provided, implementing multiple-tiered sorted data structures in memory and storage, including concurrent write buffers in memory, and page-level consolidation of updates on storage, where pages are trivially translated in physical-to-virtual address mapping. The key-value store is built on an indexed sorted data structure on storage, occupying much less storage space and incurring much less disk activity in consolidating updates than a conventional log-structured merge tree organized into files. Concurrent write buffers operate concurrently and independently so that data is committed from memory to storage in an efficient manner, while maintaining chronological sequence of delta pages. Trivial mapping allows mappings of a number of physical pages to be omitted, enabling page mapping tables to occupy less storage space, and simplifying processing workload of read operation retrievals from storage.

High-performance key-value store

Methods and systems for in-memory metadata reduction in cloud storage system are provided. According to an aspect, a method comprises receiving a first command to write a data stream to a storage device; writing the data stream into a plurality of fragments having logical addresses corresponding to physical addresses on the storage device; and generating an index for individual fragment of the plurality of fragments, the index indicating information to locate the physical addresses of the individual fragment. Individual records in the individual fragment have a same pre-set logical size and all individual records in the individual fragment are continuous, and the index indicates the information including at least: an offset value of the individual record in the individual fragment; the pre-set logical size of the individual record; and a pre-set physical size of the individual record.

Method and system for in-memory metadata reduction in cloud storage system

A storage engine may obtain one or more object access properties of an object to be received, and determine a type of storage device that is suitable or desirable for storing the object from among different types of storage devices based at least in part on the one or more object access properties of the object to be received. In response to determining the type of storage device, the storage engine may allocate a storage device of such type for the object. The storage engine may then receive the object, and store the object into the allocated storage device.

Using object properties for facilitating object storage

When performing a recycling operation on a storage device, a storage system may use or create a data buffer in the storage device, and designate the data buffer to temporarily store data of data blocks to be recycled in the storage device using direct memory access (DMA) operations that are performed internally in the storage device, without the need of reading the data of the data blocks from the storage device and writing the data into a host memory of the storage system, thereby saving or reducing the consumptions of the communication bandwidth of a communication channel between the storage system and the storage device, and the memory bandwidth of the host memory.

Recycle optimization in storage engine

The present invention discloses a color contrast enhanced rendering method, device and system suitable for an optical see-through head-mounted display. The method includes: (1) acquiring a background environment in real time to obtain a background video and performing Gaussian blur and visual field correction on the video; (2) converting an original rendering color and a processed video color from an RGB color space to a CIELAB color space scaled to a unit sphere range; (3) finding an optimal rendering color based on the original rendering color and the processed video color in the scaled CIELAB space according to a set color difference constraint, a chromaticity saturation constraint, a brightness constraint and a just noticeable difference constraint; and (4) after converting the optimal rendering color back to the RGB space, performing real-time rendering by using the optimal rendering color of the RGB space. The method is widely applied and capable of obviously improving the discrimination between a virtual content and a background environment and supporting various virtual scenes and background environments without a pre-preparation process.

Color contrast enhanced rendering method, device and system suitable for optical see-through head-mounted display

A key-value engine may perform garbage collection for a tree or hierarchical data structure on an append-only storage device with page mappings. The key-value engine may separate hot and cold data to reduce write amplification, track extent usage using a restricted or limited amount of memory, efficiently answer queries of valid extent usage, and adaptively or selectively defragment pages in snapshots in rounds of garbage collection.

Garbage collection of tree structure with page mappings

A key-value engine of a storage system may perform a restart recovery after a system failure. The key-value engine may read a metadata log to locate a latest system checkpoint, and load a page mapping table from the latest system checkpoint. The key-value engine may replay to apply changes to the page mapping table from a system transaction log starting from a system transaction replay starting point. The key-value engine may further form one or more read-only replicas using an underlying file stream opened in a read-only mode during the recovery after the system failure to further facilitate fast recovery and provide fast response to user transactions that conduct read only transactions after the system failure.

Fast recovery and replication of key-value stores

A method for managing a region tag comprises: acquiring region identifier information of a geographic region; acquiring an attribute evaluation tag of the geographic region by a user in the geographic region and a time identifier of the attribute evaluation tag; integrating the region identifier information, the attribute evaluation tag, and the time identifier thereof into a region tag of the geographic region; clustering region tags to generate a region time period tag of the geographic region for a time period based on that each region tag comprises the region identifier information of the geographic region and a time identifier within the time period, wherein the region time period tag of the geographic region for the time period corresponds to a function attribute of the geographic region for the time period; and outputting region time period tags of the geographic region for time periods, respectively.

Method and apparatus for managing region tag

Systems and methods discussed herein, based on a key-value data store including multiple-tiered sorted data structures in memory and storage, implement granularly timestamped concurrency control. The multiple-tiering of the key-value data store enables resolving the snapshot queries by returning data record(s) according to granularly timestamped snapshot lookup instead of singularly indexed snapshot lookup. Queries return a merged collection of records including updates from data structures in memory and in storage, such that a persistent storage transaction may refer to non-committed updates up to a timeframe defined by the snapshot read timestamp. This way, inconsistency is avoided that would result from merely reading data records committed in storage, without regard as to pending, non-committed updates thereto. The global timestamp further modifies the generation of the local transaction commit timestamp and the local snapshot read timestamp, so as to establish a granularly timestamped concurrency control scheme (over three levels of granularity).

Granularly timestamped concurrency control for key-value store

Processes and systems described herein enable a computing device to detect compromised accounts. The computing device may obtain a user credential including a user ID, and further modify the user ID. The computing device may transmit the modified user ID to a service including a database related to compromised accounts, receive a record corresponding to the modified user ID that includes information of a compromised account, and further determine whether an account of the user ID is compromised based on the received record. Some implementations relate to the on-site provision of risk information associated with compromised accounts.

Provision of risk information associated with compromised accounts

A method for managing a region tag may comprise acquiring a region identifier information of a geographic region, acquiring an attribute evaluation tag of the geographic region by a user whose geographic position is in the geographic region and a time identifier of the attribute evaluation tag, integrating the region identifier information, the attribute evaluation tag, and the time identifier thereof into a region tag of the geographic region, and clustering region tags of the geographic region in a time domain comprising one or more time periods to generate a region time period tag of the geographic region for each time period.

The invention discloses A screen tile-pair based binocular rendering pipeline process and method, comprising: completing space division according to a spatial relationship of two visual angles in stereo rendering, and generating input primitive lists corresponding to the divided space; searching non-full primitive lists of space divisions and obtaining a surface with spatial partition; and dispatching all generated spatial divisions, and simultaneously performing rasterizing and rendering of two visual angles for primitives in each space division. According to the new measures, a spatial correlation of two visual angles in stereo rendering is considered, and in a rendering process the two visual angles are rasterized and rendered at the same time, thereby reducing a bandwidth required for repeated reading of triangular data in the rendering process.

Screen tile pair-based binocular rendering pipeline process and method

The disclosed embodiments describe a method, apparatus, and system for pushing information. In one embodiment, the method comprises: receiving dynamic spatio-temporal behavior data of a moving individual; conducting an analysis according to historical dynamic spatio-temporal behavior data of the moving individual to acquire spatio-temporal behavioral characteristics of the moving individual; determining appropriate information as matching information for the moving individual according to the spatio-temporal behavioral characteristics of the moving individual in combination with dynamic spatio-temporal behavior data of the moving individual at a current time; and sending the matching information to the moving individual. In the method of the disclosure, behavioral characteristics of a moving individual are analyzed to obtain habit and preference characteristics of the moving individual. Targeted push information is sent, thereby solving the problem of pushed information having less diversified, targeted, and not so accurate content.

Method, apparatus, and system for pushing information

The invention discloses a real-time rendering method based on energy consumption-error precomputation, comprising: determining the spatial level structure of the scene to be rendered through adaptive subdivision of the space positions and look space of the camera browsable to the user in the 3D scene to be rendered; during the process of adaptive subdivision of the space, for each position subspace obtained at the completion of each subdivision, obtaining the error and energy consumption of the camera for rendering the 3D scene using a plurality of sets of preset rendering parameters in each look subspace at each vertex of the bounding volume that bounds the position subspace, and Pareto curve of the corresponding vertex and look subspace is built based on the error and energy consumption; based on the current camera viewpoint information, searching and obtaining the target Pareto curve in the spatial level structure to determine a set of rendering parameters satisfying the precomputation condition as optimum rendering parameters to perform rendering. The present invention not only saves a great deal of energy, but also ensures the quality of rendering result and extends the battery life.

Real-time rendering method based on energy consumption-error precomputation

Growing community of inventors

Redmond, WA, United States of America

Rui Wang