Microsoft Technology Licensing, LLC

Srikanth Avadhanam

Nigel Robin Ellis

Amar Nalla

Rodger N Kline

Campbell Bryce Fraser

Gustavo A Plancarte

Vijay B Kurup

Edvardas V Budrys

Gandhinath Swaminathan

Jeffrey D Richey

Ajay Kalhan

Srikumar Rangarajan

Milind Madhukar Joshi

Gagan Chopra

Zhonghua Chu

Tanya L Swartz

Tsvi M Reiter

Vladimir Y Sergeyev

Application program interfaces (APIs), schemas and procedures manage multiple sessions within a server system has a create session request call for establishing a session between a client and a server within the server system. Each of plurality of sessions among the servers is persisted within a database operatively coupled to the servers. Each session is associated with a unique session identification which uniquely identifies the session among the plurality of sessions. A management request call for managing one of the sessions is performed according to the unique session identification.

Server session management application program interface and schema

A method and system for maintaining date and time information correctly across rule changes for time zones is provided. A time maintenance system provides rules for converting dates and times between various time zones and a common time zone. When the time maintenance system receives a date and time in a designated time zone, it converts the date and time to a date and time in the common time zone based on a provided rule. The time maintenance system then stores the converted date and time along with an identification of the rule used to convert the date and time to the common time zone. The time maintenance system may then receive an indication of an overriding rule that overrides an existing rule for converting a date and time between the designated time zone and the current time zone. The time maintenance system then updates the stored date and time when the rule has been overridden in such a way as to indicate that the original date and time is no longer correct and to indicate the new rule.

Maintaining date and time with time zone rule changes

Concurrency control between multiple data transactions involving the same data includes comparing the version identifications which uniquely identify versions of the data during a read request and during a write request of a data transaction. An exception is thrown if the version identifications do not match, and the exception is handled within the data transaction.

Concurrency control within an enterprise resource planning system

Importation of data records organized within tables from a source system to a target system while preserving relationships among data records of the tables when record identification values identifying each data record have been changed during importation includes, using the same database query on an entire table to update each record identification references that refers to a data record in another table.

Set-based data importation into an enterprise resource planning system

The present system aggregates information from a plurality of different context sources. The present system also makes that aggregated information available to requesting components by abstracting it into a generalized form. Thus, the developer of a context-aware application need only know how to interact with the context service of the present invention, rather than knowing how to interact with each and every one of the context sources.

Context service system

A compressed trie has nodes including multiple character sub-strings. Such multiple character storage reduces the number of nodes in the trie, thereby reducing the amount of memory required for storing the trie and reducing the amount of time required to perform matching. Furthermore, in such a compressed trie, sub-strings are stored in a single character string. Each node references its corresponding sub-string by the sub-string's starting position and length in the character string. Multiple nodes may reference a single sub-string. Thus, referencing rather than storing sub-strings in corresponding nodes eliminates repetitive sub-string storage, thereby reducing the amount of memory required for storing the trie.

System and method for using a compressed trie to estimate like predicates

A method and system for creating an index for a database table of records in a computer environment having a plurality of processing units wherein each processing unit has access to the database table. The method first determines partition delimiters wherein each partition delimiter separates the database table into non-overlapping partitions of records. Each of these partitions is dedicated to one processing unit for index creation. Next, each processing unit independently creates a sub-index, i.e., different processing units create at least two sub-indexes. Last, the method merges the sub-indexes together to create a final index related to the database table.

Method and system for creating a database table index using multiple processors

Systems and methods create and maintain a maxdiff histogram for use in determining query costs. One aspect of the system is a data structure that provides fields that can be used to accurately represent a distribution of data regardless of the uniformity or lack thereof of the data. The fields of the data structure represent buckets in the histogram. The fields include a range_Hi_Key field indicating the upper bound for values represented by the bucket. The range_Hi_Key field is also the most frequently occurring value in the bucket. In addition, the fields include a cardEQ field representing the count of the most frequently occurring value, a cardLT field, which is the count of the values in the bucket that are less than the range_Hi_Key field, a LTDistinct field, which is a count of the number of distinct values represented by the bucket, and an LTDensity field, which is an average count for each of the attribute values in the bucket that are not the range_Hi_Key value. A further aspect is a method that creates and maintains the maxdiff histogram data structure. The method starts by creating a list of unused buckets. An input stream of attribute values is sorted and the following acts are performed for each value. If the new value is the same as the previous value, the cardEQ field is incremented. If not, the method checks to see if the histogram is full. If a bucket is available, it is allocated and the bucket fields are initialized. If a bucket is not available, the two buckets that have the least variance between them are merged into one bucket, and the freed bucket is made available for the newly read input value. Whenever a new bucket is created or altered, the variance between the bucket and its neighbors is recalculated.

Growing community of inventors

Redmond, WA, United States of America

Srikanth Avadhanam