| Patent application number | Description | Published |
|---|
| 20080215544 | Systems and Methods for Modeling Partitioned Tables as Logical Indexes - Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions. | 09-04-2008 |
| 20090012980 | Efficient Query Processing Of Merge Statement - Disclosed are systems and methods for optimization and efficient processing of MERGE statements. MERGE allows performing a mix of inserts, updates, and deletes in a single statement, and introduces new challenges compared to legacy DML statements, where the kind of action to be performed is hard-coded and known at compile time. Such optimizations may include Halloween Protection detection for MERGE statements, optimized prevention of non-deterministic MERGE statements, in-place inserts for MERGE statements scanning the “Read Instance” of the target table, and optimized execution of MERGE statements seeking the “Read Instance” of the target table. Such optimizations may be fundamental in order to ensure proper performance and reliable processing times. | 01-08-2009 |
| 20100274780 | SYSTEMS AND METHODS FOR MODELING PARTITIONED TABLES AS LOGICAL INDEXES - Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions. | 10-28-2010 |
| Patent application number | Description | Published |
|---|
| 20080313271 | AUTOMATED REPONSE TO COMPUTER USERS CONTEXT - Techniques are described for providing information about a current state that is modeled with multiple state attributes. In some situations the providing includes receiving from a first client an indication of an interest in receiving values for an indicated one of the state attributes of the modeled current state, receiving from a second client an indication of an interest in receiving values for another of the state attributes of the modeled current state, and, in response to receiving a value for the indicated one attribute from a first source, determining that the first client has an interest in receiving the received value and supplying the received value to the first client. | 12-18-2008 |
| 20090055752 | MEDIATING CONFLICTS IN COMPUTER USERS CONTEXT DATA - Techniques are described providing mediated information about a current state that is modeled with multiple state attributes. In some situations, the providing includes receiving from a first source an indication of a first value for an indicated one of the state attributes of the modeled current state, receiving from a second source an indication of a second value for the indicated state attribute, and, after an indication from a client for a value for the indicated state attribute, sending to the client a mediated value for the indicated state attribute that is produced by mediating between available values for the indicated state attribute including at least the first and second values. | 02-26-2009 |
| 20090094524 | INTERFACE FOR EXCHANGING CONTEXT DATA - A facility for exchanging context attributes is described. A characterization module receives an invocation request to provide an attribute value that was generated by a requesting attribute consumer. The received invocation request identifies the attribute whose value is to be provided. In response to receiving the invocation request, the characterization module provides a value for the identified attribute to the requesting attribute consumer. | 04-09-2009 |
| 20090150535 | GENERATING AND SUPPLYING USER CONTEXT DATA - Techniques are described for providing information about a context that is modeled with multiple context attributes. In some situations, at least some of the context attributes have values used by modules for generating values of other context attributes, and the providing includes determining that a first module is generating a first value of a first of the context attributes of the modeled context and determining that a circular reference exists when it is determined that a module is to generate another value of the first context attribute such that the generating of the another value is caused by the generating of the first value of the first context attribute. | 06-11-2009 |
| 20100217862 | SUPPLYING NOTIFICATIONS RELATED TO SUPPLY AND CONSUMPTION OF USER CONTEXT DATA - Techniques are described for providing information about a current state that is modeled with multiple state attributes. In some situations, the providing includes receiving from a module a request related to the modeling of the current state with the multiple state attributes. In such situations, the providing further includes, without further intervention related to the request by the module, determining that the request cannot currently be satisfied, and indicating to the module that the request cannot currently be satisfied, monitoring at later times after the indicating to determine whether the request can be satisfied, and indicating to the module that the request can be satisfied if it is determined at one of the later times that the request can currently be satisfied. | 08-26-2010 |
| Patent application number | Description | Published |
|---|
| 20090097652 | Quantum Computational Systems - Apparatus and methods for performing quantum computations are disclosed. Such quantum computational systems may include quantum computers, quantum cryptography systems, quantum information processing systems, quantum storage media, and special purpose quantum simulators. | 04-16-2009 |
| 20090220082 | Quantum Computational Systems - A computer-implemented method for encryption and decryption using a quantum computational model is disclosed. Such a method includes providing a model of a lattice having a system of non-abelian anyons disposed thereon. From the lattice model, a first quantum state associated with the lattice is determined. Movement of non-abelian anyons within the lattice is modeled to model formation of first and second quantum braids in the space-time of the lattice. The first quantum braid corresponds to first text. The second quantum braid corresponds to second text. A second quantum state associated with the lattice is determined from the lattice model after formation of the first and second quantum braids has been modeled. The second quantum state corresponds to second text that is different from the first text. | 09-03-2009 |
| 20110156008 | METHOD FOR IMPLEMENTING THE PI/8 GATE IN A GENUS=1 ISING SYSTEM - Disclosed herein is a protocol that enables the π/8-gate in chiral topological superconductors in which superconducting stiffness λ has been suppressed. The protocol enables a topologically protected π/8-gate in any pure Ising system that can be fabricated into genus=1 surface. By adding the π/8-gate to previously known techniques, a design for universal topologically protected quantum computation which may be implemented using rather conventional materials may be obtained. | 06-30-2011 |
| 20110161638 | Ising Systems: Helical Band Geometry For DTC and Integration of DTC Into A Universal Quantum Computational Protocol - Disclosed herein are efficient geometries for dynamical topology changing (DTC), together with protocols to incorporate DTC into quantum computation. Given an Ising system, twisted depletion to implement a logical gate T, anyonic state teleportation into and out of the topology altering structure, and certain geometries of the (1,−2)-bands, a classical computer can be enabled to implement a quantum algorithm. | 06-30-2011 |
