摘要:
A system and method handle resource transaction requests. The system marks a waiting transaction request, having an access mode which is incompatible with the access mode of the executing transaction, with an ignore bit, so that a transaction request with an access mode compatible with the access mode of the executing transaction may receive a lock in order to access the resource. The transaction request is then marked with a bypass indicator such that when the executing transactions are finished accessing the resource, the waiting transaction request may be notified that it may have access to the resource. The system includes the ignore bit so that each transaction request that arrives after the ignore bit has been set, does not suffer from a long waiting time before being provided access to the resource.
摘要:
A database table reorganization is defined to permit online access of the table during the reorganization. Records are reorganized in the database table by vacating records from a defined number of pages and then filling the pages with records in accordance with a desired ordering for the records. Temporary pointers to the new locations of moved records are used to prevent table scanner access to the database table from missing or duplicating records while scanning the database table during reorganization. Removal of the temporary pointers is synchronized with the completion of scanning of all table scanners that are commenced during a time when records are being moved as part of a vacating or filling step.
摘要:
Embodiments of the invention provide a method for regaining memory consistency after a trap via transactional memory. Transactional memory and a transactional memory log are used to undo changes made to memory from a transaction start point up to the point of a trap event. After the trap event is processed, and the changes are rolled back, the program can resume execution at the beginning of the transaction.
摘要:
distributed database management system implemented on a cluster of computers. The cluster including disks organized as data nodes. The data nodes being locally connected to one or more computers in the cluster. The distributed database management system includes a distributed database manager layer having a lock manager, a resource manager, and an architecture manager. The lock manager serializes access to the data nodes in the cluster. The resource manager maintains a data representation of the resources of each computer in the cluster and makes the data available to other computers in the cluster to facilitate access to the resources by the other computers. The architecture manager defines logical ownership relationships between data nodes and computers in the cluster to permit the architecture of the database to be dynamically reconfigured to provide improved performance.
摘要:
An information retrieval system and method are provided for minimizing the number of blocks searched in a cell before recording a new record in the table and determining which block can be assigned if a table has space available to store a new record in the case an additional block should be associated with a cell. Dimensions for a table are identified, and at least one block in the table is associated with a dimension value for each dimension, where each block comprises contiguous storage pages. The block can be further associated with a cell; this associated cell has a unique combination of dimension values comprising an dimension value for each of the dimensions. A unique associated bit list for each dimension value for each dimension has a unique corresponding list entry for each block associated with that dimension value, and a unique associated bit list for each cell has a unique corresponding list entry for each block associated with that cell.
摘要:
A system, method and computer readable medium containing programming structions for an improved latch mechanism for use in a programming environment running concurrent tasks is disclosed. According to one aspect of the present invention, a latch is provided to a first task which is requesting access to a resource. After such access, the first task holds the latch, which is also released from the first task. The first task holding the latch marks the latch stealable, and if the latch is not marked stolen by another task, the first task can mark the latch unstealable. In another embodiment of the present invention, if the first task is provided a latch marked stealable, the resource associated with the stealable latch will be placed in a consistent state before the first task accesses the resource.
摘要:
A method for implementing distributed database management system operations on a computer cluster. The method includes defining ownership relationships between a plurality of computers in the computer cluster and a plurality of data nodes in the computer cluster, wherein a distributed database management system operation can be directly carried out by a first computer only on those data nodes owned by the first computer. The method further includes monitoring database usage characteristics. The method further includes carrying out a re-architecture step in response to the database usage characteristics by redefining ownership relationships to improve the efficiency of the distributed database management system operations.
摘要:
A method for implementing a set of database management components in a distributed database management system, the distributed database management system being implemented on a computer cluster. The method includes managing resources associated with an associated computer, the associated computer being one of a plurality of computers in the computer cluster. The method also includes managing locks on data stored on a plurality of associated data nodes coupled to the associated computer, wherein the associated data nodes are data nodes of a plurality of data nodes in the computer cluster. The method also includes specifying logical connections for the plurality of associated data nodes.
摘要:
A hash table for a collection of data items includes a set of hash buckets, each hash bucket being associated with a subset of the collection of data items, and a set of properties entries in each of the hash buckets. Each properties entry includes a pointer to an associated data item in the subset associated with the bucket and a set of representative values identifying the associated data item. A hash table can also include bucket groups defining a second level hash table to permit resizing of the hash table.
摘要:
A method to process a query for information stored in a relational database using indexes which have different granularity and/or composition is provided. The method involves selecting indexes of various granularity and/or composition based on the query, ordering and combining them (if necessary) in order to subset the data from a relational table to be optimally scanned. The ability to combine indexes is very useful to answer ad hoc queries for which no specific index exists. This requirement may be met by using index ANDing and index ORing techniques.