Abstract: A method is used in managing concurrent I/Os in file systems. A first and second I/O requests are received. The first I/O request is directed to a first portion of a file and the second I/O request is directed to a second portion of the file. A first range lock for the first portion is obtained and a second range lock for the second portion is obtained. The first and second I/O requests are performed concurrently. The second I/O request starts performing I/O on the second portion of the file before the first I/O request finish performing I/O on the first portion of the file.

Abstract: The present invention is an improved system and method for analyzing multiple real estate properties. The system includes a pool of properties that are searched based on user-defined search criteria. The system identifies comparison properties from the search pool. The comparison properties include attributes that match or are a near match to the search criteria. The system compares each of the comparison properties to at least one average value and demonstrably depicts the comparison to the user.

Abstract: Mechanisms for selecting questions for a cluster of questions to be used with a question and answer (QA) system are provided. An input question is received and analyzed to identify at least one feature of the input question. Clustering of the input question with one or more other questions in a cluster of questions based on the at least one feature of the input question is performed. Based on results of the clustering, a determination is made as to whether to include or reject the input question as part of the cluster of questions. In response to determining to include the input question as part of the cluster of questions, the cluster of questions is updated to include the input question. The updated cluster of questions is stored in a storage device associated with a data processing system.

Abstract: A user interface for presenting and searching relationships between document objects located on a network is described. The user interface may include a first portion of a screen display for displaying one or more link relationship attributes and a second portion of the screen display for displaying one or more entries from a group consisting of: (a) link references that represent the document objects, (b) link relationship attributes describing the link relationships, (c) link reference attributes describing the link references, and (d) document objects. The displayed entries in the second portion of the user interface are related to the displayed one or more link relationship attributes in the first portion.

Abstract: A locking system may place a persistent object on each of the devices in a computer cluster. The objects may indicate that an update is being performed on the devices so that other systems may not also update the devices. When an update has completed, the objects may be removed. The objects may include an identifier for the system owning the objects, as well as other information regarding the update. In some cases, the objects may include executable code and perform some of the update functions on the various devices.

Abstract: A method, system, and apparatus for storing data in a cloud environment that enables a multi-user interface, automatic data backup, and has a schema-less data storage. A data storage database may be provided in the cloud to store one or more data objects. A data management module may be configured to assign each data object a unique ID, wherein each unique ID comprises a timestamp with a granularity between about 0.1 millionths of second and 50 millionths of a second with each ID guaranteed to be unique without regard to the number of servers assigning IDs. A data backup module may be configured to create a new data object with a unique ID in response to a request to modify an original data object, wherein the original data object remains stored with its unique ID.

Abstract: In some implementations, a B+tree (b plus tree) can provide concurrent access to data while modifying nodes of the B+tree. In some implementations, a top-down B+tree can be provided where nodes of the B+tree can be proactively merged, rebalanced and split to prevent recursive operations moving up the B+tree. In some implementations, node (or page) record data can be merged to consolidate record entries within nodes of the B+tree while only locking 1-3 nodes of the tree at the same time. In some implementations, record data can be merged across multiple nodes of the B+tree. In some implementations, ranges of data can be removed from the tree while only locking 1-3 nodes of the tree at the same time. In some implementations, range of data can be replaced with new data while only locking 1-3 nodes of the tree at the same time.

Abstract: Methods for processing streaming data records are provided that include facilities for defining and naming multiple input and output data streams using relational processing definitions and abstractions similar to those found in relational database management systems (RDBMS) and embodied as a set of communicating stream processing nodes. The result is a Distributed Data Stream Management System (DDSMS) which is also a kind of Relational Data Stream Management System (RDSMS). The former comprises a set of Relational Data Stream Management System (RDSMS) nodes, whereas the latter might contain only a single RDSMS node.

