Microsoft Technology Licensing, LLC

Informix Software, Inc.

Other

International Business Machines Corporation

Robert H Gerber

Holly Knight

Paul Sherwood Taylor

Shyamalan Pather

Anurag Kashyap

Niranjan Nilakantan

Vincent H Curley

Praveen Seshadri

Vishal Kathuria

Samuel H Smith

Murali M Krishna

Charles Tete Mensa-Annan

Shahaf Abileah

Mark T Nelson

Hannes A Spintzik

Sanket Atal

Diane L Davison

James Robert Hamilton

Balan Sethu Raman

Murali R Krishnan

Thomas J Miller

Michael Anthony Faoro

Stephen E Dossick

Philip Lawrence Garrett

Shrinivas Ashwin

John F Ludeman

Yixue Zhu

Darryn Owen Lavery

Prakash Sundaresan

Gerald K Bortvedt

Shengsong Ni

Scott Alan Shurts

Methods, systems, and computer-readable media are disclosed for transitioning clones and clone data access maps in response to node or media failure without blocking queries. In a system, a data request interface is configured to receive a query to access data at a storage device. Data management logic is configured to access clone state information of a plurality of clones including clones in a static state and clones in a transitory state. The data management logic is further configured to process the query to access the data according to the dynamic clone data access map, with functional correctness maintained.

Transitioning clone data maps and synchronizing with a data query

Mechanisms and techniques for database fragment cloning and management are provided. A database object, such as a table, rowset or index, is divided into fragments. Each fragment is cloned to create cloned fragments, which operationally are substantially identical to one another. One or more of the cloned fragments may be designated as a primary cloned fragment for performing database operations or as a secondary cloned fragment for serving as backup. Updates to each fragment are implemented on the primary cloned fragment and are then propagated from the primary cloned fragment to the corresponding secondary cloned fragments. A cloned fragment can go offline, becoming unavailable to be updated. When the cloned fragment returns online, the cloned fragment is refreshed with data included in the primary cloned fragment. While being refreshed, the cloned fragment may continue to be updated. The cloned fragment is eligible to be designated as a primary cloned fragment when the refreshing process has been completed.

Database fragment cloning and management

A distributed server system may include a primary manager, one or more backup managers communicatively coupled to the primary manager, and one or more workers communicatively coupled to the one or more backup managers. The one or more backup managers may receive a command to backup the state of the distributed server system. The backup managers may forward work tasks to the one or more communicatively coupled workers. The backup managers may further aggregate responses received from the one or more communicatively coupled workers and send the aggregated response to the primary manager.

Message forwarding backup manager in a distributed server system

The present systems and methods disclose a system for personalizing computer functionality. End-users are provided with tools to easily write rich and complex preferences, for example, by using a plurality simple IF-THEN propositional logic. The preferences are then transformed into queries and executed efficiently on structured data. Preferences that are satisfied then execute actions such as providing notification or storing data in a particular folder. Furthermore, according to an aspect of the invention, data, logic, events, inter alia, are all schematized, thereby enabling sharing of data between application components and across applications.

System and method for preference application installation and execution

A rules-based software architecture that provides the infrastructure for the definition and execution of end-user rules logic. This enables end-user automation of data in a unified storage platform using simple IF-THEN rules. The architecture includes a monitoring component that tracks items associated with the data, and a rules component interfaces to the rules component, and employs metadata associated with the tracked items to provide for automated handling of a subset of the items. The system further provides for defining virtual collections and items in the system using content based logic. The system further comprises one or more trigger components that sets items and collections of items dynamically active as a function of trigger logic. Additional components can include a constraint component for imposing constraint logic on items, and a decision component that supports enabling application customization logic at decision points.

Rules framework for definition and execution of end-user rules logic

