Embodiments generate an optimized demand model for a retail item. Embodiments train a tree ensemble machine learning model comprising a plurality of trees, the training comprising storing upper bounds for each of the trees, the trees comprising levels and branches that correspond to the demand features that influence demand for the item. Embodiments generate an objective function for the demand model. At a top split of each tree, embodiments determine optimal child nodes using the stored upper bounds and calculate a new feasible region for each tree. Using bounds on the new feasible region, embodiments move down each tree to a next level of splits and generate the optimized demand model when a leaf node of every tree has been reached.
Embodiments include a point of sale system. The point of sale system includes a base, a stand coupled to the base, and a head unit coupled to the stand. The point of sale system further includes two outer hinge arms and an inner hinge arm that couple the head unit to the stand.
Embodiments decrypt or partially decrypt an encoded message or a private key, the encoded message or private key encoded by a public-key cryptography algorithm. Embodiments encode the public-key cryptography algorithm using a language of a program synthesizer and construct a grammar for the program synthesizer. Embodiments train the program synthesizer with training data comprising input-output pairs and execute the trained program synthesizer to generate a mathematical formula. Embodiments validate the generated mathematical formula and then perform the decrypting using the trained and validated program synthesizer.
Systems, methods, and other embodiments associated with a machine learning system that monitors and detects health and safety risks in electronic correspondence related to a target field are described. In one embodiment, a method includes monitoring email communications over a network to identify an email associated with a target field. A machine learning classifier is initiated that is configured to classify text from the email with a risk as including vocabulary referring to a safety risk or a non-risk. The classifier generates a probability risk value that the email includes text that refers to a safety risk and labels the email as safety risk or non-risk based at least in part on the probability risk value. An electronic notice is generated and transmitted to a remote device in response to the email being labeled as referring to a safety risk to provide an alert.
Systems, methods, and other embodiments for decentralized identity with user biometrics are presented herein. In one embodiment, a method includes, in response to a request to access resources of a cloud service provider by a computing device, transmitting a request for a biometric private key to a mobile device associated with a user; in response to receiving the biometric private key, submitting the biometric private key for validation against a blockchain associated with the user and the mobile device; adding a record of the results of the validation to the blockchain; and controlling access to the resources of the cloud service provider based on the record in the blockchain by (i) denying access where the record indicates that validation has failed (ii) granting access where the record indicates that validation has succeeded.
H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
G06F 21/10 - Protection de programmes ou contenus distribués, p.ex. vente ou concession de licence de matériel soumis à droit de reproduction
G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuées; Architectures de systèmes de bases de données distribuées à cet effet
H04W 12/69 - Sécurité dépendant du contexte dépendant de l’identité
G06V 40/50 - Traitement de données biométriques ou leur maintenance
G06F 21/32 - Authentification de l’utilisateur par données biométriques, p.ex. empreintes digitales, balayages de l’iris ou empreintes vocales
H04L 9/00 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité
6.
VEHICLE ROUTING WITH DYNAMIC SELECTION OF TURNS ACROSS OPPOSING TRAFFIC
Systems, methods, and other embodiments for vehicle route scheduling and navigation with dynamic selection of turns across opposing traffic are presented herein. In one embodiment, a method includes during development of a vehicle route from an arrival link through a node of a graph representing a road network, determining, for a departure link, that a path of the vehicle from the arrival link to the departure link crosses oncoming traffic, and in response to determining that that the path of the vehicle crosses oncoming traffic, adding an additional delay for the departure link to a route objective function representing the vehicle route; selecting the route including the path that crosses oncoming traffic to be an optimum route between a first location and a second location; including the optimum route in the delivery schedule for the vehicle; and transmitting the delivery schedule for execution.
Embodiments generate a demand model for a potential hotel customer of a hotel room. Embodiments, based on features of the potential hotel customer, from a plurality of clusters, each cluster including a corresponding weight and cluster probabilities. Embodiments generate an initial estimated mixture of multinomial logit ("MNL") models corresponding to each of the plurality of clusters, the mixture of MNL models including a weighted likelihood function based on the features and the weights. Embodiments determine revised cluster probabilities and update the weights. Embodiments estimate an updated estimated mixture of MNL models and maximize the weighted likelihood function based on the revised cluster probabilities and updated weights. Based on the update weights and updated estimated mixture of MNL models, embodiments generate the demand model that is adapted to predict a choice probability of room categories and rate code combinations for the potential hotel customer.
G06Q 10/04 - Prévision ou optimisation spécialement adaptées à des fins administratives ou de gestion, p. ex. programmation linéaire ou "problème d’optimisation des stocks"
Embodiments generate machine learning predictions to discover target device energy usage. One or more trained machine learning models configured to discover target device energy usage from source location energy usage can be stored. Multiple instances of source location energy usage over a period of time can be received for a given source location. Using the trained machine learning model, multiple discovery predictions for the received instances of source location energy usage can be generated, the discovery predictions comprising a prediction about a presence of target device energy usage within the instances of source location energy usage. And based on the multiple discovery predictions, an overall prediction about a presence of target device energy usage within the given source location's energy usage over the period of time can be generated.
Embodiments autonomously test a logical model for inconsistencies. For example, metadata descriptive of a logical model can be received, where the logical model includes an abstraction for a database schema, the database schema is implemented at a database, and the database schema includes a fact table and a dimension table. Logical queries can be automatically generated including at least first and second logical queries based on the retrieved metadata, where the first and second logical queries target a logical object of the logical model. At least the first and second logical queries can be issued to a server that hosts the logical model, where, at the server, the first and second logical queries are translated to first and second database queries, and the first and second database queries target at least a fact table and a dimension table from the database schema. Query results received from execution of the first and second database queries can be compared. Inconsistencies can be identified when the comparison of the query results does not meet a criterion.
Embodiments optimize inventory allocation of a retail item, where the retail item is allocated from a plurality of different fulfillment centers to a plurality of different customer groups. Embodiments receive historical sales data for the retail item and estimate demand model parameters. Embodiments generate a network including first nodes corresponding to the fulfillment centers, second nodes corresponding to the customer groups, and third nodes between the first nodes and the second nodes, each of the third nodes corresponding to one of the second nodes. Embodiments generate an initial feasible inventory allocation from the first nodes to the second nodes and solves a minimum cost flow problem for the network to generate an optimal inventory allocation.
G06Q 10/08 - Logistique, p.ex. entreposage, chargement ou distribution; Gestion d’inventaires ou de stocks
G06Q 10/06 - Ressources, gestion de tâches, des ressources humaines ou de projets; Planification d’entreprise ou d’organisation; Modélisation d’entreprise ou d’organisation
G06Q 30/02 - Marketing; Estimation ou détermination des prix; Collecte de fonds
11.
SELECTING THREADS FOR CONCURRENT PROCESSING OF DATA
The embodiments disclosed herein relate to using machine learning to allocate a number of concurrent processes for minimizing the completion time for executing a task having multiple subtasks. Historical data comprising a variety of subtask types with actual completion times is mined to create a set of statistical models for predicting completion time for a type of subtask. To minimize the total time to complete execution of a new task, a certain number of threads is allocated to execute subtasks of the new task. The certain number of threads is determined based on the predicted completion time for the subtasks using the respective statistical model. Threads are assigned to subtasks based on the predicted completion time for the subtasks, and the subtasks assigned to each thread are scheduled for execution.
Integrating a blockchain ledger with an application external to the blockchain ledger is disclosed. A first method determines a state, to be written to a blockchain ledger, based on a contract transaction. A second method determines a state, to be written to the blockchain ledger, based on an adapter transaction. The first method includes an invocation of the second method. The second method verifies whether the adapter transaction includes a particular set of information associated with a particular application. If the adapter transaction includes the particular set of information, then both the contract transaction and the adapter transaction are committed to the blockchain ledger. If the adapter transaction does not include the particular set of information, then neither the contract transaction nor the adapter transaction are committed to the blockchain ledger. The state determined based on the adapter transaction is used to update the particular application.
G06F 16/25 - Systèmes d’intégration ou d’interfaçage impliquant les systèmes de gestion de bases de données
G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuées; Architectures de systèmes de bases de données distribuées à cet effet
13.
SECURING ACCESS TO CONFIDENTIAL DATA USING A BLOCKCHAIN LEDGER
Methods and systems are provided for securing access to confidential data using a blockchain ledger. An update to access permissions can be received from a first entity on behalf of a second entity, the update can change access permissions to a confidential data store. A smart contract that validates the update can be called. Upon consensus from a blockchain community, the update to the access permissions for the second entity can be executed. The blockchain community can be a plurality of different organizations that share access to the confidential data store, and the update can be appended to a blockchain ledger that stores access permissions for the blockchain community.
G06F 16/27 - Réplication, distribution ou synchronisation de données entre bases de données ou dans un système de bases de données distribuées; Architectures de systèmes de bases de données distribuées à cet effet
14.
METHOD FOR READING DATA STORED IN A NON-VOLATILE CACHE USING RDMA
Data blocks are cached in a persistent cache ("NV cache") allocated from as non-volatile RAM ("NVRAM"). The data blocks may be accessed in place in the NV cache of a "source" computing element by another "remote" computing element over a network using remote direct memory access ("RMDA"). In order for a remote computing element to access the data block in NV cache on a source computing element, the remote computing element needs the memory address of the data block within the NV cache. For this purpose, a hash table is stored and maintained in RAM on the source computing element. The hash table identifies the data blocks in the NV cache and specifies a location of the cached data block within the NV cache.
G06F 12/0864 - Adressage d’un niveau de mémoire dans lequel l’accès aux données ou aux blocs de données désirés nécessite des moyens d’adressage associatif, p.ex. mémoires cache utilisant des moyens pseudo-associatifs, p.ex. associatifs d’ensemble ou de hachage
G06F 12/0868 - Transfert de données entre une mémoire cache et d'autres sous-systèmes, p.ex. des dispositifs de stockage ou des systèmes hôtes
A shared storage architecture persistently stores database files in non- volatile random access memories (NVRAMs) of computing nodes of a multi-node DBMS. The computing nodes of the multi-node DBMS not only collectively store database data on NVRAMs of the nodes, but also host database server instances that process queries in parallel, host database sessions and database processes, and together manage access to a database stored on the NVRAMs of the nodes. To perform a data block read operation from persistent storage, a data block may be transferred directly over a network between NVRAM of a node that persistently stores the data block to a database buffer in non-volatile RAM of another node that requests the data block. The transfer is accomplished using remote direct memory access ("RDMA). In addition to techniques for performing a data block read operation to NVRAM, computing nodes perform a data block write operation.
G06F 12/02 - Adressage ou affectation; Réadressage
G06F 16/10 - Systèmes de fichiers; Serveurs de fichiers
G06F 13/28 - Gestion de demandes d'interconnexion ou de transfert pour l'accès au bus d'entrée/sortie utilisant le transfert par rafale, p.ex. acces direct à la mémoire, vol de cycle
16.
SYSTEM AND METHOD FOR PROVIDING AN INTERFACE FOR A BLOCKCHAIN CLOUD SERVICE
In accordance with an embodiment, described herein is a system and method for implementing a distributed ledger a blockchain cloud service. The blockchain cloud service can include nodes of the distributed ledger and a management console component. The management console component can include a web application running in a script runtime environment, a plurality of backend of APIs for communicating with various nodes of the blockchain cloud service, and a plurality of client APIs configured to be invoked by a client application. The plurality of client APIs uses one or more of the plurality of backend APIs in provisioning the distributed ledger as a blockchain cloud service, and in managing the managing the blockchain cloud service.
G06F 21/62 - Protection de l’accès à des données via une plate-forme, p.ex. par clés ou règles de contrôle de l’accès
G06Q 20/06 - Circuits privés de paiement, p.ex. impliquant de la monnaie électronique utilisée uniquement entre les participants à un programme commun de paiement
H04L 41/5054 - Déploiement automatique des services déclenchés par le gestionnaire de service, p.ex. la mise en œuvre du service par configuration automatique des composants réseau
H04L 67/1097 - Protocoles dans lesquels une application est distribuée parmi les nœuds du réseau pour le stockage distribué de données dans des réseaux, p.ex. dispositions de transport pour le système de fichiers réseau [NFS], réseaux de stockage [SAN] ou stockage en réseau [NAS]
H04L 67/565 - Conversion ou adaptation du format ou du contenu d'applications
The present disclosure relates to automatically and periodically updating a multi-tier application stack in a cloud environment. More particularly, the present disclosure relates to systems and methods that access a central server to determine if new updates have been released, and when new updates have been released, automatically apply the new updates to an application environment with minimal network burden and service interruption.
Techniques for implementing a buffer cache for a persistent file system in non-volatile memory is provided. A set of data is maintained in one or more extents in non-volatile random-access memory (NVRAM) of a computing device. At least one buffer header is allocated in dynamic random-access memory (DRAM) of the computing device. In response to a read request by a first process executing on the computing device to access one or more first data blocks in a first extent of the one or more extents, the first process is granted direct read access of the first extent in NVRAM. A reference to the first extent in NVRAM is stored in a first buffer header. The first buffer header is associated with the first process. The first process uses the first buffer header to directly access the one or more first data blocks in NVRAM.
G06F 12/0868 - Transfert de données entre une mémoire cache et d'autres sous-systèmes, p.ex. des dispositifs de stockage ou des systèmes hôtes
G06F 12/0866 - Adressage d’un niveau de mémoire dans lequel l’accès aux données ou aux blocs de données désirés nécessite des moyens d’adressage associatif, p.ex. mémoires cache pour les systèmes de mémoire périphérique, p.ex. la mémoire cache de disque
19.
SYSTEMS AND METHODS FOR INTELLIGENTLY PROVIDING SUPPORTING INFORMATION USING MACHINE-LEARNING
Systems and methods for intelligently providing users with supporting information based on big-data analyses of a data set. Machine-learning algorithms may be executed using the data set to identify correlations between data objects of the data set. The correlations can be used to recommend supporting information to a user. A user interface can be provided to enable a user to initiate a process associated with an event. In response to receiving the input, the system can identify variables associated with the request. Based on these variables, the system can retrieve output data of the machine-learning algorithms to identify the supporting information for the user.
Techniques are described for implementing a cloud computer system (e.g., "a cloud service") for facilitating the synchronization of enterprise data between mobile computing devices and enterprise computing systems (e.g., human resource management systems, business management systems, or the like). The cloud service may convert enterprise data received from different enterprise computing systems to a format that can be managed and updated easily by mobile computing devices. The converted format may enable distinct information to be easily identified. The enterprise data may be associated with policy information and version information to manage synchronization of the enterprise data. In some aspects, the cloud service may manage synchronization with mobile computing devices based on classification of a communication connection the mobile computing devices have to a wireless network. The communication connection may be used to determine a manner for synchronizing enterprise data between the mobile computing devices and the cloud computer system.
G06F 17/00 - TRAITEMENT ÉLECTRIQUE DE DONNÉES NUMÉRIQUES Équipement ou méthodes de traitement de données ou de calcul numérique, spécialement adaptés à des fonctions spécifiques
H04W 4/30 - Services spécialement adaptés à des environnements, à des situations ou à des fins spécifiques
G06F 16/178 - Techniques de synchronisation des fichiers dans les systèmes de fichiers
H04L 67/1095 - Réplication ou mise en miroir des données, p.ex. l’ordonnancement ou le transport pour la synchronisation des données entre les nœuds du réseau
H04L 67/565 - Conversion ou adaptation du format ou du contenu d'applications
H04L 67/5682 - Politiques ou règles de mise à jour, de suppression ou de remplacement des données stockées
?Systems, devices, and methods are disclosed for an agent device within a company's network firewall to initiate an HTTP connection with a cloud-based gateway and then upgrade the connection to a WebSockets protocol in order to have an interactive session. Over this interactive session, a mobile device, which connects to the cloud-based intermediary, can request data from servers inside the company's firewalls. Because the firewall is traversed using HTTP protocols (with WebSockets), it can be as safe as letting employees browse the web from inside the company's network.
Techniques are described for implementing a cloud computer system to provide access to a custom execution environment for execution of custom executable instructions. Users may be able to configure one or more different types of template execution environments, e.g., a virtual machine environment, each of which can be used to establish a type of custom execution environment. Users may configure the template execution environment with regard to settings, states, resources, permissions, or other criterion related to an execution environment. Upon request, a custom execution environment (e.g., a child execution environment) may be established for running one instance of a custom executable instruction. The custom execution environment may be based on the template execution environment. The custom execution environment may provide a secure, isolated environment for execution of a custom executable instruction. Access permissions for the custom execution environment may be configurable depending on a type of execution environment desired.
H04L 41/50 - Gestion des services réseau, p.ex. en assurant une bonne réalisation du service conformément aux accords
G06F 21/53 - Contrôle des usagers, programmes ou dispositifs de préservation de l’intégrité des plates-formes, p.ex. des processeurs, des micrologiciels ou des systèmes d’exploitation au stade de l’exécution du programme, p.ex. intégrité de la pile, débordement de tampon ou prévention d'effacement involontaire de données par exécution dans un environnement restreint, p.ex. "boîte à sable" ou machine virtuelle sécurisée
G06F 9/455 - Dispositions pour exécuter des programmes spécifiques Émulation; Interprétation; Simulation de logiciel, p.ex. virtualisation ou émulation des moteurs d’exécution d’applications ou de systèmes d’exploitation
Techniques are described for implementing a cloud computer system to facilitate communication between a computing device (e.g., a mobile computing device) and enterprise computer systems. In certain embodiments, the cloud computer system may receive, from a computing device, a request for a service provided by an enterprise computer system. The cloud computer system may determine security authentication of a user for the requested service. A security protocol may be determined for a requested enterprise computer system and a security token may be generated for the request according to the determined security protocol. The request may be sent to the requested enterprise computer system. In some embodiments, security authentication for a request to an enterprise computer system may be determined based on previous authentication. The cloud computer system may be configured to communicate with several different enterprise computer systems according to their supported protocols (e.g., communication protocol and/or security protocol).
A method for forming an optical tape for data storage from a substrate film includes a step of patterning a curable liquid composition onto a side of the substrate film. Characteristically, the curable liquid composition includes a free radical photoinitiator and a polymerizable component that includes at least one acrylate. The curable liquid composition is illuminated with actinic radiation to form a patterned imprint layer disposed over the substrate film. A multilayer data recording assembly is placed over the imprint layer. An optical tape made by the method is also provided.
G11B 7/252 - Supports d’enregistrement caractérisés par le choix du matériau des couches autres que les couches d'enregistrement
G11B 7/003 - Systèmes d'enregistrement, de reproduction ou d'effacement caractérisés par la forme du support avec des rubans, p.ex. des courroies, des bandes bobinées ou des pellicules d'étendue quasi-infinie
25.
OPTICAL TAPE DRIVE MOVABLE PLANARIZER SUBSYSTEM AND METHOD FOR MINIMIZING DAMAGE TO AN OPTICAL PICKUP UNIT
In an optical tape drive system, a movable planarizer subsystem (16) includes a tape planarizer support structure (28) for supporting an optical tape planarizer (10). The support structure (28) is moveable between an operational position and a non - operational position. The movable planarizer subsystem (16) also includes an actuator (36) for moving the support structure (28) and the optical tape planarizer (10) between the operational position and the non - operational position. The operational position of the support structure (28) positions the optical tape planarizer (10) to permit reading/writing of information from/to an optical tape (18) via an optical pickup unit (OPU), and the non - operational position of the support structure (28) positions the optical tape planarizer (10) to permit passage of a tape leader (34) though the tape drive system without damage to the OPU.
G11B 7/003 - Systèmes d'enregistrement, de reproduction ou d'effacement caractérisés par la forme du support avec des rubans, p.ex. des courroies, des bandes bobinées ou des pellicules d'étendue quasi-infinie
G11B 15/62 - Maintien de l'écartement désiré entre le support d'enregistrement et la tête
The present disclosure provides a system and method for preparing compended biogs, In at least one embodiment, a method of posting blog content to a compended blog comprises establishing a compended blog having a selected keyword, ob-taining a blog content, processing the blog content to identify at least one biog content keyword contained within the blog content, comparing the identified bfog content keyword to the selected keyword to determine whether a match exists based upon at least one predetermined criterion, and posting the biog content the compended blog if the comparison reveals a match based upon meeting or exceeding the predetermined criterion.
An XML document can be represented in a compact binary form that maintains all of the features of XML data in a useable form. In response to a request for a modification (e.g., insert, delete or update a node) to an XML document that is stored in the compact binary form, a certain representation of the requested modification is computed for application directly to the binary form of the document. Thus, the requested modification is applied directly to the persistently stored binary form without constructing an object tree or materializing the XML document into a corresponding textual form. Taking into account the nature of the binary form in which the document is encoded, the bytes that actually require change are identified, including identifying where in the binary representation the corresponding actual changes need to be made.
28.
APPARATUS AND METHOD FOR FORMING A HOMOGENOUS TRANSACTION DATA STORE FROM HETEROGENEOUS SOURCES
A computer readable storage medium includes executable instructions to gather a first committed transactional record from a first transaction log associated with a first data source. The first committed transactional record is converted to a homogeneous format to form a first homogeneous transactional record with a common transaction record header containing transactional context information from the first data source. A second committed transactional record is collected from a second transaction log associated with a second data source with a format different than the first data source. The second committed transactional record is changed to the homogeneous format to form a second homogeneous transactional record with a common transaction record header containing transactional context information from the second data source. The first homogeneous transactional record is combined with the second homogeneous transactional record to form a homogeneous transaction data store.
A computer readable storage medium includes executable instructions to receive a specification for requested data in a log based replication system where data changes are retrieved from both a transaction log and a database. It is determined that the requested data is compromised. A search for a data image containing the requested data is initiated. The data image is accessed to secure the requested data. The requested data is returned.
Techniques and systems are provided for capturing relationships between items in "bonds", and using the bonds to facilitate searches against the items. It is described how bonds that reflect relationships between searchable items are stored. The degree of separation between any two given searchable items is based on the minimum number of bonds that have to be traversed to arrive at one of the two searchable items when starting at the other of the two searchable items. The bonds are used to respond to a search request, performing a search relative to a designated searchable item. For example, the search mechanism may search only those searchable items that are within a particular degree of separation of the designated searchable item. As another example, the search mechanism may determine the order in which searchable items are compared against search criteria of the search request based on the degree of separation of the searchable items from the designated searchable item. In addition, the search mechanism may ranking the searchable items that match the search based, at least in part, on the degree of separation between the searchable items and the designated searchable item.
Methods for creating a search framework that provides a semantic interface for searching transactional applications are disclosed. According to one aspect of the present invention, a method for enabling at least one transactional application to be searched includes creating a canonical object associated with the transactional application and indexing data associated with the transaction application. The method also includes creating an index store using information associated with the canonical object. The index store is associated with the indexed data. Finally, a semantic engine is interfaced with the index store.
A method and apparatus for determining when an event occurred in a database is provided. At least a portion of the database is restored to a point in time that is prior to the event. Recovery logs are translated to database operations (e.g., SQL) that are capable of causing the changes described in the recovery logs. A mechanism is created for detecting the event based on execution of the statements. For example, a database trigger is created to detect the event. The database operations are executed against the restored database to cause the mechanism to detect the event.
33.
ANTICIPATORY CHANGES TO RESOURCES MANAGED BY LOCKS
A method and system are provided for performing anticipatory changes to a resource governed by a locking mechanism. Entities (such as transactions in a database system) that want to modify a resource request permission to modify the resource. However, prior to receiving permission, they make anticipatory changes to a private version of the resource. The entities are prevented from making the anticipatory changes permanent until they receive permission to make the changes. Because they can make the changes, and proceed to other operations, before receiving permission, any delay in receiving permission has less adverse effect on their performance.
A method and apparatus for managing locks in a database system is provided. A master node grants a lock on a first resource and a group of resources that includes the first resource to a first requester node. The requester node receives a mapping corresponding to the group of resources that may indicate that a lock already exists for a second resource in the group. If the requester node desires a lock on a resource located in the group, the requester node grants itself the lock without notifying the master node. A second requester node requests a lock for a particular resource in the group of resources. The first requester node grants the lock on the particular resource and updates the mapping to indicate that a different node holds a lock for the particular resource.
Systems and methods for providing encryption and decryption of data transmitted on a computer implemented network, preferably user authentication identifier data, such as a password, at the point of entry into the user's computer. The systems and methods enable an end user to mentally select a marker from one of the randomly arranged elements on a first portion of a graphical image. A second portion of the graphical image includes an arrangement of possible elements of any individual authentication identifier sequence, and is positioned adjacent to the first portion. The systems and methods prompt a user to enter each element of the identifier by moving the selected marker and the first portion as necessary to substantially align the selected marker with a chosen element of the authentication identifier appearing on the outer portion. According to one embodiment, the image portions are concentric wheels. According to another embodiment, the image portions are arranged in adjacent rows.
36.
METHOD AND MECHANISM FOR LOADING XML DOCUMENTS INTO MEMORY
A method and apparatus for loading an XML document into memory is provided. A client loads one or more array elements into a first partition of an array that is maintained in memory. Each array element represents an XML element of an XML document. Upon determining that an amount of data maintained in the first partition exceeds a first threshold, the client subsequently loads array elements into a new partition of the array. Upon determining that an amount of data maintained in the memory of the client exceeds a second threshold, the array elements of the least recently used partition are persistently stored in a database without persistently storing the entire XML document. When the last XML element of the XML document is loaded into a partition of the array, that partition is persistently stored in the database, thereby causing the entire XML document to be stored in the database.
37.
APPARATUS AND METHOD FOR CREATING A REAL TIME DATABASE REPLICA
A method of processing data includes identifying a capture redo byte address, initiating a capture process at the capture redo byte address, creating a clone of a source database to a logical change number, and initiating an apply process at a target database.
38.
DYNAMIC CALL CHARACTERISTIC CONTROL ON A PER CALL BASIS
Techniques for dynamically adjusting volume during a call are provided. A gateway (102) is provided that allows a call between a first device (104) and a second device (106). The call may be routed through a first network (110) and a second network (108). The first network may be PSTN network and the second network may be a VOIP network. An indication may be received at the gateway that indicates a call characteristic should be adjusted for the call. For example, the indication may indicate the volume or echo should be adjusted. The gateway may then adjust the volume or eliminate echo during the call based on the indication. The adjustment is affected during the call at the first device and the second device. For example, the gateway may dynamically adjust the gain for the call resulting in a change in the call characteristic.
H04L 12/66 - Dispositions pour la connexion entre des réseaux ayant différents types de systèmes de commutation, p.ex. passerelles
H04M 1/20 - Dispositions pour empêcher la réaction acoustique
H04M 7/00 - Dispositions d'interconnexion entre centres de commutation
H04M 7/12 - Dispositions d'interconnexion entre centres de commutation pour l'exploitation entre centraux comportant différents types d'équipement de commutation, p.ex. à entraînement mécanique et pas à pas ou décimal et non décimal
39.
APPARATUS AND METHOD FOR CREATING A REAL TIME DATABASE REPLICA
A computer-readable storage medium storing executable instructions which, when executed by at least one computer, cause the at least one computer to perform a method for creating a replica of a source database, the method comprising receiving a backup logical change number for the source database, the backup logical change number corresponding to a transaction committed to the source database; creating, while the source database operates with full data availability for read and write operations, a clone of the source database up to the backup logical change number by capturing transactions committed before the backup logical change number; transferring the clone of the source database to a replica database while the source database continues to operate with full data availability; and initiating an apply process to the replica database by updating the replica database with transactions committed after the backup logical change number
A method and apparatus for managing relationships between resources stored in a repository is provided. A client sends, to a server, a request to store a first resource within a repository. In response to receiving the request, the server parses the first resource to retrieve relationship data that identifies a relationship between two or more resources to be stored, or currently stored, within the repository. The server stores, within a database accessible to the server, one or more relationship records that identify the relationship between the two or more resources. The one or more relationship records are stored separate from the two or more resources. Subsequently, the client may issue queries, to the server, about the one or more relationships records stored in the database. In this way, a user may access the one or more relationship records to analyze the relationship between resources stored in repository.
The present invention facilitates the creation and implementation of Workflow Templates and also the designation of linkage between these templates and specific projects dealing with different media type handling. Workflow Templates are used to automatically generate user interface views which will be used by agents, knowledge workers, supervisors and customers. Such Workflow Templates provide the means to create, define and store the name and definition of and "trigger points" for each workflow item. The trigger points for when a document is used are also determined when creating the template. Further, in creating a Workflow Templates the administrator can instruct the system to save scripts associated with the template that can be saved as XML, EDI, JSP, CGI, VXML, etc. so as to be able to automatically generate documents or logic flows consistent with the target media type for the anticipated interactions with customers.
A real-time customer relation management system is disclosed. The system can provide increased availability, reduced internal latencies, and reduced data processing and transfer. The system can provide real time processing and batch processing. The system architecture can have an in-memory write-through cache. The cache can store data that would have otherwise been sent to a database. The system can have a backup in-memory write-through cache. The system can use a warm standby, for example, to enhance data backup efficiency.
A revenue management system and method for telecommunication network use is disclosed. The revenue management system can be integrated with the internet protocol multimedia subsystem (IMS). The revenue management system and method can have a hardware and/or software revenue generation module or architecture, revenue capture module or architecture, revenue collection module or architecture, revenue analysis module or architecture, or combinations thereof.
Techniques are described herein for handling lock- related inconsistencies. As mentioned above, such inconsistencies occur when two or more sets of lock information, relating to the same resource, convey inconsistent information about locks requested and/or granted on that resource. In general, the techniques involve causing the locally-stored lock information about a resource to be sent to the master node of the resource . The master node of the resource compares the lock information thus received against the lock information maintained by the master node. Based on the comparison, the master node determines how to resolve the lock-related inconsistency, and sends messages to those nodes that need to change their local lock information for the resource. Once all of the lock information has been made consistent, the resource made available for access. Because the lock- related inconsistency is resolved without restarting nodes, the availability of the resources is improved .
A robust customer service environment employing "Key Performance Indicators" (KPIs), which represent both customer interaction experiences and also the overall efficacy of agent performance on an interaction-by-interaction basis. A KPI can be any metric for measuring a category of information related to a call center interaction, e.g., customer satisfaction or agent ability/performance. Input from customer experiences, whether originating from the customer, agent, or agent supervisor, is catalogued and linked to one or more KPIs. Key performance indicators are associated with a key performance indicator template, which is linked with a project comprising routing rules, triggers, and specific actions that are driven as a result of the key performance indicator template. The project may be a phone/IVR project, Web CallBack project, email project, or a Chat project. Execution of the key performance indicator template triggers pre-, during, and/or post-call, -chat, -CallBack, or -email input from a call center user.
The TABLE function mechanism available in a RDBMS is used to integrate RDF models into SQL queries. The table function invocation takes parameters including an RDF pattern, an RDF model, and an RDF rule base and returns result rows to the SQL query that contain RDF triples resulting from the application of the pattern to the triples of the model and the triples inferred by applying the rule base to the model. The RDBMS includes relational representations of the triples and the rules. Optimizations include indexes and materialized views of the representations of the triples, precomputed inferred triples, and a method associated with the TABLE function that rewrites the part of the SQL query that contains the TABLE function invocation as an equivalent SQL string. The latter technique is generally applicable to TABLE functions.
47.
APPARATUS AND METHOD FOR IDENTIFYING ASYNCHRONOUS DATA IN REDUNDANT DATA STORES AND FOR RE-SYNCHRONIZING SAME
A computer readable medium includes executable instruction to compare databases. The executable instructions are configured to identify when a segment of a first database is conditionally out of synchronization with a corresponding segment of a second database to establish a conditionally out of synchronization state at a first time. Executable instructions allow a latency period after the first time in which changes are made to the first database and the second database. Executable instructions also determine after the latency period whether the segment of the first database is in synchronization with the corresponding segment of the second database. Executable instructions also populate a resynchronization table, which is used by a replication mechanism to bring asynchronous rows into synchronization.
48.
SYSTEMS AND METHODS FOR MANAGING THE DEVELOPMENT AND MANUFACTURING OF A DRUG
System and methods for managing the development and manufacturing process of a pharmaceutical are disclosed. The method comprises capturing and recording the development and manufacturing history of the pharmaceutical drug in order to generate a product history. The product history is stored on a computer and is searchable in multiple data dimensions in order to easily retrieve information. The system automatically provides compliance management procedures in order to comply with regulatory standards for the pharmaceutical industry.
G16H 40/20 - TIC spécialement adaptées à la gestion ou à l’administration de ressources ou d’établissements de santé; TIC spécialement adaptées à la gestion ou au fonctionnement d’équipement ou de dispositifs médicaux pour la gestion ou l’administration de ressources ou d’établissements de soins de santé, p.ex. pour la gestion du personnel hospitalier ou de salles d’opération
49.
INFRASTRUCTURE FOR PERFORMING FILE OPERATIONS BY A DATABASE SERVER
A method and apparatus for processing a file system operation at a database server is provided. A request to perform a file system operation on a resource stored in a database is received at a database system. The request may be implemented using the NFS protocol. The request may include state identification data that identifies state information associated with the request. State information associated with the request is retrieved within the database system based on the state identification data. State information is information that describes the operational state of the requestor for a particular file. The request is then processed based, at least in part, on the state identification. File system operations may be processed a database management system to access any data, such as a file, relational data, and object-relational data.
A method for managing an expense report for an expense report application is provided. The expense report application is configured to update entries in an expense report based on messages received from one or more messaging channels. The method includes receiving a message sent through a messaging channel in the one or more messaging channels. The message includes expense information. An expense report is determined from the expense information. Entry information is then determined from the expense information. The expense report is then updated with the entry information.
H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
51.
OPLOGGING FOR ONLINE RECOVERY IN DIRECT CONNECTION CLIENT SERVER SYSTEMS
Clients are permitted to directly attach to a client server system. A oplog management system tracks changes as clients make the changes to control structures of the direct connection client server system. The Oplogging system stores changes in oplogs. Then, if a client fails, the Oplogging system can repair the control structures, either by undoing the changes made by the client, or else completing the changes in place of the client; depending on principles defined.
G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p.ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
52.
SYSTEM FOR ONTOLOGY-BASED SEMANTIC MATCHING IN A RELATIONAL DATABASE SYSTEM
The method for processing data in a relational database wherein ontology data that specifies terms and relationships between pairs of said terms expressed in an OWL document is stored in the database, database queries that include a semantic matching operator are formed which identify the ontology data and further specify a stated relationship between two input terms, and the query is executed to invoke the semantic matching operator to determine if the two input terms are related by the stated relationship by consulting said ontology data.
Techniques are provided for processing a query including receiving the query, where the query specifies certain operations; determining that the query includes a first portion in a first query language and a second portion in a second query language; generating a first in-memory representation for the first portion; generating a second in-memory representation for the second portion; generating a third in-memory representation of the query based on the first in-memory representation and the second in-memory representation; and performing the certain operations based on the third in-memory representation.
54.
EFFICIENT EXTRACTION OF XML CONTENT STORED IN A LOB
A method and system are provided for extracting a valid, self-contained fragment for a node in a XML document stored in a database management system. An XML index is used to identify a location in which XML fragment data corresponding to the node is located. Ancestors of the node are identified and examined for any information needed for the proper interpretation of the fragment. If an ancestor node contains such needed information, this information is patched into the XML fragment to ensure that the fragment is a valid, self-contained XML fragment.
A repository server that makes stored copies of Web-accessible documents available at times when the documents themselves are inaccessible via the Web, because the server the document is located on is unavailable, because the server has removed or renamed the document, or because the server has replaced the version of which the stored copy is a copy with a different version. A client of the repository server may register a document in the repository server. The repository server makes a copy of the registered document and returns a repository URL for the copy to the client. The repository URL may be used to fetch the copy from the repository URL. Registration further relates the stored copy to its document URL, to an identifier for the stored copy, to a fingerprint that is a condensed representation of the stored copy's content, and to a set of stored copies having similar content. Other operations performed by the repository server include: 1) fetching the content of a document that is registered in the repository server. This is done by receiving a repository URL and determining whether the document corresponding to the stored copy specified by the repository URL is available via the Web; if it is, the client is redirected to the location specified by the document's document URL; otherwise, the stored copy is fetched. 2) providing the client with a list of a repository URLs for stored copies that are related to the same document URL; and 3) providing the client with a list of repository URLs for stored copies that are similar to the stored copy specified by a given repository URL. The fingerprints are used to compute similarity.
When a query is performed an execution plan is formed, which is made up of a plurality of plan operators. Before executing any given plan operator, a storage area is checked. If a results set has been stored corresponding to the plan operator, then the cached results set is used instead of the executing the plan operator. If no results set exists that corresponds to the particular plan operator, the plan operator is executed, and the results set that is output may be stored for use by another plan operator of another execution plan.
57.
A DATABASE MANAGEMENT SYSTEM WITH PERSISTENT, USER- ACCESSIBLE BITMAP VALUES
A database management system that has bitmap values in which set bits in a representation of a bitstring specify a set of objects whose definitions are built into the database management system. The database management system further includes user-accessible operations on the bitmap values. The bitmap values are represented by means of a mapping; specifier that specifies a range of the set of objects and a representation of a string of bits that has been mapped onto the set of object specified by the range specifier. The representation of the string of bits may be compressed. Bitmap operations on the values may alter the range specifier, the size of the string of bits, or individual bits in the string of bits. The objects represented by the bitmap values may be objects in the database management system or objects external thereto. An example of bitmap values of the first kind are bitmap values representing sets of rowids. rowid bitmap values may be used to make a user- defined index of attribute values for any set of objects contained in fields in the database management system. An example of bitmap values of the second kind are bitmap values representing sets of electronic product codes. ePC bitmap values may be used in any application where a compact representation of a set of ePC codes is desired.
Techniques are provided for indexing XML documents. According to one embodiment, a PATH table created for storing one row for each indexed node of the XML documents. The PATH table row for a node includes (1) information for locating the XML document that contains the node, (2) information that identifies the path of the node, and (3) information that identifies the position of the node within the hierarchical structure of the XML document that contains the node. If the node is associated with the value, then the PATH table row for the node may also include the value. Use of the PATH table to answer XPath queries is facilitated by secondary indexes.
59.
MANAGING EVENT-CONDITION-ACTION RULES IN A DATABASE SYSTEM
A database rules engine for receiving and storing ECA expressions in columns of a database table. ECA expressions specify (I) an event structure that defines an event that corresponds with the event structure; (2) conditions for evaluation with respect to occurrences of events that correspond with the event structure; and (3) actions for performance in response to events satisfying one or more of the conditions. During evaluation of the rules with respect to one or more events, an event is detected based on the event's compliance with the specified event structure and the conditions are evaluated by determining whether the event satisfies any of the conditions. If the event satisfies a set of one or more conditions that have a corresponding action, then the corresponding action is performed by the database or the database causes the action to be performed outside of the database.
A method and apparatus for mirroring data between a plurality of sites is provided. A replication relationship is established between the plurality of sites that include a first site and a second site. A first database server at the first site receives an indication that a write operation could not be successfully mirrored at the second site. In response to the indication, the first database server initiates a membership voting operation by communicating with a quorum device to determine whether the first database server or a second database server associated with the second site should be removed from the replication membership. If it is determined that the second database server associated with the second site should be removed from the replication membership, then the first database server sends a message to indicate that write operations are no longer to be replicated at the second site.
G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p.ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
A method and apparatus for mirroring data between a plurality of sites is provided. At a first site of the plurality of sites, a record is maintained that identifies which changes made to one or more data blocks that are stored at the first site have had associated redo information replicated to the other sites of the plurality of sites. A priority value associated with a transaction that is to be performed at the first site is determined. The transaction specifies a modification to a data block. Thereafter, if the priority value indicates that the transaction should not be lost if the first site becomes inoperable, then the transaction is committed only after the record indicates that all other changes that have updated the data block at the first site have had their respective redo information replicated to the other sites of the plurality of sites.
62.
TECHNIQUES FOR DYNAMICALLY ESTABLISHING AND MANAGING AUTHENTICATION AND TRUST RELATIONSHIPS
Techniques are provided for dynamically establishing and managing authentication and trust relationships. An identity service acquires and evaluates contracts associated with relationships between principals. The contracts permit the identity service to assemble authentication information, aggregated attributes, and aggregated policies which will drive and define the various relationships. That assembled information is consumed by the principals during interactions with one another and constrains those interactions. In some embodiments, the constraints are dynamically modified during on-going interactions between the principals.
H04L 9/32 - Dispositions pour les communications secrètes ou protégées; Protocoles réseaux de sécurité comprenant des moyens pour vérifier l'identité ou l'autorisation d'un utilisateur du système
H04L 12/16 - Dispositions pour la fourniture de services particuliers aux abonnés
63.
METHOD AND APPARATUS FOR PERSONALIZATION AND IDENTITY MANAGEMENT
Methods and systems are disclosed for personalization and identity management. In one embodiment, the method comprises receiving, from an access provider, a message for a service provider, the message associated with a first identifier of a user of the access provider. A second identifier is obtained, the first identifier is disassociated from the message, and the second identifier is associated with the message. The message associated with the second identifier is then sent to the service provider.
H04L 69/329 - Protocoles de communication intra-couche entre entités paires ou définitions d'unité de données de protocole [PDU] dans la couche application [couche OSI 7]
64.
COMPLEX COMPUTATION ACROSS HETEROGENOUS COMPUTER SYSTEMS
A programmatic interface to allow external functions to be registered and called in parallel from within a database management system is described for coordinating a computation at multiple nodes. In one embodiment, each node executes a process configured for starting a program to perform the computation in response to a command received from a database system. In response to receiving a query at the database system, multiple commands are transmitted to the processes for concurrently performing the computation at each said corresponding process. Results are received from each of the processes and execution of the statement is completed based on the results received.
A method and apparatus for determining the usage of space in a database is provided. A first set of space usage data that reflects the amount of free space associated with one or more tablespaces of a database is stored at a first database server. A second set of space usage data is retrieved from one or more other database servers. The first set of space usage data and the second set of space usage data are both updated based on changes made to the database by the particular database server storing the space usage data. The first set of space usage data is updated at the first database server with the second set of space usage data. The first database server may evaluate the usage of space in the database based on the updated first set of space usage data.
A method and system for the in-place evolution of XML schemas is disclosed. To automatically evolve an existing XML schema, a schema evolver receives both an existing XML schema and an XML document as input. The XML document indicates changes to be made to the existing XML schema. Based on the existing XML schema and the XML document, the schema evolver evolves the existing XML schema into a new XML schema that incorporates the changes indicated in the XML document. According to one aspect, the schema evolver generates one or more SQL statements based on the new XML schema. The SQL statements, when executed by a database server, cause the database server to evolve database structures that were based on the formerly existing XML schema so that the database structures conform to the new XML schema. This is accomplished "in place," without copying the data in the database structures.
Approaches described herein may be used for provisioning of databases that requires a bulk transfer of data within a distributed computing environment, such as a grid. The approaches do not require the manual intervention of a DBA to, for example, transfer a tablespace between the file systems of operating systems. Instead, the tablespaces may be provisioned automatically and dynamically by a grid computing system whenever it determines the need to dynamically provision a database. In addition, as copies of tablespaces are provisioned, synchronization mechanisms can also be automatically provisioned to keep the tablespaces and their copies in sync.
68.
DML STATEMENTS FOR DENSIFYING DATA IN A RELATIONAL DATABASE SYSTEM
A method and apparatus for densification of data is provided. A method and apparatus for including a construct for partitioning data within a DML statement is provided. The construct for partitioning data may not necessarily perform a densification of data, and the densification of data may not necessarily include a construct for partitioning data. In an embodiment, the syntax of an OUTER JOIN is extended to include a PARTITION BY construct that may be used for data densification.
69.
SYSTEM AND METHOD FOR CROSS ATTRIBUTE ANALYSIS AND MANIPULATION IN ONLINE ANALYTICAL PROCESSING (OLAP) AND MULTI-DIMENSIONAL PLANNING APPLICATIONS BY DIMENSION SPLITTING
A system (400) for cross attribute analysis for sales data in a multi- dimensional planning system. The system (400) includes a set of processing modules (416) that performs cross attribute analysis and manipulation in online analytical processing (OLAP) and multi-dimensional planning applications (436) dimension splitting. A number of processing module are utilized to perform the required processing. The system (400) includes a hierarchy processing module for aggregating data up a hierarchical data structure, a dimension splitting module for creating pseudo-hierarchical data structures from data within the hierarchical data structure, and a multi- dimensional data viewing module for displaying a set of multi-dimensional data set according to the hierarchical data structure in a multi-dimensional spreadsheet. A single dimension corresponds to an attribute of the data contained within the hierarchical data structure.
70.
FAST APPLICATION NOTIFICATION IN A CLUSTERED COMPUTING SYSTEM
With fast notification of changes to a clustered computing system, through which a number of events are published for system state changes, applications can quickly recover and sessions can quickly be rebalanced. When a resource associated with a service experiences a change in status, such as a termination or a start/restart, a notification event is immediately published. Notification events contain information to enable subscribers to identify, based on matching a session signature, the particular sessions that are affected by the change in status, and to respond accordingly. This allows sessions to be quickly aborted and ongoing processing to be quickly terminated when a resource fails, and allows fast rebalancing of work when a resource is restarted.
Approaches are used for efficiently and effectively managing the dynamic allocation of resources of multi-node database systems between services provided by the multi-node database server. A service is a category of work that is hosted on the database server. The approaches manage allocation of resources at different levels. For services that use a particular database, the performance realized by the services is monitored. Resources assigned to the database are allocated between these services to ensure performance goals for each are met. Resources assigned to a cluster of nodes are allocated between the databases to ensure that performance goals for all the services that use the databases are met. Resources assigned to a farm of clusters are assigned amongst clusters based on service level agreements and back-end policies. The approach uses a hierarchy of directors to manage resources at the different levels.
Techniques allow a client to be migrated from a session that has been established for a client on a server to another session on another server in a way that is a transparent to the application for which the initial session was established. The sessions are migrated under conditions in which a copy of session state of the session to migrate from the source node does not have to be captured and restored to a destination session.
Techniques allow a client to be switched from a session on a server to another session on another server in a way that is a transparent to the application for which the initial session was established. Thus, under transparent session migration, a client is switched between sessions without executing application instructions tailored to accomplish the migration. Instead, a client-side interface component, through which the application interacts with the server, handles details of migration, modifying the internal state of the client-side interface component to effect the same. Legacy applications do not have to be modified in order to institute techniques described herein.
An approach efficiently and dynamically allocates and de-allocates database instances and nodes between databases. The approach performs this function in a way that accounts for the users of and services hosted by multiple databases.
A two copy versioning scheme is proposed. The scheme provides efficient implementation for a high read load database and eliminates read dependencies. The versioning scheme provides efficient implementation for transactions executing under ANSI READ COMMITTED isolation, and is extensible to serializable isolation. The two-copy versioning scheme is garbage free meaning that all versions of data records are used during execution and is adapted to index scanning operations. A "deferred delete" scheme allows read transactions to complete data deallocation operations. Statements that require "snapshots" are efficiently supported.
Various techniques are described for improving the performance of a shared- nothing database system in which at least two of the nodes that are running the shared-nothing database system have shared access to a disk. Specifically, techniques are provided for recovering the data owned by a failed node using multiple recovery nodes operating in parallel. The data owned by a failed node is reassigned to recovery nodes that have access to the shared disk on which the data resides. The recovery logs of the failed node are read by the recovery nodes, or by a coordinator process that distributes the recovery tasks to the recovery nodes.
G06F 11/20 - Détection ou correction d'erreur dans une donnée par redondance dans le matériel en utilisant un masquage actif du défaut, p.ex. en déconnectant les éléments défaillants ou en insérant des éléments de rechange
G06F 9/46 - Dispositions pour la multiprogrammation
77.
OWNERSHIP REASSIGNMENT IN A SHARED-NOTHING DATABASE SYSTEM
Various thechniques are described for improving the performance of a shared- nothing database system in which at least two of the nodes that are running the shared-nothing database system have shared access to a disk. Specifically, techniques are provided for changing the ownership of data in a shared-nothing database without changing the location of the data on persistent storage. Because the persistent storage location for the data is not changed during a transfer of ownership of the data, ownership can be transferred more freely and with less of a performance penalty than would otherwise be incurred by a physical relocation of the data. Various techniques are also described for providing fast run-time reassignment of ownership. Because the reassignment can be performed during run-time, the shared-nothing system does not have to be taken offline to perform reassignment. Further, the techniques describe how the reassignment can be performed with relatively fine granularity, avoiding the need to perform bulk reassignment of large amounts of data across all nodes merely to reassign ownership of a few data items on one of the nodes.
Various techniques are described for improving the performance of a shared- nothing database system in which at least two of the nodes that are running the shared-nothing database system have shared access to a disk. Specifically, techniques are provided for changing the ownership of data in a shared-nothing database dynamically, based on factors such as which node would be the most efficient owner relative to the performance of a particular operation. Once determined, the ownership of the data may be changed permanently to the new owner, or temporarily for the duration of the particular operation.
Techniques are provided for handling distributed transaction in shared-nothing database system where one or more of the nodes have access to a shared persistent storage. Rather than coordinate the distributed transaction using a two-phase commit protocol, the coordinator of the distributed transaction uses a one-phase commit protocol with those participants that have access to the transaction status information maintained by the coordinator. The transaction status information may reside, for example, in the redo log of the coordinator. In case that the coordinator fails, those participants can determine the state of the distributed transaction based on information stored on the shared disk. In addition, the coordinator is able to determine whether it is possible to commit the distributed transaction based on information that is stored on the shared disk by the participants, without those participants entering a formal "prepared " state.
Techniques for actionable messaging are provided. A message is sent to a device that outlines possible actions. Information for the message and action is stored and used when a response message is received. A user can then respond with a message specifying a desired action. The stored information is used to determine the action to perform and the action is performed.
One embodiment of the present invention provides a system that facilitates encryption of data within a column of a database. The system operates by first receiving a command to perform a database operation. Next, the system parses the command to create a parse tree. The system then examines the parse tree to determine if a column referenced in the parse tree is an encrypted column. If a column referenced in the parse tree is an encrypted column, the system automatically transforms the command to include one or more cryptographic commands to facilitate accessing the encrypted column while performing the database operation.
In one embodiment, a method of allowing a user to roam from one wireless network and interact with an Internet-based application is disclosed. The method comprises establishing a connection between a wireless mobile device and a first wireless network, wherein the connection allows the wireless mobile device to interact with an Internet-based application; tracking a state of interaction between the wireless mobile device and the Internet-based application; terminating the connection between the wireless mobile device and the first wireless network; establishing a connection between the wireless mobile device and a second wireless network; and sending, to the Internet- based application, data representing a state of interaction of the wireless mobile device with the Internet-based application prior to terminating the connection between the wireless mobile device and the first wireless network.
One embodiment of the present invention provides a system that facilitates security-enabled content caching. The system operates by first receiving a request from a user at a cache server for restricted content, wherein the cache server stores content for an application server. Next, the system determines if the restricted content is located on the cache server. If so, the system determines if the user is authorized to access the restricted content. If the user is authorized to access the restricted content, the system provides the restricted content to the user from the cache server. Providing the restricted content from the cache server eliminates the time consuming operations involved in requesting and receiving the restricted content from the application server.
H04L 67/5682 - Politiques ou règles de mise à jour, de suppression ou de remplacement des données stockées
H04L 69/329 - Protocoles de communication intra-couche entre entités paires ou définitions d'unité de données de protocole [PDU] dans la couche application [couche OSI 7]
An information search mechanism provides control over the relaxation of search queries to users that are requesting searches. Through this mechanism, users can specify a sequence of sub-queries that is associated with variations of the main search criteria, and specify a progression in which to execute the sub-queries. Hence, users can impart their priorities with respect to search term variations used in relaxing the main search criteria, which further allows the users to impart their notion of the relevance of results that may be returned by particular sub-queries. A query that includes a sequence of sub- queries is received and the sub-queries are executed, if at all, by a database server in an order based on the progression specified by the user. Response time and network loading are improved through reduction of unnecessary work by the database server and through reduction of costly communications between client and server and associated processing.
Techniques are described herein for returning a repository to a prior state. The repository may be, for example a database, and the prior state may be, for example the consistent state that the database had at a particular point in time in the past. When an operator-caused error has been introduced to the database by changes made by an already-committed transaction, the techniques described herein may be used to recover from the error by returning the database to a point in time prior to the commit time of the transaction that introduced the error. The techniques involve the generation of "physical undo" information, and the use of the physical undo information in conjunction with physiological undo and physiological redo to efficiently return a repository to the prior state.
G06F 11/14 - Détection ou correction d'erreur dans les données par redondance dans les opérations, p.ex. en utilisant différentes séquences d'opérations aboutissant au même résultat
86.
RETAINING HIERARCHICAL INFORMATION IN MAPPING BETWEEN XML DOCUMENTS AND RELATIONAL DATA
Techniques for managing XML data in an SQL compliant DBMS include receiving an SQL statement. The SQL statement includes a particular operator that operates on a first instance of XML type that represents a first set of XML elements. During execution of the SQL statement, the particular operator is evaluated by generating an ordered collection of instances of XML type. Each different instance in the ordered collection is based on a different XML element from the first set; and there is an instance in the ordered collection for every XML element from either the first set or from the first set and its descendents. When descendents are included, each entry in the ordered collection indicates a level in the XML tree. In another aspect, an aggregate operator in the SQL statement operates on a collection of instances, with associated levels, to generate a single instance of XML type.
brevets
