Microsoft Technology Licensing, LLC

Expedia, Inc.

Arthur Francis Champernowne

David T Jones

John Bradstreet

Paul Rolland Bonneau

Darrell A Plank

Described herein is a sparse tree data structure that may be utilized to selectively retrieve database records containing information relevant to an obtained query. Specifically, the sparse tree data structure may be utilized to prevent combinatorial explosion that may occur where responses to an obtained query requires a combination of information from multiple records. Rather than explicitly enumerate all possible combinations, the sparse tree data structure enables implicit enumeration of those combinations to determine combinations of highest relevancy. In one embodiment, the sparse tree implements a specific algorithm within the 'branch-and-bound' algorithmic paradigm to reduce the time and computational resources required to response to a query.

Sparse tree data structure for selective retrieval of database records

The present invention provides a method, apparatus and system for processing fare queries to find the best fares. In one embodiment of this invention a query server utilizes a branching and bounding based technique to implicitly enumerate possible solutions to arrive at best fare solutions.

Optimized system and method for finding best fares

A method for performing pixel addressing operations for a tiled image. The method maintains separate X and Y components of a pixel address in a tiled image. Each component includes a tile and pixel index spaced apart by blank bit fields such that when combined, the X and Y components form a pixel address that is directly dereferenced to read or write a pixel in the tiled image. To decrement or increment the X or Y component, the method introduces a mask such that any carry bit can be moved across the blank bit field between the tile and pixel indices. This enables the method to use the same efficient add/subtract and mask operations whether or not a pattern of pixel accesses crosses a tile boundary. The X and Y components are represented as virtual X and Y coordinates in a two-dimensional array of pixels to hide the details of the add/subtract and mask operations from the programmer.

Method for performing pixel addressing operations for a tiled image

A method and apparatus for painting a digital picture using strokes of a digital brush is provided. The painting strokes entered by a user is handled using a 'lazy' processing approach, in which a region of the picture being painted is updated according to the entered strokes only when that region is to be displayed for viewing. To this end, the painting strokes are recorded as an ordered sequence of painting steps. The digital picture being painted is partitioned into a plurality of individual regions, and each region is assigned an age which indicates a painting step in the ordered sequence that is last applied to that region. When a region becomes visible, i.e., it is displayed for viewing, the age of the region is checked, and all of the painting steps in the ordered sequence that are after the step indicated by the age of the region are then applied to the region so that it becomes up-to-date. The age of that region is updated accordingly.

Growing community of inventors

Seattle, WA, United States of America

Arthur Francis Champernowne