Entries |
Document | Title | Date |
20080201330 | SOFTWARE REPOSITORIES - The present invention extends to methods, systems, computer program products, and data structures for software repositories. Embodiments of the invention permit a user to group software related items from a software repository in repository container versions such that software related items can be accessed and processed together. A user has wide discretion on how software related items are grouped in repository container versions to facilitate efficient access and processing in varied computing environments. In some embodiments, software related items are grouped in the same repository container version based on component version such that all the software related items for a specified version of an application, framework, or service can be accessed and processed together. Accordingly, operations (e.g., replication or partitioning) can be performed on all the software related items in the repository container version to effectuate performing the operation on the specified version of the application, framework, or service. | 08-21-2008 |
20080208862 | System and method for locking context of sets of members in crosstabs - A context locking system locks context of a set of members in a crosstab for further data exploration and analysis. The context locking system has a context information manager and a locking manager. The context information manager collects context information of the selected member. The locking manager locks the context of the selected set based on the context information during further exploration or analysis of the crosstab, while allowing the locked set to reflect data changes in the data source. | 08-28-2008 |
20080208863 | Compound Item Locking Technologies - The present invention provides technologies including an item management system for the management of compound items and the storage of such items in tabular format using storage systems such as a database management system. Compound items may include file items which may be stored in a file format using storage systems such as a file system. The present invention further provides technologies for locking such compound items upon access by an application to preserve integrity of the items. In particular, the technologies allow for locking compound items including file items where the file items may be accessed via the item management system and/or via an associated file system. | 08-28-2008 |
20080208864 | Automatic disambiguation based on a reference resource - A novel system for automatically indicating the specific identity of ambiguous named entities is provided. An automatic disambiguation data collection is created using a reference resource. Explicit named entities are catalogued from the reference resource, together with various abbreviated, alternative, and casual ways of referring to the named entities. Entity indicators, such as labels and context indicators associated with the named entities in the reference resource, are also catalogued. The automatic disambiguation collection can then be used as a basis for evaluating ambiguous references to named entities in text content provided in different applications. The content surrounding the ambiguous reference may be compared with the entity indicators to find a good match, indicating that the named entity associated with the matching entity indicators is the intended identity of the ambiguous reference, which can be automatically provided to a user. | 08-28-2008 |
20080208865 | TRANSACTION PROCESSING SYSTEM AND METHOD - A method of conducting transactions in a gaming system comprising: providing a back end database; providing a front end database comprising at least one front end transactional data table partitioned into a plurality of time interval partitions; (a) conducting transactions for a client in one of the time interval partitions of the front end transactional data table; (b) locking the time interval partition in which transactions have been conducted; and (c) updating the back end database with transactions from the locked partition to synchronize the back end database to the front end database. | 08-28-2008 |
20080215586 | Simulating Multi-User Activity While Maintaining Original Linear Request Order for Asynchronous Transactional Events - A system and article of manufacture maintain the original order of a sequence of transactions originating from a source database and being replicated to a target database. A lockable object is associated with each transaction of the sequence of transactions from the source database. Each transaction has one or more transactional events. The transactions of the sequence of transactions have an order. The order is a commit order of the transactions in the source database. The lockable object is based on the commit order. A lock is attempted to be obtained on one or more lockable objects associated with one or more transactions of the sequence of transactions which precede a particular transaction of the sequence of transactions. In response to being unable to obtain the lock, the one or more transactional events of the one or more transactions which precede the particular transaction are serially processed. | 09-04-2008 |
20080215587 | Object State Transfer Method, Object State Transfer Device, Object State Transfer Program, and Recording Medium for the Program - When the states of a large number of objects must be transferred to another device, the overhead can be greatly reduced and the object states can be synchronized in a short period of time. At the time of creating an object, an object creation function arranges the internal state of the object into a byte sequence in a region for transfer, and sets mapping data in a mapping management table. When an application program has manipulated the internal state by using an accessor method, the state is set in the byte sequence in the region for transfer, or obtained therefrom. A transfer function transfers the byte sequence in the region for transfer and the mapping management table to a receiver, where a reproduction function reproduces the object based on the received data. | 09-04-2008 |
20080222150 | OPTIMIZATIONS FOR A BACKGROUND DATABASE CONSISTENCY CHECK - Two features allow for increased performance in running database consistency checks. First, a database consistency check runs directly on a database, as opposed to running on a saved database snapshot. This saves memory since there is no need to save a database snapshot. To handle any pages modified since a start of the database consistency check, a supplemental check runs on modified pages. Any facts generated by either check run through an early aggregation that attempts to aggregate facts during the database consistency check. | 09-11-2008 |
20080222151 | Information Handling System Employing Unified Management Bus - An information handling system includes a host including a central processing unit, a first management controller (MC) enabled to communicate with the host, and a network interface resource (NIR) in communication with the host and operable to enable the information handling system to communicate via an external network. The NIR includes a unified management module (UMM) operable to receive and route a local management packet, sent from the host, to the first management resource via a first unified management bus (UMB) and further operable to receive and route a remote management packet, sent from a remote resource via the external network, to the first management resource via the first UMB. | 09-11-2008 |
20080222152 | System and Method for Performing File System Checks on an Active File System - A system and method for performing File System checKing (FSCK) allows a file system to be accessed while the file system is being checked for consistency in the background. In the event that a file is accessed prior to having been checked for consistency by the background FSCK process, the background FSCK process is interrupted, and an in-context FSCK is performed on the accessed file. In addition, an in-context FSCK method and system is described which uses a snapshot block bitmap, FSCK block bitmap and FS block bitmap to check block consistency in the context of handling a block access to handle consistency and corruption issues as part of the file access. | 09-11-2008 |
20080228770 | Method for Performing Recoverable Live Context Migration in a Stacked File System - A method, system and program are provided for selectively managing data migration in a stacked filesystem that receives a request to migrate a data file to a destination context, where the data file is divided into a plurality of sub-regions such that data stored in different sub-regions may have different contexts. In response to the migration request, file data is sequentially migrated, one sub-region at a time, to the destination context by maintaining context status information for each sub-region in a metadata portion of the data file, where the context status information prevents another application from accessing any sub-region in the data file that is being migrated, but allows access to other sub-regions in the data file. | 09-18-2008 |
20080243846 | Locking semantics for a storage system based on file types - Techniques for implementing locking semantics for a storage system based on file types are described. An apparatus or system may include a database to store multiple data files, and a cache manager to manage the data files, the cache manager having a client lock manager to receive a request to modify a data file, determine a file type for the data file, access a set of locking semantics based on the file type, and determine whether the data file can be modified based on the locking semantics. Other embodiments are described and claimed. | 10-02-2008 |
20080243847 | Separating central locking services from distributed data fulfillment services in a storage system - Techniques for implementing locking semantics for a storage system are described. An apparatus or system may include a data server to store multiple data files, and a locking server to store locking information for one or more data files stored by the data server. The locking information may include a version number for a data file and a lock state for the data file. Other embodiments are described and claimed. | 10-02-2008 |
20080243848 | USER SPECIFIC LOGS IN MULTI-USER APPLICATIONS - User specific logs in multi-user applications. Level data associating a user of a multi-user application with a respective log level is received. The multi-user application then records an amount of information determined by the log level corresponding to the user presently using the multi-user application. | 10-02-2008 |
20080243849 | METHOD AND APPARATUS FOR SUPPORTING CONTEXT LINKS FOR APPLICATION PROGRAM TEXT - Methods and apparatus are provided for supporting text-based context links for application programs. An embodiment includes a first computer to maintain a database of data objects and a second computer to execute an application program that operates on a file having text elements. In an embodiment, the second computer is to execute a link program to access a data object on the first computer based on a user of the application program having used the application program to select a text element that is related to that data object. | 10-02-2008 |
20080243850 | FAULT TOLERANT MUTUAL EXCLUSION LOCKS FOR SHARED MEMORY SYSTEMS - The present invention provides a method of implementing a fault-tolerant mutual exclusion lock. The present invention records in a lock structure the IDs of all processes whose failure can lead to the permanent unavailability of the lock. When a process finds the lock unavailable and suspects a permanent failure, it queries the programming environment about the status of all or some of the processes that could have caused the lock's unavailability. If the programming environment determines that these processes have failed, the live process tries to usurp the lock. If it succeeds, it executes some recovery mechanism and frees the lock or proceeds to operate on the objects protected by the lock. The method guarantees recovery from process failures. | 10-02-2008 |
20080250019 | Method and Device for Recording of Data - A method for recording of data, including the steps of selecting a second set of individuals from a stream of individuals forming a first set of individuals, and providing said second set of individuals with an opportunity to record data on a data collection device ( | 10-09-2008 |
20080256073 | Transactional memory using buffered writes and enforced serialization order - Various technologies and techniques are disclosed that support buffered writes and enforced serialization order in a software transactional memory system. A buffered write process is provided that performs writes to shadow copies of objects and writes content back to the objects after validating a respective transaction during commit. When a write lock is first obtained for a particular transaction, a shadow copy is made of a particular object. Writes are performed to and reads from the shadow copy. After validating the particular transaction during commit, content is written from the shadow copy to the particular object. A transaction ordering process is provided that ensures that an order in which the transactions are committed matches an abstract serialization order of the transactions. Transactions are not allowed to commit until their ticket number matches a global number that tracks the next transaction that should commit. | 10-16-2008 |
20080256074 | EFFICIENT IMPLICIT PRIVATIZATION OF TRANSACTIONAL MEMORY - Apparatus, methods, and program products are disclosed that provide a technology that implicitly isolates a portion of a transactional memory that is shared between multiple threads for exclusive use by an isolating thread without the possibility of other transactions modifying the isolated portion of the transactional memory. | 10-16-2008 |
20080263043 | System and Method for Processing Concurrent File System Write Requests - A method for processing concurrent write operations in a computer system, the method comprising a first step of copying data residing in one or more source buffers to a contiguous intermediate buffer, prior to acquiring a lock for a write operation. In a second step, on acquiring the lock performing a translation operation between the intermediate buffer and a destination buffer, to process the write operation. | 10-23-2008 |
20080263044 | MECHANISM FOR DATA AGGREGATION IN A TRACING FRAMEWORK - A method is disclosed for obtaining data from a kernel, including obtaining data from the kernel, and storing the data in a data set an aggregation buffer using an aggregation function. A method is disclosed for storing data in a data set, wherein the data set includes a key component, an aggregation identifier component, and a value component, including obtaining an expression, a new value, and an aggregation identifier, generating a key using the expression and the aggregation identifier; and storing the data set in a buffer, wherein storing the data set comprises storing the key in the key component, storing the aggregation identifier in the aggregation identifier component, and updating a current value in the value component using the new value and an aggregation function. | 10-23-2008 |
20080270405 | File Operations with Persistent File Locking Techniques - File systems which provide several different and improved locking capabilities. An application on a client workstation communicates through a client driver to a server which interfaces with a metadata database, which contains locking information about the files. Applications perform as normal. The client driver provides lock and unlock requests to the server when a write lock or a read with intent to write lock is required. If only a read lock is considered appropriate, the client driver does not provide a lock request. The server transparently performs read operations and read locking using the metadata database without specific requests from the client driver. When a read with intent to write or write lock is required, the lock ownership is placed with a given expiration time. When the time expires the lock is not automatically released but remains with the particular requesting client driver until another client driver requests it. | 10-30-2008 |
20080270406 | SYSTEM AND METHOD FOR ADDING COMMENTS TO KNOWLEDGE DOCUMENTS AND EXPEDITING FORMAL AUTHORING OF CONTENT - A method for modifying knowledge documents, includes: retrieving an authored document per a client request; wiki-fying a copy of the retrieved authored document; accepting client comments into the wiki-fied authored document, while maintaining the integrity of the authored documents; notifying one or more authors of the authored document of the client comments in the wiki-fied copy of the authored document; modifying the authored document based on the determination of the one or more authors to the validity of the client comments; and replacing the authored document with the modified authored document. | 10-30-2008 |
20080270407 | SYSTEM FOR ENSURING REFERENTIAL INTEGRITY IN HIGHLY CONCURRENT DATABASE ENVIRONMENTS - A system for ensuring referential integrity in a concurrent transaction database environment is disclosed. The system determines when an update to a dependent object requires special processing, and if special processing is required, locating and locking parent objects of the dependent object in share mode prior to committing the update to the dependent object. | 10-30-2008 |
20080281824 | Data Management System Providing a Data Thesaurus for Mapping Between Multiple Data Schemas or Between Multiple Domains within a Data Schema - In one embodiment, a system is provided for managing a centrally managed master repository for core enterprise reference data associated with an enterprise. A centralized master repository contains the reference data, the reference data being associated with multiple schemas, each schema including one or more data models for reference data, each data model including one or more fields. A data management services framework coupled to the repository provides services for managing the reference data in the repository. The services framework supports a master schema including a union of multiple models and associated fields in the multiple schemas. The services framework also supports a thesaurus including, for each field in the master schema, a set of synonyms each representing a mapping between the field in the master schema and a corresponding field in a particular one of the multiple schemas. The master schema and thesaurus facilitate centralized management of the reference data in the repository across multiple heterogeneous external operational systems that have different associated data models and are provided indirect access to the reference data in the repository for operational use of the reference data according to associated business workflows. | 11-13-2008 |
20080281825 | APPARATUS FOR PROCESSING REAL-TIME MOBILE TRANSACTIONS IN A THREE-TIER DISTRIBUTED DATABASE SYSTEM - An apparatus that enables real-time processing of mobile based transactions in a three-tier database by employing pending operation/locks databases at each mirror in the three-tier database and generating a token for each proposed transaction that indicates the operations/locks needed to perform the transaction. The token is passed to each mirror database to compare with the corresponding operation/lock database. When a conflict is detected, a flag indicating such is set. | 11-13-2008 |
20080288496 | METHOD FOR IMPLEMENTING CONCURRENT PRODUCER-CONSUMER BUFFERS - A method and a system for implementing concurrent producer-consumer buffers are provided. The method and system in one aspect uses separate locks, one for putter and another for taker threads operating on a concurrent producer-consumer buffer. The locks operate independently of a notify-wait process. | 11-20-2008 |
20080288497 | Exclusive control method for database and program - A technology capable of preventing a problem which occurs when log writing of a preceding transaction fails while reducing waiting time of a subsequent transaction is provided. A database control method for releasing locking of data held by a transaction upon reception of a transaction completion instruction from an operation terminal or the like by a database is provided. The database includes an exclusive control module, a log output module, and a log buffer. The log output module stores a transaction completion log in the log buffer upon reception of the transaction completion instruction from the operation terminal. The exclusive control module releases locking held by the transaction upon reception of storage of the transaction completion log in the log buffer. | 11-20-2008 |
20080288498 | Network-attached storage devices - Systems and methods for managing data within a networked computer environment including application servers and a plurality of storage devices utilize a collection of service modules, each separately addressable from and in communication with the application servers and the storage devices and providing system-wide services to the application servers and the storage devices. | 11-20-2008 |
20080301140 | Method, Apparatus and Computer Program Product for Optimizing File Accesses for an Application Executing in a Virtual Container - Disclosed is a method, apparatus and a computer program of a virtual execution environment. In one aspect thereof a data processor includes a disk-based storage system and a virtual machine monitor configured to execute a program in a virtual container. The virtual machine monitor is responsive, prior to execution of the application, to record a set of files accessed during a phase change in the disk-based storage system in a manner predetermined to minimize the time needed to retrieve the set of files. The virtual machine monitor is further responsive, at the occurrence of the phase change, or prior to the occurrence of a phase change if the files are prefetched, to retrieve the files from the disk-based storage system. In a further aspect thereof there is provided a server of the virtual execution environment that includes a unit, responsive to receiving notification from the at least one virtual machine monitor of an occurrence of contemporaneous file accesses not associated with a known phase change of a virtual container, for evaluating the occurrence as a candidate phase change and, responsive to the evaluation indicating a presence of a previously unknown phase change, for adding a list of the files accessed to a phase change template for use by the same or a different virtual machine monitor during another instance of execution of the application. | 12-04-2008 |
20080306950 | Arrival rate throttles for workload management - A computer-implemented method, system and article of manufacture for managing workloads in a computer system, comprising monitoring system conditions and operating environment events that impact on the operation of the computer system, regulating execution of one or more queries based on the monitored system conditions and operating environment events using arrival rate throttles, and performing the queries to access data in a database for presentation and use to a user. | 12-11-2008 |
20080313185 | MANAGING ACCESS TO OBJECTS OF A COMPUTING ENVIRONMENT - Access to objects of a computing environment is managed. Access to an object of the computing environment is prohibited via one cached entity corresponding to the object, while access to the object is allowed via another cached entity. The cached entities are concurrently maintained for a period of time, but the one cached entity is in a shadow state. In one example, the cached entities are session locks and the object is a file system object. | 12-18-2008 |
20080319996 | Distributed Lock Manager For File System Objects In A Shared File System - A method and apparatus are provided for mediating access to a shared object in a naive computer system having a shared-nothing operating system layered on a shared file system. At least one primary token is utilized as a tool to mediate ownership of one or more shared objects in the naive system. A secondary token is created and utilized to mediate ownership of one or more shared objects. The secondary token created and utilized in limited circumstances, such as when the owner of the primary token ceases communicating with one or more requesters of the primary token. | 12-25-2008 |
20080319997 | COMBINED PESSIMISTIC AND OPTIMISTIC CONCURRENCY CONTROL - Various technologies and techniques are disclosed that improve implementation of concurrency control modes in a transactional memory system. A transactional memory word is provided for each piece of data. The transactional memory word includes a version number, a reader indicator, and an exclusive writer indicator. The transactional memory word is analyzed to determine if the particular concurrency control mode is proper. Using the transactional memory word to help with concurrency control allows multiple combinations of operations to be performed against the same memory location simultaneously and/or from different transactions. For example, a pessimistic read operation and an optimistic read operation can be performed against the same memory location. | 12-25-2008 |
20090006400 | TECHNIQUE FOR ENABLING MULTIPLE ACTIONS TO BE PERFORMED ON AN ACTIVE DATA ITEM - A record is processed, and a determination is made as to whether a data item in the record is usable by any one of a plurality of applications that are operable on the device. The detected data item is made actionable by assigning multiple actions to the data item, so that each action is programmatically initiated responsive to a designated input. | 01-01-2009 |
20090006401 | FILE MONITORING METHOD, SYSTEM, AND PROGRAM PRODUCT - The present invention provides a file monitoring approach that runs on bridge servers in an SNI environment, monitors a defined folder and detects the same file existing (by its file name persisting) for a predetermined interval period or longer. Optionally, the program can attempt to unlock the ticket corresponding to the inbound update. It also sends notification of the condition to bridge support. If the option to unlock the ticket is used, it reports on the success or failure of the attempt to unlock the ticket in the notification sent. One advantage of using this approach is to automatically detect when this condition is occurring to avoid bridge log space problems, possible customer calls to a helpdesk to request tickets be unlocked, and to notify bridge support. This approach helps to automate bridge support. | 01-01-2009 |
20090006402 | METHODS AND SYSTEMS FOR THE DYNAMIC SELECTION OF A LOCKING STRATEGY - Systems and methods are provided for dynamically selecting a locking strategy for a request by a source to use a stored data object in a computerized system. According to one implementation, a method is provided that comprises receiving, by a locking layer, a request from the source to use a stored data object, and determining, with the locking layer, a locking strategy for the request based on a set of locking configuration rules modifiable by a system administrator. The method also includes associating the request with the determined locking strategy. In some implementations, the request and locking strategy may be forwarded to a data management server, which obtains the physical locks on the data objects. The locking strategy may also be changed by the locking layer when the use of the object changes during runtime of the application. | 01-01-2009 |
20090006403 | EFFICIENTLY BOOSTING PRIORITY OF READ-COPY UPDATE READERS WHILE RESOLVING RACES WITH EXITING AND UNLOCKING PROCESSES - A technique for efficiently boosting the priority of a preemptable data reader while resolving races between the priority boosting and the reader exiting a critical section or terminating in order to eliminate impediments to grace period processing that defers the destruction of one or more shared data elements that may be referenced by the reader until the reader is no longer capable of referencing the one or more data elements. A determination is made that the reader is in a read-side critical section and the reader is designated as a candidate for priority boosting. A verification is made that the reader has not exited its critical section or terminated, and the reader's priority is boosted to expedite its completion of the critical section. The reader's priority is decreased following its completion of the critical section. | 01-01-2009 |
20090006404 | Handling falsely doomed parents of nested transactions - Various technologies and techniques are disclosed for detecting falsely doomed parent transactions of nested children in transactional memory systems. When rolling back nested transactions, a release count is tracked each time that a write lock is released due to rollback for a given nested transaction. For example, a write abort compensation map can be used to track the release count for each nested transaction. The number of times the nested transactions releases a write lock is recorded in their respective write abort compensation map. The release counts can be used during a validation of a parent transaction to determine if a failed optimistic read is really valid. If an aggregated release count for the nested children transactions accounts for the difference in version numbers exactly, then the optimistic read is valid. | 01-01-2009 |
20090006405 | Using type stability to facilitate contention management - Various technologies and techniques are disclosed for providing type stability techniques to enhance contention management. A reference counting mechanism is provided that enables transactions to safely examine states of other transactions. Contention management is facilitated using the reference counting mechanism. When a conflict is detected between two transactions, owning transaction information is obtained. A reference count of the owning transaction is incremented. The system ensures that the correct transaction was incremented. If the owning transaction is still a conflicting transaction, then a contention management decision is made to determine proper resolution. When the decision is made, the reference count on the owning transaction is decremented by the conflicting transaction. When each transaction completes, the reference counts it holds to itself is decremented. Data structures cannot be deallocated until their reference count is zero. Dedicated type-stable allocation pools can be reduced using an unstable attribute. | 01-01-2009 |
20090006406 | Memory transaction grouping - Various technologies and techniques are disclosed for providing a transaction grouping feature for use in programs operating under a transactional memory system. The transaction grouping feature is operable to allow transaction groups to be created that contain related transactions. The transaction groups are used to enhance performance and/or operation of the programs. For example, different locking and versioning mechanisms can be used with different transaction groups. When running transactions, a hardware transactional memory execution mechanism can be used for one transaction group while a software transactional memory execution mechanism used for another transaction group. | 01-01-2009 |
20090006407 | Parallel nested transactions in transactional memory - Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. For example, pessimistic reads are supported. A pessimistic duplication detection data structure is created for a parallel nested transaction. An entry is made into the data structure for each pessimistic read in the parallel nested transaction. When committing the parallel nested transaction, new pessimistic read locks are passed to an immediate parent, and an entry is made into a separate pessimistic duplication detection data structure of the immediate parent with synchronization between sibling transactions. The pessimistic duplication detection data structures can also be used for upgrades from pessimistic reads to write locks. Retry operations are supported with parallel nested transactions. Write abort compensation maps can be used with parallel nested transactions to detect and handle falsely doomed parent transactions. | 01-01-2009 |
20090006408 | DOCUMENT MANAGEMENT METHOD AND APPARATUS - A start date of check-out processing of setting a shared document accessible by a plurality of users via a network into an exclusive state is reserved as a check-out start date based on an instruction of a user. In the exclusive state, the shared document can be updated by the user but cannot be updated by other users. When current date has reached the check-out start date, the shared document is set into the exclusive state for the user. The shared document can be released from the exclusive state in response to an instruction of the user checking-out the shared document. An expected check-in date to release the shared document from the exclusive state after the check-out start date can be reserved. This invention enables reservation for a document operation and prevents any decrease in the operation efficiency of users. | 01-01-2009 |
20090012960 | PROCESS AND METHODOLOGY TO MAINTAIN CONSISTENCY ACROSS DISPARATE INTERFACED SYSTEMS - A process and methodology are disclosed to maintain consistency across disparate systems. An interface is provided comprised of a fulfillment client in which to place orders, a middleware to pass data, manufacturing and shipment systems to process orders, and a shipping and packing information repository system to house data. The methodology implements, inter alia, remote function calls to the asynchronously/synchronously interfaced systems during defined points of order processing to establish the status of the systems availability and the status of the order at the exact time of a predetermined activity. Also, information regarding the order status is posted as both a displayed on-line message to a user and in distinct status fields for future review. Furthermore, this method dynamically reacts to failed communication through the resetting of orders to a previous state to ensure data integrity across the distributed computing environment. | 01-08-2009 |
20090019047 | CONCURRENT DIRECTORY UPDATE IN A CLUSTER FILE SYSTEM - A method for avoiding directory conflicts across a file system having multiple nodes with one node representing a token manager. For each directory, at least one metanode responsible for directory updates. The method involving obtaining a name-based lock on a filename. Querying the token manager for a lock token. If a new token is obtained, sending a Remote Procedure Call (RPC) to the metanode to obtain matching directory entries, and caching the result of the RPC so that subsequent operations on that filename can be satisfied without additional messages sent to the metanode. Updating a cached directory block in memory by creating a new directory entry in the block or deleting an existing directory entry from the block. Information regarding the updating is sent to the metanode on one of: periodic schedule, a subsequent synchronization event, or when the name-based lock token is revoked. | 01-15-2009 |
20090019048 | Document lock manager - A lock manager is provided for locking documents. In some implementations, the lock manger initiates a first lock on a document that prevents other users from editing the document while it is being displayed to the user. If edits to the document are made by the user, the edits are placed in a queue for subsequent finalization, and a second lock is placed on the document. The second lock prevents other users from editing the document until the edits have been finalized. | 01-15-2009 |
20090019049 | System and Method for Distributing Trade Signals - A system and method for distributing trade signals is provided. The method includes, for example, receiving at least one trade signal from at least one trading strategy, constructing a first list of trades from the at least one trade signal, storing the list of trades in a database that is accessible through a network to specified users, comparing a second list of trades on a client computer to the first list of trades in the database, and executing the trades on the first list of trades in the database. | 01-15-2009 |
20090037416 | METHOD FOR ACQUIRING LOCKS IN WAIT MODE IN A DEADLOCK FREE MANNER - Techniques for a data definition language (DDL) statement acquiring a lock on a table in wait mode in a deadlock free manner are provided. A DDL statement specifies metadata of a table that is to be modified, whereas a data manipulation language (DML) statement specifies a table to be modified. When a DDL statement is received, a proxy statement is initiated and executed instead of first acquiring an exclusive lock on metadata of a particular table. The proxy statement is similar to a DML statement in that the proxy statement acquires a lock on the particular table. After the proxy statement has been processed, an exclusive lock on the metadata is acquired. | 02-05-2009 |
20090037417 | AVOIDING LOCK CONTENTION BY USING A WAIT FOR COMPLETION MECHANISM - Techniques for avoiding lock contention when processing data definition language (DDL) statements are provided. Some DDL statements modify metadata of a table and then require access to the table. After such a DDL statement modifies the metadata of a table and the updated metadata is made available (i.e., published) to other database statements, execution of the DDL statement is suspended. Data manipulation language (DML) statements acquire locks on the table. In one approach, the locks, of any DML statement, that are granted after the DDL statement is issued are timestamped. The DDL statement uses the timestamps to determine when to access the table. The timestamps are used to determine when the last DML statement (that was pending at the time the modified metadata was published) commits and releases its lock on the table. | 02-05-2009 |
20090037418 | Method and system for copying a snapshot tree - Various embodiments of the present invention are directed to an instant snapshot-tree-copy operation that, when directed to an existing snapshot tree, generates a data-structure framework for a copy of the existing snapshot tree that can be immediately accessed while a background-copy process copies data from the existing snapshot tree to the copy snapshot tree. The background-copy process copies data from the existing snapshot tree to the copy snapshot tree in top-down fashion, from the source logical device through each of the snapshot logical devices. While copying each logical device, the background-copy process sequentially copies data-storage units from a corresponding logical device of the existing snapshot tree to the copy-snapshot-tree logical device, making sure to adjust chains of dependencies within the copy snapshot tree to reflect modifications to the snapshot copy tree that occur independently from the background-copy process. A host computer may immediately access the copy snapshot tree, both for READ and WRITE access, even before completion of the background-copy process. | 02-05-2009 |
20090043770 | Method of Realizing Commands Synchronization in Supporting Multi-Threading Non-Volitale Memory File System - A method may be used in a multi-threading non-volatile memory file system. The method comprises creating a data structure to store progress information on one or more concurrent operations to access a file system of a non-volatile memory; and executing the one or more concurrent operations based on the progress info. | 02-12-2009 |
20090043771 | SYSTEMS, METHODS AND COMPUTER PRODUCTS FOR ENSURING DATA INTEGRITY OF A STORAGE SYSTEM - Systems, methods, and computer products for ensuring data integrity of a storage system. Exemplary embodiments include a method for ensuring data integrity in a storage system, the method including creating a data set using a repeatable pattern to establish expected values, storing the data set into the storage system using a defined interface of the system, extracting the data from the storage system using a defined interface of the system and comparing the extracted data against the expected values established by the known pattern. | 02-12-2009 |
20090043772 | UTILIZING SHARED NUMERIC LOCKS - A method and system for performing at least one transaction on at least one column of a table in a database system is disclosed. The method includes determining whether a first transaction of the at least one transaction fulfills all of at least one criteria. The method further includes ensuring that the at least one column is in a shared numeric lock if the first transaction fulfills all of the at least one criteria, wherein the shared numeric lock is a lock that allows at least a second transaction fulfilling all of the at least one criteria to access the same column concurrently with the first transaction without releasing the shared numeric lock between transactions, and wherein the shared numeric lock is released only after all of the transactions fulfilling all of the criteria have completed processing. The method further includes processing the first transaction. | 02-12-2009 |
20090063486 | DATA REPLICATION USING A SHARED RESOURCE - Techniques are presented for data replication. Two or more nodes are engaged in data replication with one another. When a node acquires a write lock, the write is processed to a local disk associated with the node and communicated to a shared disk. During recovery of a particular node following a failure, the shared disk is accessed to assist in synchronizing that particular node. | 03-05-2009 |
20090063487 | SECURING TRANSFER OF OWNERSHIP OF A STORAGE OBJECT FROM AN UNAVAILABLE OWNER NODE TO ANOTHER NODE - Provided are a method, system, and article of manufacture that maintain a plurality of nodes coupled over a network, wherein a first node of the plurality of nodes initially owns a plurality of storage objects accessible via the network. A serialization lock is maintained in association with the plurality of storage objects, wherein the first node becomes unavailable. A second node of the plurality of nodes determines that the second node is to preemptively assume ownership of a selected storage object of the plurality of storage objects initially owned by the first node that has become unavailable. The second node acquires the serialization lock. The second node secures ownership of the selected storage object, subsequent to acquiring the serialization lock. | 03-05-2009 |
20090063488 | Advanced Concurrency Management in Enterprise Service Oriented Architecture Based Integrated Business Processing of Distributed Application Components - A system and process that manages access to a resource in an enterprise service-oriented architecture environment. The system recognizes a master for each resource that has ultimate control over the respective resource. The master grants access to the resource though a lock system. If a system does not relinquish access to the resource, then the master is able to reclaim the lock to ensure the continued availability of the resource to all systems. This system ensures data coherency, while also improving performance by diminishing the amount of time a resource is unnecessarily locked and the time to obtain a lock. | 03-05-2009 |
20090063489 | Accessing Data Entities - A method of accessing data entities in a client-server system is disclosed. The client-server system comprises a set of clients, a server system, and a repository for storing a plurality of data entities. The server system comprises an inter-transactional cache, the inter-transactional cache being accessible for each client of the set of clients. A first client of the set of clients comprises a first intra-transactional cache. If a copy of a first data entity is in the inter-transactional cache, a version identifier of the original first data entity is read from the repository. If the copy of the first data entity is to be accessed with an exclusive lock, a copy of the copy of the first data entity is added to the first intra-transactional cache. The copy of the copy of the first data entity in the first intra-transactional cache is accessed for further processing of the first data entity by the first client. | 03-05-2009 |
20090070330 | DUAL ACCESS TO CONCURRENT DATA IN A DATABASE MANAGEMENT SYSTEM - Various embodiments include one or more of systems, methods, software, and data structures that allow dual access to concurrent data in a database management system including uncommitted updated data. Some embodiments include a dual snapshot of data in a multi-version concurrency control style database, but the embodiments described herein are equally applicable to virtually any other type of database and database management system. | 03-12-2009 |
20090070331 | Quality filter for the internet - A method and system of rating media content is provided. The method and system provide for a selection of a criterion of quality. A standard quality profile is then determined for the criterion of quality. A filter having a similar quality profile to the criterion of quality is chosen. Statistical analysis may be employed in determining the similarities between the standard quality profile and the filter to be chosen. This filter can be applied to an unknown media sample to produce a rating of the media sample. Filter monitoring may be performed on the filter by comparing the ratings of a media sample from the criterion of quality and the filter. | 03-12-2009 |
20090077080 | FAST PATH FOR GRACE-PERIOD DETECTION FOR READ-COPY UPDATE SYSTEM - A technique for implementing fast path grace period detection for deferring the destruction of a shared data element until pre-existing references to the data element are removed. A check is made, without using locks to exclude other updaters, for the presence of readers that are accessing the shared data elements. Grace period detection is terminated to initiate deferred destruction of the data element if there are no readers accessing the shared data element. If there are readers accessing the shared data element, a lock is implemented and another check is made for the presence of the readers. | 03-19-2009 |
20090077081 | Attribute-Based Item Similarity Using Collaborative Filtering Techniques - A system and method to compute attribute-based similarity between items using collaborative filtering techniques are described. Events input by a user over a network are received, the events further including a plurality of items and associated item metadata. A similarity value is further computed between each pair of items within the plurality of stems based on corresponding attributes of each item stored within the item metadata. Finally, recommendations of the items to the user are presented based on the corresponding calculated similarity value. | 03-19-2009 |
20090077082 | Parallel nested transactions in transactional memory - Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Releasing a duplicate write lock for rollback is supported. During rollback processing of a parallel nested transaction, a write log entry is encountered that represents a write lock. If the write lock is a duplicate, a global lock is used to synchronize access to a global versioned write lock map. Optimistic read validation is supported. During validation, if a versioned write lock indicates a sibling conflict, consult information to determine if a parallel nested transaction should be doomed. Write lock acquisition is supported. Upon attempting to acquire a write lock for a parallel nested transaction, a transactional memory word is analyzed to determine if the write lock can be obtained. If the transactional memory word indicates a versioned write lock, retrieve a write log entry pointer from a global versioned write lock map. | 03-19-2009 |
20090077083 | Parallel nested transactions in transactional memory - Various technologies and techniques are disclosed for supporting parallel nested transactions in a transactional memory system. Multiple closed nested transactions are created for a single parent transaction, and the closed nested transactions are executed concurrently as parallel nested transactions. Various techniques are used to ensure effects of the parallel nested transactions are hidden from other transactions outside the parent transaction until the parent transaction commits. For example, versioned write locks are used with parallel nested transactions. When a transactional memory word changes from a write lock to a versioned write lock, an entry is made in a global versioned write lock map to store a pointer to a write log entry that the versioned write lock replaced. When the versioned write lock is encountered during transaction processing, the global versioned write lock map is consulted to translate the versioned write lock to the pointer to the write log entry. | 03-19-2009 |
20090094241 | INFORMATION PROCESSING DEVICE, INFORMATION MANAGEMENT DEVICE, INFORMATION PROCESSING SYSTEM AND COMPUTER READABLE MEDIUM - An information processing device includes a lock section, a creation section, a transmission section, a reception section, and a release section. The lock section disables an authorization function of the information processing device under a given condition. The creation section creates a first lock release file so that releasing the function due to the lock section. The transmission section transmits the first lock release file created by the creation section to the information management device. The reception section receives a second lock release file which is transmitted as a reply from the information management device based on the first lock release file. The release section tries to enable the authorization function of the information processing device when the second lock release file is judged to be valid. | 04-09-2009 |
20090094242 | Method and system for intra-document object locking in collaborative authoring - A collaborative authoring system and method is disclosed. A collaboration server stores objects and applications open the objects stored on the collaboration server as documents. Collaborative authoring is enabled through a combination of coarse-grained server locks on objects stored in a collaboration server for short term server transactions and fine-grained application specific internal locks to lock portions of documents for authoring sessions. When an application begins an authoring session, an object stored in the collaboration server is opened as a document in an application, a server lock is applied to the object, internal locks are applied to portions of the document, and the server lock is removed from the object. | 04-09-2009 |
20090094243 | METHOD FOR MANAGING LOCK RESOURCES IN A DISTRIBUTED STORAGE SYSTEM - A method and a distributed locking system for the management of lock resources in a distributed files system having several lock managers, each managing lock resources in its respective domain. Each lock manager maintains a registry lock file that comprises of a list of all locked files and a list of lock requests. The registry lock files of all lock managers in the distributed locking system are saved in a central database. Furthermore, the system enables concurrent locking operations of different file sharing protocols on the same file system resources. | 04-09-2009 |
20090106247 | METHOD AND SYSTEM FOR ALLOWING MULTIPLE USERS TO ACCESS AND UNLOCK SHARED ELECTRONIC DOCUMENTS IN A COMPUTER SYSTEM - A system for allowing multiple users to access and unlock shared electronic documents in a computer system. A group of users are defined as potential “lock-breaker” users for a document, such that they are automatically contacted in the event that a user wishes to unlock the document after it has been locked by another user. The lock-breaker users defined for a document are given access rights to the document that allow them to break a current lock on the document, so that it can be opened for editing, and accordingly re-locked. The lock-breaker users for a document may be organized in a hierarchy, such as a hierarchy matching the relationships of employees of an organization. The lock-breaker hierarchy may define the order in which the lock-breaker users are automatically contacted when a user wishes to access a locked document (e.g. an LDAP directory tree or social network). | 04-23-2009 |
20090106248 | OPTIMISTIC LOCKING METHOD AND SYSTEM FOR COMMITTING TRANSACTIONS ON A FILE SYSTEM - In a file system shared by multiple servers, reservation of a data storage unit such as a LUN of a disk array to acquire locks in order to commit a transaction acting on data stored in the data storage unit is deferred until the transaction is completed in RAM and the locks can be acquired in parallel during a single instance of reserving the data storage unit. | 04-23-2009 |
20090125518 | Collaborative Authoring - A collaborative authoring application provides an authoring environment in which two or more users can edit a document concurrently. Each user edits a copy of the document, sends updates to a master copy of the document, and receives updates from the master copy of the document. The authoring environment generally inhibits the users from providing conflicting editing instructions to the master copy of the document. For example, each user can generate a content lock about one or more data units within the document. The authoring environment may synchronize content locks automatically and content only at the request of the user. | 05-14-2009 |
20090125519 | Device, system, and method for regulating software lock elision mechanisms - A method, apparatus and system for, in a computing apparatus, comparing a measure of data contention for a group of operations protected by a lock to a predetermined threshold for data contention, and comparing a measure of lock contention for the group of operations to a predetermined threshold for lock contention, eliding the lock for concurrently executing two or more of the operations of the group using two or more threads when the measure of data contention is approximately less than or equal to the predetermined threshold for data contention and the measure of lock contention is approximately greater than or equal to a predetermined threshold for lock contention, and acquiring the lock for executing two or more of the of operations of the group in a serialized manner when the measure of data contention is approximately greater than or equal to the predetermined threshold for data contention and the measure of lock contention is approximately less than or equal to a predetermined threshold for lock contention. Other embodiments are described and claimed. | 05-14-2009 |
20090125520 | Design of Self-Adapting Meta Descriptors Based Upon Real Use Scenarios and Experiences - Provided is a system for generating an on-demand, custom runtime solution to a user or Business's computing needs. A library of software components corresponding to different computing tasks of a business situation is created. Each software component is associated with one or more meta descriptors. The software components and related meta descriptors are managed by means of a software component meta management system (SCMMS). Meta descriptors are self adaptive in a manner that reflects real use scenarios. Meta descriptors describe both static and dynamic attributes of components. | 05-14-2009 |
20090132534 | Remote replication synchronizing/accessing system and method thereof - A remote replication synchronizing/accessing system and a method thereof applied between a local system and a remote mirroring system of the local system. After the remote mirroring system is created, an initialization synchronous operation of the remote mirroring system is sequentially performed according to a sequence of data blocks in storage of the local system. A small-granulated exclusive lock function is established between the initialization synchronous operation and a data-accessing request operation of the local system. During the initialization synchronous process of the remote mirroring system, it is determined whether a data block position corresponding to the current initialization synchronous operation is the same as that corresponding to the data-accessing request operation or not. Finally, according to a position determination result and the small-granulated exclusive lock function, a data-accessing request is directed processed or processed after finishing the initialization synchronous operation. | 05-21-2009 |
20090132535 | Multiversion concurrency control in in-memory tree-based data structures - A method and apparatus for providing concurrent access to a cache node of a tree-based data structure. Readers concurrently read access the cache node. A copy of the cache node is created for a write access of a writer. Only one copy of the cache node is allowed at any one time. The writer operates on the copy of the cache node while concurrent read access of the cache node are provided to the readers. | 05-21-2009 |
20090144281 | SPECULATIVE COMPUTATION LOCK COARSENING THROUGH THE USE OF LOCALIZED LOCK RESERVATION - A computer-implementable method, system and computer-usable medium. One or more objects among a plurality of objects can be processed utilizing a data-processing apparatus/system. One or more lock reservations can be applied among a group of lock reservations over a multiple sequential lock operations with respect the particular object. Thereafter, the lock reservation can be cancelled with respect to the last monitor exit operation in order to eliminate lock operations where traditional lock coarsening cannot be applied. | 06-04-2009 |
20090150394 | Document Merge - Methods and systems of merging a first document with at least a second document to generate a third document. Each of the first and second documents includes at least one data unit. Each data unit is associated with a unit identifier and an edit identifier. The unit identifiers of each of the documents are compared to the unit identifiers of the other document to determine whether each unit identifier is a matching or non-matching unit identifier. Edit identifiers of the data units associated with the matching unit identifiers are compared to each other. Data units associated with the non-matching unit identifiers are inserted directly into the third document. Data units associated with the matching unit identifiers and the matching edit identifiers are inserted directly into the third document. Data units associated with the matching unit identifiers and the non-matching edit identifiers are merged into the third document. | 06-11-2009 |
20090150395 | SYSTEM AND METHOD FOR UPDATING FILE - Provided is a system and method for updating a plurality of the same files consistently. The file update system comprises a first and a second data servers formed as pipe line type network for storing an original file and a duplicate file of the original file respectively, and for updating both the original file and the duplicate file in response to an update request, wherein the first and the second data servers mutually exchange file update information, correct the file update information so as to prevent overlapped update due to a plurality of update requests for the same file, and then update the original file or the duplicate file according to the corrected file update information. | 06-11-2009 |
20090150396 | DATABASE SCHEMA MANAGEMENT SYSTEM - Methods, systems and program storage devices for managing schema changes made by a user to an object in a database. The method including: (a) intercepting a database command entered by said user; (b) if said database command is a schema change command referencing said object in said database and a registry criterion is met, then inserting said database command or a command derived therefrom into a registered storage, otherwise releasing said database command to said database for execution thereby; (c) releasing said database command or a command derived therefrom from said registered storage to said database for execution thereby when a release criterion is met thus giving rise to a released command; and (d) inserting said released command or a command derived therefrom into a history storage. | 06-11-2009 |
20090157683 | Method and System for Accessing Selected Content - A system, method and computer product for accessing content by receiving as input an anchor, where the anchor is associated with selected content within an existing document, the document for example being an existing web page, and upon selecting the anchor, displaying the selected content to the user. Also disclosed is a system, method and computer product for identifying content, creating an anchor for the selected content and transmitting the selected content to one or more users over a communication link. | 06-18-2009 |
20090157684 | LOAD DISTRIBUTION IN DISTRIBUTED DATABASE SYSTEM - A state change in a network comprising a master server among a plurality of servers is determined, at the master server, a first lookup table is calculated, said first lookup table indicating respective partitions of a second lookup table distributed among active servers of said plurality of servers, the calculated first lookup table is distributed to each active server, and based on the first lookup table, at the master server, a modified partition of the second lookup table is generated. | 06-18-2009 |
20090164467 | Ice recognition function to override mobile device lock code - An apparatus includes a data processor; a user interface; and a memory that stores data representing a contacts database. The contacts database contains a plurality of entries, where each entry has a plurality of fields including at least a name field and a contact field storing information indicating how an entity identified in the name field may be contacted. The data processor is configurable to respond to the apparatus being currently locked by a lock code to prompt a user via the user interface to enter the lock code and, if the user instead enters a predetermined text string that indicates the user wishes to obtain information descriptive of an entity to be contacted in case of an emergency, the data processor presents the user, via the user interface, with only that entry or those entries from the contacts database that are associated with the predetermined text string. The text string may be “ICE” (in case of emergency). | 06-25-2009 |
20090164468 | SYSTEM FOR CONTROLLING CONCURRENT ACCESS TO DATA IN A DATABASE SYSTEM - A system for controlling concurrency of access to data in a database system is provided. The system includes receiving a lock request for access to data in the database system, in which the lock request is a request for a page lock or a row lock for a corresponding row or page in the database system containing the data. The method further includes identifying a partition in the database system that contains the row or the page in the database system containing the data; associating the lock request with a partition lock on the partition that contains the row or the page in the database system containing the data; and accessing the data using the partition lock. | 06-25-2009 |
20090171962 | System and Method for Implementing Nonblocking Zero-Indirection Transactional Memory - Systems and methods for implementing and using nonblocking zero-indirection software transactional memory (NZSTM) are disclosed. NZSTM systems implement object-based software transactional memory that eliminates all levels of indirection except in the uncommon case of a conflict with an unresponsive thread. Shared data is co-located with a header in an NZObject, and is addressable at a fixed offset from the header. Conflicting transactions are requested to abort themselves without being forced to abort. NZObjects are modified in place when there are no conflicts, and when a conflicting transaction acknowledges the abort request. In the uncommon case, NZObjects are inflated to introduce a locator and some levels of indirection, and are restored to their un-inflated form following resolution of the conflict. In some embodiments, transactions are executed using best effort hardware transactional memory if it is available and effective, and software transactional memory if not, yielding a hybrid transactional memory system, NZTM. | 07-02-2009 |
20090171963 | SYSTEM AND PROGRAM PRODUCTS FOR EFFICIENTLY LOCKING RESOURCES OF A GLOBAL DATA REPOSITORY - Concurrent access to a global data repository is provided, while minimizing the number of locks acquired to provide the concurrent access. One or more resources within the global data repository have predefined relationships with one or more other resources of the repository. Thus, locking for a particular resource is based on its relationship with one or more other resources of the repository. | 07-02-2009 |
20090177658 | FINE-GRAINED AND CONCURRENT ACCESS TO A VIRTUALIZED DISK IN A DISTRIBUTED SYSTEM - A method for updating a block on disk is provided. The method involves one or more clients committing log records to queues corresponding to blocks. The method further involves checkpointing, which includes obtaining a flushing lock on the queue by a client, receiving log records from the queue, applying the log records to a block on disk, and deleting the log records from the queue. A block on disk may be updated by first applying the log records from a queue to a locally cached version of the block corresponding to the queue. The locally cached version may then be stored on the disk replacing the original block on disk or being stored as a new version of the original block. | 07-09-2009 |
20090182746 | READ MOSTLY DATABASE TABLES - Described is a technology by which a database management system more efficiently processes read requests than write requests for a read-mostly database table, which is a database table that is generally read far more often than written. A lock partitioning mechanism may be implemented to provide a read lock for each CPU of a plurality of CPUs, in which only one read lock is acquired to process a read request. A database table state changing mechanism may be implemented that more efficiently processes read requests relative to write requests by maintaining the database table in a read-only state until a write request is processed. When a write request is received, the database table is changed to a read-write state to process the write request. The database table is then reset back to a read-only state, such as by running a background thread. | 07-16-2009 |
20090193025 | Method and system for controlling accesses to a database - The frequency of occurrences of an exclusion process is reduced so as to enhance the efficiency of handling accesses to a database. A system is provided for controlling accesses to a database. The system includes a database identifying section that identifies a database corresponding to an input of a first access command, an access judging section that judges whether a series of accesses to the identified database initiated by a second access command still continue, a frequency determining section that determines how often accesses to the identified database occur with reference to a history of accesses. The system further comprises an access control section that checks the accesses made by the first access command to the identified database when the series of accesses to the identified database initiated by the second access command still continue and the frequency of accesses to the identified database determined by the frequency determining section is higher than or equal to a predetermined value. | 07-30-2009 |
20090198694 | Resolving conflicts in a transactional execution model of a multiprocessor system - In one embodiment, the present invention includes a method for resolving conflicts, including receiving data access requests from multiple requestors at a home agent that owns the data, determining whether any of the requests are transactional requests, any of the requestors obtains the data forwarded from another agent, and a highest priority transactional requestor, and based at least in part on the determining, sending from the home agent a first message to the highest priority transactional requestor to indicate that the highest priority transactional requestor is to not abort its transaction and a second message to the other requestor to indicate that the corresponding requestor is to abort its transaction. Other embodiments are described and claimed. | 08-06-2009 |
20090198695 | Method and Apparatus for Supporting Distributed Computing Within a Multiprocessor System - A locking mechanism for supporting distributed computing within a multiprocessor system is disclosed. A lock control section and a stage control section are assigned to a data block within a system memory. In response to a request for accessing the data block by a processing unit, a determination is made by a memory controller whether or not the lock control section of the data block has been set. If the lock control section of the data block has been set, the access request is denied. Otherwise, if the lock control section of the data block has not been set, another determination is made whether or not a current processing stage of the requesting processing unit matches a processing stage indicated by the stage control section. If the current processing stage of the requesting processing unit does not match the processing stage indicated by the stage control section, the access request is denied; otherwise, the access request is allowed. | 08-06-2009 |
20090210420 | Methods, systems and computer applications for real time data processing - Methods, systems and software applications are provided for real time data processing. In one implementation, a method is provided for locking data objects in a computer system. The method may comprise requesting, with a first processing module, a lock service module to lock one or more (n) data objects for access for further data processing modules by creating one or more lock objects for the one or more data objects. The method may also include performing the following steps with the lock service module: receiving names of one or more (m) key fields of the one or more data objects to be locked, receiving n values for each of the m key fields of n data objects to locked, receiving a maximum number (k) of locks to lock the n data objects, and checking whether n<=k and, in case yes, creating one or more lock-objects comprising the m names and n values for the m key fields and, in case no, querying the n values of the m key fields and determining numbers (y1 to ym) of different values (Val_1.1 to Val_m.ym) of the key fields 1 to m. Further, the method may include determining consecutively from a first to i-th field where i<=m until y1* . . . *yi>=k and, in case the condition is satisfied, creating one or more lock objects comprising the names of the key fields 1 to m and values Val_1.1 to Val_(i−1).y(i−1) for the key fields 1 to i−1 and comprising wildcards for the remaining key fields. | 08-20-2009 |
20090234856 | AGGREGATED OPPORTUNISTIC LOCK AND AGGREGATED IMPLICIT LOCK MANAGEMENT FOR LOCKING AGGREGATED FILES IN A SWITCHED FILE SYSTEM - A switched file system, also termed a file switch, is logically positioned between client computers and file servers in a computer network. The file switch distributes user files among multiple file servers using aggregated file, transaction and directory mechanisms. The file switch supports caching of a particular aggregated data file either locally in a client computer or in the file switch in accordance with the exclusivity level of an opportunistic lock granted to the entity that requested caching. The opportunistic lock can be obtained either on the individual data files stored in the file servers or on the metadata files that contain the location of each individual data files in the file servers. The opportunistic lock can be broken if another client tries to access the aggregated data file. Opportunistic locks allows client-side caching while preserving data integrity and consistency, hence the performance of the switched file system is increased. | 09-17-2009 |
20090248691 | INTERACTING METHODS OF DATA SUMMARIZATION - Summarization methods can interact on a common data source using identifiers that correspond to events or other actions. These identifiers can be updated, whenever appropriate, once the corresponding data has been summarized, in order to provide for multiple extraction methods to operate only on the data of interest, and obtain a lock only on the data within the scope of extraction. High water marks, such as identifiers in the sequent, can be used to further designate which data has previously been extracted. Similarly, summarization methods can interact by utilizing corresponding persistent tables in the flows for the methods, but utilizing separate intermediate tables to allow for data transformations and application of various business rules and tuning techniques. The ability to switch between different methods can accommodate business, performance, or other such needs, and can provide for the dynamic extraction and summarization of different volumes of data. | 10-01-2009 |
20090254555 | Modeling and Simulating Software Contention - Aspects of the subject matter described herein relate to modeling and simulating software contention. In aspects, a model declares properties of a scarce software object and models software components that need the scarce software object to execute. A simulator uses the model to set up data structures that track locking activity related to the software object. The simulator simulates the interaction between software components and hardware including seizing and releasing locks on the software object. The simulator may use a function or other similar mechanism to distribute seize and release operations with respect to a lock across multiple instances of the software object. The simulator may use data generated by a simulation to provide an indication of lock objects and hardware utilization, transaction latencies, and other statistics. | 10-08-2009 |
20090254556 | OPTIMISTIC LOCKING IN ONLINE AND OFFLINE ENVIRONMENTS - Systems and methods to implement optimistic locking in online and offline environments are provided. A particular method includes receiving from an application an application data request related to retrieving a data item from a data store. The method also includes sending an optimistic locking information request to the data store to retrieve optimistic locking information, such as an identifier, associated with the data item. Additionally, the method includes receiving a data item update statement from the application while a connection between the application and a database server coupled to the data store persists or after a connection between the application and the database server has terminated and reconnected. The data item update statement relates to storing an updated version of the data item at the data store. Further, the method includes synchronizing the data item with the updated version of the data item based on the optimistic locking information. | 10-08-2009 |
20090265352 | METHODS FOR ENSURING FAIR ACCESS TO INFORMATION - Locks placed on corresponding objects held in a plurality of databases located at different nodes in a network during replication are released in accordance with fairness criteria. Propagation delays are determined between a transaction initiating node and one or more other nodes in the network. An object is locked during a transaction being executed at the transaction initiating node. Corresponding objects are locked at one or more other nodes in the network that are manipulated as a result of the replication Upon determining that the object locks should be released, the propagation delays are used to determine when to release the object locks so that all of the object locks at the one or more other nodes are released in accordance with the fairness criteria. | 10-22-2009 |
20090271408 | HIERARCHICAL LOCKING IN B-TREE INDEXES - Portions of a B-tree index in a database are locked for concurrency control. In one example, hierarchical lock modes are provided that permit locking a key, a gap between the key and the next key, and a combination of the key and the gap. In another example, key range locking may be applied to the B-tree index using locks on separator keys of index nodes. In another example, key range locking may be applied to the B-tree index using locks on key prefixes. | 10-29-2009 |
20090276430 | Record-level locking and page-level recovery in a database management system - Disclosure of approaches for processing database transactions against a database. In one approach, a first transaction is received that specifies an operation for changing state of a first record stored in a first database page. In processing the operation, the state of the record is changed, and information is stored in a companion page. The information includes a transaction identifier, data describing the specified operation, a page identifier of the first page, a before look and an after look of the first record for an update operation, and an after look of the first record for an insert operation. In response to a commit of the first transaction, a process determines whether a second transaction, that specifies a change in state for a second stored in the first page, is in-process. In response to determining that the second transaction is in process, the companion page is stored in an audit trail. In response to determining that no such second transaction is in process, a transaction identifier of the first transaction and associated data of the first page are stored in the audit trail. | 11-05-2009 |
20090276431 | JAVA VIRTUAL MACHINE HAVING INTEGRATED TRANSACTION MANAGEMENT SYSTEM - A computing system includes at least one computing device is configured to execute computer program instructions to accomplish a fully transactional application, including managed objects. The managed objects are persisted in a shared memory of the computing system, such that a scope of the objects is global to the transactional application. Operations on the managed objects are restricted to being carried out with respect to a transaction being processed by the fully transactional application. For example, the managed objects may be JAVA objects configured to be distributed such that the managed JAVA objects are accessible from at least one JAVA Virtual Machine (JVM). | 11-05-2009 |
20090282041 | Caching Infrastructure - Example systems and methods are directed at maintaining and retrieving presence metadata. One example method includes receiving a request from a first client to edit a document file, and sending short-term check out metadata to the first client to begin an editing session. The method also includes writing the transition ID to a transition table stored in a cache, wherein the presence of another transition ID in the cache indicates that a document has switched from a single-client mode to a multi-client mode. An example system includes a processing unit operative to receive a document, the document including short-term check out metadata indicating an editing session has begun, ping a cache to determine if another transition ID is stored in the cache, and send a transition ID to a transition table stored in a cache to switch from a single-client mode to a multi-client mode. | 11-12-2009 |
20090282042 | METHOD AND SYSTEM FOR MANAGING THE DEVELOPMENT OF DATA INTEGRATION PROJECTS TO FACILITATE PROJECT DEVELOPMENT AND ANALYSIS THEREOF - Methods and systems for managing the development of data integration projects to facilitate project development and analysis thereof. Methods operate to manage the development, controlled, release, and analysis of a data integration project by receiving a project, associating the project with two superstates, and storing the project in both a source control system and a relational database according to the values of the two superstates. | 11-12-2009 |
20090282043 | System And Method For Concurrency Control Of Logically Grouped Shared Objects In A Multi-User Environment - A system and method for controlling access to an object, logically grouped shared objects or an object associated with one or more logical groups in a multi-user environment having different user privileges is disclosed. In one embodiment, a method for locking based on user and user privileges includes receiving a request from a user for access to one of an object or logically grouped shared objects or an object associated with one or more logical groups, determining whether the request from the user is for the object, if so, determining whether the object is locked by another user, if so, breaking the lock associated with the user holding the lock on the object and allowing access to acquire a write lock associated with the user and granting access to the object, and ending the request session. | 11-12-2009 |
20090287703 | Transaction processing system of database using multi-operation processing providing concurrency control of transactions - Instead of executing a plurality of submitted transactions separately, each data item to be processed by the plurality of submitted transactions is retrieved only once, update operations of the plurality of transactions are executed consecutively on the retrieved data item in main memory, and only the last updated result is written in a database once. | 11-19-2009 |
20090292705 | EFFICIENT SUPPORT OF CONSISTENT CYCLIC SEARCH WITH READ-COPY UPDATE AND PARALLEL UPDATES - A method, system and computer program product for supporting concurrent updates to a shared data element group while preserving group integrity on behalf of one or more readers that are concurrently referencing group data elements without using locks or atomic instructions. Two or more updaters may be invoked to generate new group data elements. Each new data element created by the same updater is assigned a new generation number that is different than a global generation number associated with the data element group and which allows a reader of the data element group to determine whether the new data element is a correct version for the reader. The new generation numbers are different for each updater and assigned according to an order in which the updaters respectively begin update operations. The global generation number is updated so that when all of the updaters have completed data element update processing, the global generation number will correspond to the new generation number that is associated with the last of the updaters to begin update operations. | 11-26-2009 |
20090292706 | APPARATUS AND METHOD FOR DATA MANAGEMENT - A data management method includes a reference activation step, after generating a first time-series data for causing chronological relationship to be identifiable in a memory device at activation of a reference operation to a first record in a database, of referring to the first record; an update step, in response to an update request for the first record, of generating a second record corresponding to the first record in the database and updating the second record; a commit step of generating a second time-series data in the memory device at a commit operation for the updating; a reference termination step of deleting the first time-series data at completion of the reference operation; and a deletion step, if the first time-series data generated earlier than the second time-series data is not present as a result of the commit step or the reference termination step, of deleting the first record. | 11-26-2009 |
20090300017 | Transaction Parallel Control Method, and Database Managemet System - In a transaction parallel control method of a DBMS, if a priority of a transaction process accepted from an application is higher than a transaction process of an application being executed or suspended, a conflict is judged between database resources used by the both processes and a transaction process to be suspended or terminated is determined based on types and values of the database resources acquired by the respective processes. After the determined transaction process is suspended or terminated, the transaction process of the application is executed by acquiring a value corresponding to the type of the database resource included in the database resource acquisition schedule information accepted from the application and, after the completion, the suspended transaction is restarted. | 12-03-2009 |
20090300018 | DATA PROCESSING SYSTEM AND METHOD OF HANDLING REQUESTS - Methods, apparatus and computer programs are provided for managing service requests. The invention mitigates problems within a data processing environment that includes a data store running on a highly available data processing system. A plurality of distributed service requestors input service requests, and the service requests are replicated to at least two of a plurality of request processing components that are located within a communication path between the requestors and the data store. The method includes: preventing any request processing component that has not successfully claimed the service request from processing the service request; a first request processing component claiming responsibility for the service request; and the first request processing component processing its replica of the claimed service request, including accessing data within the data store. The method also includes preventing any of the plurality of request processing components from entering a duplicate claim to responsibility for the service request. In one embodiment, the request processing components comprise business logic for processing a received request, to determine what data access operations are required within the data store, and request dispatcher functions for handling asynchronous delivery of a replica of the request from the service requestor to the data store. | 12-03-2009 |
20090313252 | DATABASE ARCHITECTURE FOR SUPPORTING GROUP COMMUNICATIONS AMONG WIRELESS COMMUNICATION DEVICES - A system and method for continually updating a large and substantially continually changing dataset that is accessed by multiple application threads, such as a group identity database of members in communication groups of wireless communication devices. A first server holds the group identity database and, as application threads on the first server access the database to set up group communications, a second server sends new group identity data to update the database, with the new data arriving as discrete, ordered blocks. A first server-resident data-index table is updated with the ordering information of the new data blocks, and a first server-resident checkpointing thread places the ordering information of the new data blocks into a checkpoint cache and checkpoints the ordering information as the new data blocks are updated into the group identity database and verifies the ordering (or version) of the data as against the data-index table. | 12-17-2009 |
20090319525 | LOST WRITE PROTECTION VIA STREAM-BASED REPLICATION - Architecture for detecting lost writes using timestamps. During a replication process, lost writes in data replicated from a stream can be detected by noting discrepancies between the timestamps of data in the replica and timestamps associated with the corresponding data from the source in original data store. A lost write either in the original data store or in the replica data store can be inferred by comparing these timestamps with the timestamps in a number of other replica data stores. Additionally, check entries can be added to the replicas by the original data store to allow expanded comparison between recently modified data and the source data in the original data store. The check entries can be added to the replication journal after a time delay, thereby increasing effectiveness of the check by decreasing the likelihood that caching in the hardware will defeat the test. | 12-24-2009 |
20090327290 | SELECTIVE EXPOSURE TO A DATA CONSUMER - A method for consuming data includes determining a scope of summarization for a data set in response to receiving a request from a summarization program, obtaining a lock on the data within the scope of summarization and consuming the data from the summarization program within the scope of data summarization. The summarization program includes methods configured to obtain concurrent locks on different portions of the data set. The consumption of the data may be governed by specific rules. | 12-31-2009 |
20090327291 | PRIMITIVES FOR SOFTWARE TRANSACTIONAL MEMORY - Software transactional memory (STM) primitives are provided that allow the results of prior open calls to be used by subsequent open calls either as-is or through another STM primitive that consumes the results of the previous invocation. The STM primitives are configured to ensure that the address of a shadow copy representing a memory location will not changed across a wide range of operations and thereby enable re-use of the shadow copy. | 12-31-2009 |
20090327292 | ENSURING CONSISTENCY AMONG SHARED COPIES OF A DATA ELEMENT - Disclosed is a “light weight” protocol used to coordinate shared copies of a data element. A central repository holds a master copy of the data element. Applications “subscribe” to the data element (or to an aspect of it) by sending a message to the central repository. Whenever the data element (or aspect) is changed, applications that have subscribed to the data element (or aspect) are notified of the change. When an application wishes to change the value of a subscribed aspect, it sends an update request to the central repository. The central repository changes the master copy of the data aspect to the requested value and then informs all subscribed applications of the new data value. If two applications both wish to change the value of the same data aspect, they send their update requests, and the central repository processes them in the order in which they are received. | 12-31-2009 |
20100005097 | CAPTURING AND RESTORING DATABASE SESSION STATE - Techniques are described herein for capturing and restoring database session state. Production database server components save the session state of each of a plurality of database sessions. The components store workload units that are processed in these sessions. The components store updated session states in response to certain events. Thus, the components may capture multiple session states, pertaining to various different points in time, for each session. The captured session states and the captured workload are moved to a test database server. A user selects, from among the time points represented by the session states, a point in time at which the user would like workload replay to begin. Sessions are re-created on the test database server. Session states of these sessions are set to reflect the session states as they existed at the user-selected time point. Workload units are replayed in the sessions relative to the test database server. | 01-07-2010 |
20100017409 | Hybrid Locking Using Network and On-Disk Based Schemes - A method of acquiring a lock by a node, on a shared resource in a system of a plurality of interconnected nodes, is disclosed. Each node that competes for a lock on the shared resource maintains a list of locks currently owned by the node. A lock metadata is maintained on a shared storage that is accessible to all nodes that may compete for locks on shared resources. A heartbeat region is maintained on a shared resource corresponding to each node so nodes can register their liveness. A lock state is maintained in the lock metadata in the shared storage. A lock state may indicate lock held exclusively, lock free or lock in managed mode. If the lock is held in the managed mode, the ownership of the lock can be transferred to another node without a use of a mutual exclusion primitive such as the SCSI reservation. | 01-21-2010 |
20100023519 | Feature Based Data Management - Methods, systems, and apparatus, including computer program products, for data structure locking. In one aspect, a proper subset of variables of a set of variables in a data structure are received. An access privilege to modify variables in the data structure to administrator accounts is assigned. A first administrator access request to modify a variable in the proper subset of variables is received, and the access privilege to modify the variable in the proper subset of variables for the first administrator account. A second administrator access request to modify the variable in the proper subset of variables is received, and an access timer that expires after a time period is initiated; the access privilege is disabled for the first administrator account in response to expiration of the access timer; and the access privilege for the second administrator account is enabled in response to expiration of the access timer. | 01-28-2010 |
20100023520 | ENCAPSULATED FILE MANAGEMENT SYSTEMS - Methods, systems, and apparatus, including computer program products, for processing element access requests in a computing environment having a plurality of applications, by managing versions of elements of a first set of applications as belonging to respective application execution groups of a first group type, each application execution group of the first group type having a unique group identifier; identifying a source of a first element access request as being associated with the first set of applications, the first element access request including a first element identifier; based on the identified source of the first element access request, selecting a version of an element stored in association with the first element identifier from amongst the managed versions of the elements of the first set of applications; and processing the first element access request using data representative of the selected version of the element. | 01-28-2010 |
20100023521 | SYSTEM AND METHOD FOR MANAGING LOCKS ACROSS DISTRIBUTED COMPUTING NODES - A method and system for managing locks for one or more resources in a distributed system including multiple distributed computing nodes, is provided. One implementation involves maintaining a database as a shared storage accessible by plural participating nodes for storing shared lock information, each participating node locally managing a local list of locks, the participating nodes cooperating in providing decentralized lock management across the nodes using the local and shared lock information, to achieve granting and releasing of locks for synchronizing access to one or more resources. | 01-28-2010 |
20100036843 | GLOBAL CHECKPOINT SCN - Described herein are techniques for generating a global checkpoint system change number and computing a snapshot query using the global checkpoint system change number without a need to acquire global locks. In many cases, the need to acquire global locks is eliminated, thereby saving the overhead attendant to processing global locks. | 02-11-2010 |
20100036844 | SYSTEM AND METHOD OF USING CONFLICTS TO MAXIMIZE CONCURRENCY IN A DATABASE - A first method includes requesting a modification of a data object within the data store using a first application process, establishing a read lock on the data object, initializing an object monitor adapted to detects changes to the data object and releasing the read lock, allowing other concurrent processes to write to the data object, wherein the object monitor detects if any of the concurrent processes overwrite the data object. A second method includes requesting a modification of a data object within the data store using a first application process, establishing a read lock on the data store, initializing a datastore monitor adapted to detect changes to the data store, reading all data objects in the data store and releasing the read lock on the data store, allowing other concurrent processes to write to the data store wherein the datastore monitor detects if any of the concurrent processes overwrite one or more data objects in the data store. | 02-11-2010 |
20100042626 | Transactional File System - A transactional file system wherein multiple file system operations may be performed as a transaction. An application specifies that file system-related operations are to be handled as a transaction, and the application is given a file handle associated with a transaction context. For file system requests associated with a transaction context, a file system component manages operations consistent with transactional behavior. Transactions over a network are facilitated. Remote files may be accessed within a transaction via a redirector protocol. A redirector on a client computer system communicates with an agent on a server computer system to relay and maintain transactional information on both systems. | 02-18-2010 |
20100049714 | FAST SEARCH REPLICATION SYNCHRONIZATION PROCESSES - A method and medium for performing a replication process are provided. The method includes receiving a request to perform an initial load of a first persistence of at least one business object node to replicate the at least one business object node to a second persistence of the business object node; providing a queue to store updates of the at least one business object node; setting a lock for the at least one business object node, the lock indicating a replicating process is performing the initial load of the at least one business object node; determining whether the lock is set for the at least one business object node; and storing, in the queue, the updates of the at least one business object node that occur in parallel with the replicating process in an instance it is determined the lock is set for the at least one business object node. | 02-25-2010 |
20100049715 | CONTROLLED PARALLEL PROPAGATION OF VIEW TABLE UPDATES IN DISTRIBUTED DATABASE SYSTEMS - Aspects include mechanisms for design and analysis of flows of information in a database system from updates to base table records, through one or more log segments, to a plurality of view managers that respectively execute operations to update view table records. Mechanisms allow any base table record to be used by any view manager, so long as the view managers are using that base table record to update different view table records. Mechanisms also allow any number of view table records to be updated by any number of view managers, based on respective base table records. Mechanisms prevent the same view record from being used as a basis for updating the same base table record by more than one view manager, thereby preventing a conflict where updated information from one base table record is used more than once for updating a single view table record. | 02-25-2010 |
20100057740 | ACCELERATING A QUIESCENCE PROCESS OF TRANSACTIONAL MEMORY - A method to perform validation of a read set of a transaction is presented. In one embodiment, the method compares a read signature of a transaction to a plurality of write signatures associated with a plurality of transactions. The method determines based on the result of comparison, whether to update a local value of the transaction to a commit value of another transaction from the plurality of the transactions. | 03-04-2010 |
20100057741 | SOFTWARE RESOURCE ACCESS UTILIZING MULTIPLE LOCK TABLES - A computing system includes a plurality of coupled computing systems, a centralized server and a data set. The system also includes a data sharing controller which includes a primary lock structure that is coupled to the data set when an address space for the data set is allocated and a plurality of secondary lock tables. Each secondary lock table is assigned to a different portion of the data set. | 03-04-2010 |