Abstract: In one embodiment, a method includes receiving a request to perform an update on a base data set in a record-oriented file system, locate all alternate index (AIX) records for the base data set, each AIX record including an alternate key field along with one or more relative byte address (RBA) values when the base data set is an entry sequenced data set (ESDS) or one or more primary keys when the base data set is a key sequenced data set (KSDS). Each RBA value/primary key corresponds to one record in the base data set. Individual record-level locks are acquired on each affected AIX record that includes alternate key field values and/or RBA values that are modified by the update. The affected AIX records may be updated after acquiring the individual record-level locks on each of the affected AIX records. Moreover, the affected AIX records may be updated in parallel with updating of unaffected AIX records, thereby greatly increasing performance.

Abstract: Methods for searching relationships between and among documents are detailed. One method includes steps for selecting one or more initial search items from a group consisting of: (a) document objects, (b) link references to document objects, (c) link reference attributes, and (d) link relationship attributes. The method also includes steps for identifying one or more link relationships using the selected initial search items, and for presenting one or more link relationships attributes describing the identified link relationships. A user interface for presenting and searching relationships between document objects located on a network is also detailed.

Abstract: Establishment of an exclusive lock on each of an outer database ownership table and an inner database ownership table is attempted. In response to establishing the exclusive lock on each of the outer database ownership table and the inner database ownership table, a switch is made to a pair of overlapping shared locks on each of the outer database ownership table and the inner database ownership table. Release and re-acquisition of each of the pair of overlapping shared locks on the outer database ownership table and the inner database ownership table is alternated.

Abstract: Methods, systems and computer program products for traversing a level in a search path in a tree data structure by recording a version number of a node on the search path, finding a child pointer in the node on the search path, recording a version number of a child node corresponding to the child pointer, reading a version number of the node on the search path, comparing the recorded version number of the node to the read version number of the node, reading at least one child pointer in the node and comparing the read child pointer to an address of the child node.

Abstract: A method and system that enables operation of a file system-based queue that supports the efficient and fair distribution of messages among a plurality of processors.

Abstract: Provided are a computer program product, system, and method for allowing writes to complete without obtaining a write lock to a file. A lock is provided to a first request, comprising a read or write request, to access the file. A second write request is received while the first request maintains the lock. A temporary file associated with the file for the second write request is created. The second write request is controlled to write to the temporary file while the lock is held by the first request. In response to completing the first request, the lock is granted to the second write request to write the data in the temporary file to the file.

Abstract: A system including multiple application servers for accessing shared data and a centralized control unit for centrally controlling a lock applied to the shared data by each of the application servers. Each application server includes a distributed control unit for controlling a lock applied to the shared data by the application server and a selection unit for selecting any one of distributed mode in which a lock is acquired from the distributed control unit or a centralized mode in which a lock is acquired from the centralized control unit.

Abstract: When a WORM cartridge is formatted for Tape File System (LTFS) in advance, such as prior to shipment, Linear Tape File System Library Edition (LTFS LE) is expanded by software to reduce consumption of the index partition and to support elimination of the appending of unnecessary data. More specifically, instead of recording metadata in the index partition during normal unmounting, the metadata is recorded in separate local storage such as on hard disk drive (HDD), and the index partition is updated only when the cartridge is ejected from the library. In this way, the present invention is able to significantly reduce the frequency of index partition updates. Because an update occurs only when the user intentionally ejects a cartridge, overflow of the index partition before overflow of the data partition can be prevented.

Abstract: A network-based method for managing locks in a shared file system (SFS) for a group of hosts that does not require any configuration to identify a server for managing locks for the SFS. Each host in the group carries out the steps of checking a predetermined storage location to determine whether there is a host ID written in the predetermined location. If there is no host ID written in the predetermined location, the first host to notice this condition writes its host ID in the predetermined location to identify itself as the server for managing locks. If there is a host ID written in the predetermined location, the host ID of the server for managing locks is maintained in local memory. When the host needs to perform IO operations on a file of the SFS, it communicates with the server for managing locks over the network using the host ID of the server for managing locks to obtain a lock to the file.

