Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: In a system for storing and retrieving a plurality of records, the plurality of records associated with a ledger, a client issues read and write requests associated with one of the plurality of records, a plurality of record servers responds to the requests received from the client, and a management server maintains and coordinates, between the client and the record servers, information associated with the ledger, records, and record servers.

Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: Methods and systems are provided that may be utilized for spilling in query processing environments.

Abstract: In a system for storing and retrieving a plurality of records, the plurality of records associated with a ledger, a client issues read and write requests associated with one of the plurality of records, a plurality of record servers responds to the requests received from the client, and a management server maintains and coordinates, between the client and the record servers, information associated with the ledger, records, and record servers.

Abstract: In a distributed system that includes multiple machines, a scheduler attempts to schedule a task on a machine that is not currently overloaded with work. If a task is scheduled on a machine that does not yet have copies of the portions of the data set on which the task needs to operate, then that machine obtains copies of those portions from other machines that already have them. Whenever a “source” machine ships a copy of a portion to another “destination” machine in the distributed system, the destination machine persistently stores that copy on the destination machine's persistent storage mechanism. The copy also remains on the source machine. Thus, portions of the data set are automatically replicated whenever those portions are shipped between machines of the distributed system. Each machine in the distributed system has access to “global” information that indicates which machines have which portions of the data set.

Abstract: Provided is a method for defining security permissions in a computer application in a manner that distributes the assignment of security permissions among multiple levels of the software development and delivery process. A developer defines the permissions for a particular application as metadata and saves the permissions in a permissions metadata file stored in conjunction with the application. A signer inspects the application and permissions file and, if satisfied that the appropriate permission levels in the file have been properly set, validates, or “signs,” the application. Once a signer has validated, or signed, the permissions in the application and the permissions file, the application is deployed, or provided to a user who installs the application on a computing system with the maximum permissions allowed under the permissions file.

Abstract: Disclosed is a decorative light string, being formable to provide varying shapes, to hold position when wrapped around or placed upon structures to be decorated, and to facilitate storage without tangling of one or more light strings.

Abstract: The present invention provides a method and system of eliminating file redundancy for at least one computer file in a computer filesystem and a method and system of establishing match permission for at least one computer file in a computer filesystem. The present invention provides a method and system of eliminating file redundancy for at least one computer file in a computer filesystem. In an exemplary embodiment the method and system eliminates file redundancy for at least one computer file in a computer filesystem via implicit file unification. In an exemplary embodiment the method and system eliminates file redundancy for at least one computer file in a computer filesystem via explicit file unification. In an exemplary embodiment the method and system eliminates file redundancy in a computer filesystem via file identifier file unification.

Abstract: The present invention provides a method and system of performing a current filesystem backup with respect to a previous filesystem backup using directorywise hardlinking for a computer filesystem. In an exemplary embodiment, the method and system include (1) identifying all largest unchanged subtrees in the previous filesystem backup with respect to a current computer filesystem and (2) creating directorywise hardlinks in the current filesystem backup to the all largest unchanged subtrees. In an exemplary embodiment, the creating includes for each of the largest unchanged subtrees, forming a first pointer from the current filesystem backup to the each of the largest unchanged subtrees. In a further embodiment, the creating includes for each of the largest unchanged subtrees, establishing a second pointer from the each of the largest unchanged subtrees to a directory in the current filesystem backup that corresponds to the first pointer.

Abstract: The present invention provides a method and system of mapping at least one web service to at least one OSGi service and exposing at least one local service as at least one web service. In an exemplary embodiment, the method and system of mapping at least one web service to at least one OSGi service include (1) creating a proxy bundle corresponding to the at least one web service, (2) registering a proxy web service corresponding to the proxy bundle in a service registry, (3) searching for the at least one web service in the service registry, (4) returning a reference to the proxy web service from the service registry in response to the searching, and (5) invoking at least one method on the returned reference, thereby invoking the at least one web service.

Abstract: The present invention provides a method and system of accessing at least one target file in a computer system with an operating system with file locking implemented at file-open time. In an exemplary embodiment, the method and system include (1) obtaining a set of handles that corresponds to a set of all files that are open in the computer system, (2) determining within the kernel of the operating system a set of file identifiers that corresponds to the set of handles, (3) identifying from the set of file identifiers a file identifier that corresponds to the target file, (4) sending within the kernel to the file system driver of the operating system a read request packet that corresponds to the identified file identifier, and (5) receiving from the file system driver data that corresponds to the target file.

Abstract: The present invention provides a method and system of accessing at least one target file in a computer system with an operating system with file locking implemented with byte-range locking. In an exemplary embodiment, the method and system include obtaining a set of handles that corresponds to a set of all files that are open in the computer system, determining within the kernel of the operating system a set of file identifiers that corresponds to the set of handles, identifying from the set of file identifiers a file identifier that corresponds to the target file, sending the identified file identifier to the kernel, initializing within the kernel file caching for the identified file identifier, and requesting within the kernel the cache manager of the operating system to obtain by using the identified file identifier a region of the target file from the file system driver of the operating system.