Microsoft Technology Licensing, LLC

Andrew Eyring Kimball

Henricus Johannes Maria Meijer

Anders Hejlsberg

Jeffrey Robert Currier

Zhongwei Wu

Xiaoyu Wu

Arpan A Desai

David Lawrence Remy

Lev Novik

Jason Duane Clark

Ajay Kalhan

Marc Todd Friedman

Ralf Lammel

Joachim Hammer

Cihangir Biyikoglu

Istvan Cseri

Avner Y Aharoni

Tomas Talius

Michael Lee Brundage

David N Schach

Todd F Pfleiger

Asad Jawahar

Santeri Olavi Voutilainen

Tony Petrossian

Ion Vasilian

Michael Craig Champion

Brian C Beckman

Yan Valerie Leshinsky

Donald F Box

Erik Meijer

Mark W Fussell

Sergey Dubinets

Lisa Feigenbaum

Ghanashyam Chandrasekhar Namboodiripad

Olivier Michel Destrebecq

Tobias Joakim Bertil Ternström

Sravani Kothapalle

Vladimir G Sadov

Abel Valadez Martinez

Aspects of the subject matter described herein relate database virtualization. In aspects, clusters of database servers may be located at various locations of the Internet. When a client seeks to access a logical database, the client may send a logical server and logical database name in a data structure. These names may be used to find a physical server(s) and database(s) that correspond to the logical database. Once the location is determined, a proxy component is used to intercept and/or forward communications between the client and the physical server(s) and database(s) corresponding to the logical database. Using this system, a client may access data from a logical database without knowing the physical address of the logical user database.

Database virtualization

Methods, systems, and computer program products are provided for partitioning online databases. Online database operations, such as, for example, SPLIT, MERGE, and DROP, are used to alter the arrangement of partitions in a federated database. A SPLIT operation splits rows at one partition across a plurality of other partitions. A MERGE operation merges rows at a plurality of partitions in to one partition. A DROP operation shifts responsibility for rows of data from one partition to another partition and then drops the rows from the one partition.

Partitioning online databases

The present invention extends to methods, systems, and computer program products for scoping the context used to access a database partition. Embodiments of the invention enable data isolation using partitions in multi-tenant databases, while relieving client applications from dealing with the partitions. For example, a computer system that includes a distributed database system comprising a plurality of database partitions in a federation receives a context to use when performing database access operations within the distributed database system. The context identifies specified relevant portion of the federation. The computer system also receives a database access operation that is associated with the context. The computer system modifies the semantics of the database access operation in accordance with the associated context, to direct application of the database access operation to the specified relevant portion of the federation.

Scoped database connections

When a user enters text into an application, the application can utilize an auto-complete feature to provide the user with estimations as to a complete term a user is attempting to enter into the application. Visualization can be provided along with an estimation to disclose the likelihood the estimation is what the user intends to enter. Furthermore, a rationale can be provided to the user for the reason an estimation was provided to the user.

Visualization techniques for imprecise statement completion

The present invention extends to methods, systems, and computer program products for partitioning online databases. Online database operations, such as, for example, SPLIT, MERGE, and DROP, are used to alter the arrangement of partitions in a federated database. A SPLIT operation splits rows at one partition across a plurality of other partitions. A MERGE operation merges rows at a plurality of partitions in to one partition. A DROP operation shifts responsibility for rows of data from one partition to another partition and then drops the rows from the one partition.

Object instance annotation technology is disclosed. This technology is capable of annotating any number of instances for any number of objects. Object instance annotations can be of various types, and annotations can serve as data extensions. Objects are enabled for annotation either by developers, or, alternatively, automatically by a programming language or framework. Furthermore, an interface is provided for annotations. This interface has a variety of operations, some of which allow for adding, retrieving, or removing annotations. Annotations can be reference types or even value types. They may also be private class types. Once object instances are enabled for annotating, and the interface is set up, this interface can annotate a multitude of different kinds of objects. For example, it can annotate generic objects, XML trees, CodeDom trees, and so on.

Instance annotation in object-oriented programming

Memory efficient data processing is provided in a computer environment. A data representation or description is utilized to reduce memory footprint. A data structure can be serialized iteratively utilizing the representation rather than first loading the entire data structure to memory. Portions of the data structure can be materialized to and removed from memory as function of operational need.

Memory efficient data processing

Programming mechanisms for data parsing facilitate both clear code specification and efficient execution. Declarative style code can be employed to enable clear and concise specification of data parsing. Further, an efficient parsing approach can be utilized that enables processing of a data structure without first materializing the entire structure to memory. More specifically, streaming and/or selective materialization of portions of data to memory can be employed.

Streamlined declarative parsing

The subject invention pertains to a system and method of incorporating collation information into data types. In particular, the subject invention provides for parameterizing data types with collation information such that a comparison between two different collations generates a static-type error rather than a run-time error. Additionally, the invention affords for conveniently working with localized data types to allow generic parameterization over collations as well as ordinary types. In the context of strings, the present invention enables concurrent use of strings in multiple languages and facilitates the correct handling thereof.

Data types with incorporated collation information

A special syntax is developed to differentiate between accesses to a primary and one or more secondary object protocols in a programming language. The syntax allows the compiler to differentiate between the primary and secondary object model based on syntax, rather than type. The syntax is created in such a way as to approximate the syntax of the secondary object model, and allows the user to dynamically generate member names.

Syntax for members added through object protocol systems and methods

Growing community of inventors

Sammamish, WA, United States of America

Andrew Eyring Kimball