Abstract: Managing a multi-version data record database is provided. A mapping is maintained between a logical record identifier and committed and uncommitted physical record identifiers corresponding to data records using an indirection mapping table. Entries are updated within an index to point to the logical record identifier instead of the committed and uncommitted physical record identifiers. The committed physical record identifier corresponding to a data record is read from the indirection mapping table to access a committed version of the data record while a writer is modifying the data record to prevent the writer from blocking a reader. An uncommitted physical record identifier corresponding to the data record is written in the indirection mapping table to insert a new uncommitted version of the data record within a data table while the reader is reading the committed version of the particular data record to prevent the reader from blocking the writer.

Abstract: Provided are techniques for using a series of compare and swap operations to assign a Relative Byte Address (RBA) and a Logical Record Sequence Number (LRSN) to a log record. One or more log buffers for storing the log record are identified, and the log record is moved to the one or more log buffers.

Abstract: A temporary state service protocol is utilized by clients to temporarily store and access data within rows of a database between different requests made by end users. Each client creates and manages one or more items for storing data in rows of the database independently from other clients. An Application Programming Interface (API) is used to create and interact with the data that is temporarily stored in items within rows of the database. Different clients may share data within a single item and the data may persist beyond a session ending. Different rows of the database may be related such that a procedure affecting one of the rows affects its related rows.

Abstract: Provided are techniques for using a series of compare and swap operations to assign a Relative Byte Address (RBA) and a Logical Record Sequence Number (LRSN) to a log record. One or more log buffers for storing the log record are identified, and the log record is moved to the one or more log buffers.

Abstract: Aspects of the subject matter described herein relate to database access. In aspects, a request for access to a database is received at a node of a database cluster. Also received at the node is an intent associated with the request. If the intent is to potentially write to the database, a primary instance of the database services the request. If the intent is to read from but not write to the database, an identifier of a secondary instance of the database is sent to the requestor for use in accessing the database.

Abstract: A distributed database server receives an operation request including a flag to cause recursive lock-and-propagate operation, acquires a local lock, tests the operation locally and propagates the recursive request to a peer database server. Specific implementations within a Lightweight Directory Access Protocol (“LDAP”) server are described.

Abstract: Described herein are techniques for time limited lock ownership. In one embodiment, in response to receiving a request for a lock on a shared resource, the lock is granted and a lock lease period associated with the lock is established. Then, in response to determining that the lock lease period has expired, one or more lock lease expiration procedures are performed. In many cases, the time limited lock ownership may prevent system hanging, timely detect system deadlocks, and/or improve overall performance of the database.

Abstract: A method and a system import data into a table. The method includes providing the table with data identities and a primary key assigned to each of the data identities. A temporary copy of the table is provided and contains a data identity to be merged into the table. The table structure of the table and of the temporary copy is determined and the determined table structure is compared to the table structure of the temporary copy to decide which data identities have to be updated and/or imported. In the temporary copy a new column contains a final primary key of the related data identity for its transfer into the table. The data identities in the table that are present in the temporary copy are locked and an update function for the data identities having the same primary key in both the table and the temporary copy are executed.

Abstract: A computing device has multiple user profiles. While a particular user profile is the currently-active user profile of a computing device, the computing device determines whether a binary that is not associated with the particular user profile is already stored at the computing device. In response to determining that the binary is not already stored at the computing device, the computing device downloads the binary from a computing system other than the computing device and associates the binary with the particular user profile. If the binary is already stored at the computing device, the computing device associates the binary with the particular user profile without downloading the binary again.

Abstract: Data is retrieved from a linked-list by locking the linked-list, retrieving data from an element in the linked-list, advancing to a subsequent element in the linked-list while a breakpoint is not encountered and marking the subsequent element as “in-use” when a breakpoint is encountered. A reference to the subsequent element is then created before the linked-list is unlocked.

Abstract: Current file systems may implement opportunistic locks on files that allow clients to locally cache file data, while promoting data consistency when multiple clients read/write the same file. Unfortunately, when a client locally caches directory content of a directory, the file system may lack a mechanism for notifying the client of changes to the directory that would render the cached directory content “stale”. Accordingly, one or more systems and/or techniques for managing a directory oplock are disclosed herein. A directory oplock may be generated based upon an oplock request comprising a first target key and a first parent key. Subsequent access requests for access to the directory or objects therein may be compared with the directory oplock to determine whether to break the directory oplock, and notify the client (e.g., directory oplock is broken if the client submitting the access request is different than the client owning the directory oplock).