A system, method and computer program product for managing database query execution using control point policies that can (1) defined, (2) applied to a sphere of database operation, and (3) evaluated at run time to determine whether a policy action should be taken. A control point policy 'definition' can include the specification of (1) an operational control point to which the control point policy is applied, (2) a control point policy filter that determines whether the control point policy will be implemented, and (3) a control point policy action to be implemented pursuant to the control point policy. The 'application' of a control point policy can include the specification of (1) a scope of database management system operation, (2) a level representing the precedence of the control point policy relative to other control point policies, and (3) an operational environment for control point policy execution. The &#x201c;evaluation&#x201d; of a control point policy can include evaluating the filter specification of an applied control point policy when the associated control point is reached to determine whether the policy action should be taken.

System and method for query management in a database management system

A dataset is divided into pieces and stored at multiple locations and the system dynamically increases or decreases the number of storage locations where the pieces of the data set may be stored. A data structure comprises a first data field including a first index and a first element, and one or more data fields each with an index and an element. The elements of the one or more data fields include a token representing a location associated with the index of the first data field. A data row of a data set is mapped to the index of a data field using a second index. The second index is derived from a data row of the data set using a hash function. The second index is then mapped to the index of a data field included in the one or more data fields using a modulus function.

Dynamic fragment mapping

The present invention relates to a system and methodology to facilitate development, debug, and deployment of a notification platform application. This includes providing various editor and display tools that interact with diverse components of the application in the context of a dynamic framework and development environment adapted to the nuances of the components. Visual displays and interfaces are provided that depict the various components of an application along with the relationships between the components. Developers are then directed though the components of the application in a visual manner, wherein various editors can be invoked to design a portion of the application relating to the selected component. Other aspects include providing a debug environment for troubleshooting a notification application along with deployment options to install and execute the application.

User interface system and methods for providing notification(s)

A grinder designed to provide an automatic grinding operation for the manufacture of a semiconductor device wafer. The grinder includes a base, a rotatable index table mounted to the base, and a grinding wheel assembly including a grinding wheel for grinding a flat surface on the wafer. The index table includes a wafer holder for receiving and holding the wafer. A dressing station, including a dressing element, is positioned adjacent to the index table for dressing the grinding wheel. The dressing station is rotatable between a first position and a second position where the grinding wheel is dressed by the dressing element.

Semiconductor wafer grinder

Apparatus and methods to identify a home fragment for a child row of a child table of a database, the home fragment for a row being the fragment in which the row is stored. A child key value of the child row is obtained and used to identify a fragment of a parent table that is correlated with the child key value of the child row. The child key value being the value of a child key attribute of the child row and represents a reference to a parent row in a parent table. The result is the home fragment for the child row that corresponds to identified fragment of a parent table that is correlated with the child key value of the child row.

System and method for correlated fragmentations in databases

System and method for extending application preferences classes

A grinder designed to provide an automatic grinding operation for the manufacture of a semiconductor device wafer. The grinder includes a base, a rotatable index table mounted to the base, and a grinding wheel assembly including a grinding wheel for grinding a flat surface on the wafer. The index table includes a wafer holder for receiving and holding the wafer and a dressing element for dressing the grinding wheel. The index table is selectively rotatable between a grinding position where the wafer is ground by the grinding wheel and a dressing position where the grinding wheel is dressed by the dressing element.

A computer implemented method for generating a response to a join. Two tables are divided into fragments. A join fragment map identifies, for each respective fragment from the first table, the fragments from the second table which contain a record that satisfies the join predicate with a record from the respective fragment from the first table. The map is used to eliminate fragments which cannot satisfy the join predicate.

Method and apparatus for performing a join query in a database system

A computer-based method and system of processing records read respectively from first and second related tables of a database includes determining whether data contained in the records read from the first or second tables is unevenly distributed. Records corresponding to evenly distributed data are searched for matches using a first set of instances of the hash-join operator, and records corresponding to data which is unevenly distributed are searched for matches using a second set of instances of a hash-join operator.

Growing community of inventors

Bellevue, WA, United States of America

Robert H Gerber