Abstract: NUMA-aware reader-writer locks may leverage lock cohorting techniques to band together writer requests from a single NUMA node. The locks may relax the order in which the lock schedules the execution of critical sections of code by reader threads and writer threads, allowing lock ownership to remain resident on a single NUMA node for long periods, while also taking advantage of parallelism between reader threads. Threads may contend on node-level structures to get permission to acquire a globally shared reader-writer lock. Writer threads may follow a lock cohorting strategy of passing ownership of the lock in write mode from one thread to a cohort writer thread without releasing the shared lock, while reader threads from multiple NUMA nodes may simultaneously acquire the shared lock in read mode. The reader-writer lock may follow a writer-preference policy, a reader-preference policy or a hybrid policy.

Abstract: An architecture for a multimedia search system is described. To perform similarity matching of multimedia query frames against reference content, reference database comprising of a cluster index using cluster keys to perform similarity matching and a multimedia index to perform sequence matching is built. Methods to update and maintain the reference database that enables addition and removal of the multimedia contents, including portions of multimedia content, from the reference database in a running system are described. Hierarchical multi-level partitioning methods to organize the reference database are presented. Smart partitioning of the reference multimedia content according to the nature of the multimedia content, and according to the popularity among the social media, that supports scalable fast multimedia identification is also presented.

Abstract: Systems, and products for testing a transactional software application which interacts with a database structure. The software application includes a plurality of application units, which are adapted to be executed at least in part concurrently. Executing the software application includes executing a plurality of transaction operations on the database structure by a plurality of respective invocations of a database management system of the database structure by the respective plurality of application units. The system also includes computer program instructions for determining locks being applied by the database management system on elements of the database structure for each transaction operation executed by each application unit individually. The system also includes computer program instructions for identifying potential lock conditions of the software application in possible successions of application of the locks according to possible interleaving of the application units.

Abstract: Provided are a computer program product, system, and method for allowing writes to complete without obtaining a write lock to a file. A lock is provided to a first request, comprising a read or write request, to access the file. A second write request is received while the first request maintains the lock. A temporary file associated with the file for the second write request is created. The second write request is controlled to write to the temporary file while the lock is held by the first request. In response to completing the first request, the lock is granted to the second write request to write the data in the temporary file to the file.

Abstract: In general, techniques of the present disclosure relate to synchronizing concurrent access to multiple portions of a data structure. In one example, a method includes, sequentially selecting a plurality of requests from a request queue, wherein at least one of the requests specifies a plurality of requested synchronization objects for corresponding candidate portions of a data structure to which to apply an operation associated with a data element. The method also includes querying one or more sets of identifiers to determine whether one or more of the requested synchronizations objects specified by the selected request are acquirable. The method also includes acquiring each of the requested synchronization objects that are acquirable. The method includes, responsive to acquiring all of the one or more requested synchronization objects, selecting a subset of the candidate portions of the data structure and applying the operation only to the selected subset of the candidate portions.

Abstract: Techniques are provided for more efficient multi-row atomic, consistent, isolated and durable (ACID)-compliant transactions with snapshot isolation semantics (or just “multi-row transactions” for short). In some embodiments, the techniques are implemented in a computing system that includes a client application, a lightweight in-memory lease-based lock service, a multi-row transaction orchestrator, and an underlying database system. The transaction orchestrator implements a read protocol and a write protocol that provides support to the client application for carrying out multi-row transactions against the underlying database system irrespective of whether the database system itself supports multi-row transactions. The transaction orchestrator explicitly maintains transaction-level locks obtained from the lease-based lock service as part of the transaction protocol.

Abstract: Image forming apparatuses are connected to a network. Each image forming apparatus communicates with remaining ones of the image forming apparatuses. An image forming section forms an image in accordance with the image information. A memory stores management information, the management information including an item of information about one of remaining ones of the plurality of image forming apparatuses. The one of remaining ones of the plurality of image forming apparatuses holds the image information therein. An information management section performs a synchronization processing in which the management information in the plurality of image forming apparatuses is updated to become identical. An image formation controlling section obtains the image information held in the one of remaining ones of the plurality of image forming apparatuses identified by the item of information, and drive the image forming section to form the image in accordance with the obtained image information.

Abstract: The various disclosed techniques and equipment relate to synchronizing a subscriber's address books located in a portal and in the subscriber's mobile station, determining the subscription status of a directory number of another party with whom the subscriber intends to communicate, and/or for enabling the subscriber to make a referral to another party who might not be a qualified subscriber.

Abstract: A technique for distributed management of attributes includes propagating attributes based upon attribute-granularity permissions. An example of a system according to the technique may include a server, coupled to a first client and a second client, that includes a module that receives attribute data from the first client; a permissions database where first permissions associated with the first client are set at the individual attribute level for the second client; an engine for updating the permissions database and for validating the first permissions for the second client; and an engine for distributing first client updates based on validated permissions to destinations associated with the one or more second destination stores.

Abstract: A method for concurrency control in a docbase management system is provided by an embodiment of the present invention. Document data is stored in a tree structure; the method includes: determining whether an operation instruction on at least one node in the tree structure is compatible with every operation being implemented in the tree structure, when the operation instruction is received; implementing the operation instruction when it is determined that the operation instruction is compatible with the operation being implemented; otherwise, not implementing the operation instruction.

Abstract: A database is maintained that stores data persistently. Tasks are accepted from task sources. At least some of the tasks have competing requirements for use of regions of the database. Each of the regions includes data that is all either locked or not locked for writing at a given time. Each of the regions is associated with an available processor. For each of the tasks, jobs are defined each of which requires write access to regions that are to be accessed by no more than one of the processors. Jobs are distributed for concurrent execution by the associated processors.

Abstract: The present invention involves a Universal Geographic Database (“UGD”). The UGD is an automated, central or distributed, registry of real-world locations and location-related information for businesses and other entities, analogous to the registry of domain names for Internet and web sites. By this central registry, businesses and other entities are facilitated to post their location and location-related information in a single place, for all users who need or want it; and users can refer to this single place, via the Internet, Web, and other telecommunications devices, to obtain accurate, complete and timely location and location-based information about the registered businesses and other entities. Each record of the UGD is keyed by a proprietary location address (PLA) based on the World Geographic Referencing System (WGRS), and optionally may have one or more proprietary location addresses (PLAs), which also may serve as keys.

Abstract: A system and method for efficiently performing simultaneous access of files in a clustered file system. A cluster of nodes is coupled to a data storage medium. A first node executes a first thread with write operations for a given file. A second node executes a second thread with read operations for the given file. The first thread is appending the given file. In response, the first node requests a write lock range between an end-of-file for the given file to a highest possible endpoint. If a prediction determines the second thread may request read locks after the range it is currently reading, then the method enables the locks to be efficiently transferred from the first node to the second node before they are required on the second node, allowing the reading second node to proceed with fewer delays.

Abstract: In a cluster where multiple database nodes are synchronized by a distributed lock manager, a process that includes one or more messages that are sent from one or more nodes to a distributed lock manager, wherein one or more of said messages are asynchronous lock taken messages.

Abstract: Methods and systems are directed to controlling access to data in a production environment. Production data may be stored in a production database and test data may be stored in a test database. A production application may have access only to the data in the production database while a test application may have access to both the production database and the test database. The test application may have read-only access to the production database and read-write access to the test database. Data in the test database may be handled differently than data in the production database. A type of data may be associated with a range of valid values. The values assigned to the elements may differ depending on whether the elements are stored in the production database or the test database.

Abstract: A lock control device receives a lock acquisition request from an application and transmits a lock acquisition request to a DBMS, receives a lock acquisition response from the DBMS, and transmits a lock acquisition response to the application, and each time, acquires statistical time information including the lock request counter, subsequent lock request counter, lock request time, lock acquisition time, initial lock acquisition time, and subsequent lock request time. The statistical processing device calculates the lock request count for each resource, subsequent lock request count for each resource, average lock wait time, and average lock acquisition delay expectation time, based on the statistical time information.

Abstract: A tree-based trylock technique for reducing contention on a root trylock includes attempting to acquire a trylock at each node of a tree-based hierarchical node structure while following a traversal path that begins at a leaf node, passes through one or more of internal nodes, and ends at a root node having the root trylock. The trylock acquisition operation succeeds if each trylock on the traversal path is acquired, and fails if any trylock on the traversal path cannot be acquired. A trylock housekeeping operation releases all non-root trylocks visited by the trylock acquisition operation, such that if the trylock acquisition operation succeeds, only the root trylock will be remain acquired at the end of the operation, and if the trylock acquisition operation fails, none of the trylocks will be remain acquired at the end of the operation.

Abstract: A tree-based trylock technique for reducing contention on a root trylock includes attempting to acquire a trylock at each node of a tree-based hierarchical node structure while following a traversal path that begins at a leaf node, passes through one or more of internal nodes, and ends at a root node having the root trylock. The trylock acquisition operation succeeds if each trylock on the traversal path is acquired, and fails if any trylock on the traversal path cannot be acquired. A trylock housekeeping operation releases all non-root trylocks visited by the trylock acquisition operation, such that if the trylock acquisition operation succeeds, only the root trylock will be remain acquired at the end of the operation, and if the trylock acquisition operation fails, none of the trylocks will be remain acquired at the end of the operation.

Abstract: Limiting the number of concurrent requests in a database system. Arranging requests to be handled by the database system in at least one queue. Defining a maximum value (SS) of concurrent requests corresponding to the at least one queue. Monitoring at least one queue utilization parameter corresponding to the at least one queue and calculating a performance value based on the at least one queue utilization parameter. Adapting the maximum value (SS) of concurrent requests of the at least one queue dynamically based on the performance value (PF) in order to improve system performance. Limiting the number of concurrent requests of the at least one queue dynamically based on the dynamically adapted maximum value (SS).

Abstract: A database system lock operation method is provided that includes: acquiring, by a first processing node, a lock operand of a target lock; using, by the first processing node, the target lock to perform a lock acquiring operation on a target data object; when the lock operand meets a condition for a successful lock acquiring operation, determining, by the first processing node, that the lock acquiring operation is successful, and updating a value of a data bit that is in the lock operand and used to indicate a state of the target lock on the first processing node to a value that is used to indicate that the state of the target lock on the first processing node is lock held. Accordingly, the embodiments of the present invention further disclose a node device. The embodiments of the present invention can improve performance of a database system.

Abstract: A method for controlling the user interfaces within a workflow manager to limit access to configuration and development files in the workflow manager is provided. The method comprises receiving from a user a request to edit a file in the workflow manager, wherein the file is one of a configuration file and a development file. The method also comprises determining whether the user has checked out the file. Additionally, the method comprises providing the user with an editor user interface to edit the file if the file is checked out to the user, wherein access to the files in the workflow manager is available only from within the workflow manager itself, wherein the files are not lockable to inhibit access to the files, wherein the file is available to be checked out to only one user at a time, and wherein the user interfaces in the workflow manager are configurable.

Abstract: A computer-implemented method for host communication in a clustered file system may include 1) identifying a cluster file system site comprising at least one host that performs data operations on a storage unit, 2) identifying a storage management application that manages the storage unit, 3) transmitting, by an initial host, an initial data operation directed to a location of the storage unit, where the data operation comprises a notification signal that commands the notification of the initial host upon a subsequent host attempting to access the location, 4) transmitting, by the subsequent host, a subsequent data operation directed to the location of the storage unit, and 5) notifying the initial host, by the storage management application, that the subsequent host attempted to access the location of the storage unit. Various other methods, systems, and computer-readable media are also disclosed.