Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Embodiments relate to database systems. An aspect includes deferring row insert operations until occurrence of a triggering event. One method includes receiving a row insert for a tuple into a column group store table, where the tuple includes one or more tuplets and each of the tuplets corresponds to a column group in the column group store table. The method also includes copying at least one of the tuplets into an insert buffer that is specific to one of the column groups in the column group store table. The method also includes deferring the row insert into the column group store table until an occurrence of one or more triggering events. The method also includes flushing the row insert into storage associated with the column group store table, in response to the occurrence of the one or more triggering events.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Embodiments relate to database systems. An aspect includes deferring row insert operations until occurrence of a triggering event. One method includes receiving a row insert for a tuple into a column group store table, where the tuple includes one or more tuplets and each of the tuplets corresponds to a column group in the column group store table. The method also includes copying at least one of the tuplets into an insert buffer that is specific to one of the column groups in the column group store table. The method also includes deferring the row insert into the column group store table until an occurrence of one or more triggering events. The method also includes flushing the row insert into storage associated with the column group store table, in response to the occurrence of the one or more triggering events.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: Provided are techniques for using parallel inserts to insert into a column store. A list of sub-ranges for a columnar table is created. A change statement for one or more rows to be inserted into the columnar table is received. For each of the received change statements, a sub-range from the list of sub-ranges is identified and data is serially inserted into the identified sub-range of the columnar table, while allowing parallel processing of each change statement for different sub-ranges of the columnar table.

Abstract: There is provided, in a computer processing system, an apparatus for managing object data. The apparatus includes a changed objects manager for creating and managing a changed objects list that at least identifies the objects that have changed based on time of change. The changed objects list is associated with a plurality of time buckets. Each of the plurality of time buckets is associated with a respective date and time period and with object change records for objects having a timestamp falling within the respective date and time period. Each of the object change records is associated with a unique object identifier and the timestamp for a corresponding one of the objects. The timestamp specifies a date and a time corresponding to a latest one of a creation time or a most recent update time for the corresponding one of the objects.

Abstract: A technique for implementing policy-aware backup and restore capability in a tiered storage system. If a data set's contents are backed up from the tiered storage system to a backup storage system, metadata for the data set may also be backed up. Prior to the data set being restored from the backup storage system to the tiered storage system, the backed up metadata is restored and processed to determine a tier among the tiered storage pools to which the data set will be restored.

Abstract: A method and system for conducting an integrity check of system and user metadata when the metadata is mounted. A filesystem reviewer is embedded within software of a server node. A mutual exclusion lock is obtained on the selected metadata. An automated verification of the locked metadata is conducted while the filesystem is mounted. In addition, an automated salvage of the locked metadata may be conducted while the filesystem is mounted. The verification and/or salvage of the locked metadata can be applied to system, user, and/or a portion of the user metadata.

Abstract: A process for quiescing a master and a plurality of subordinate computer systems in a cluster. An original or a pending state may be entered that is a quiesce or an online state. The master instructs the subordinates the quiesce or online state be made the pending state. The subordinates prepare to change accordingly, determine whether successful, and vote to commit or abort. Based on whether all voted to commit, the master instructs the subordinates to either commit or abort. If to commit and the pending state is the quiesce state, an operation is performed in the subordinates. If to commit and the pending state is the online state, the subordinates prepare to resume the original state. The subordinates change from the original to the pending state. Otherwise, if to abort, the subordinates prepare to remain in the original state and reset the pending to the original state.

Abstract: File system objects of unknown type are backed up and restored. A list of file system objects is received from a file system. The file system objects are to be backed up. For each file system object that has a file type that is unknown, the following is performed. First, the file system is queried to obtain information regarding the file system object that is sufficient for the file system to later recreate the file system object if necessary. Second, the file system object and the information regarding the file system object are stored. Examples of file system object types of the file system that may be unknown to an application running on a Microsoft Windows® operating system include symbolic links, named pipes, and special device files.

Abstract: A method and system for allocating blocks of disk in persistent storage to requesting threads. A primary data structure is provided for organizing and categorizing blocks of disk space. In addition, a secondary data structure is provided for maintaining a list of all active file system processes and blocks of disk space used by those processes. Blocks of disk space are assigned to pages. At such time as a thread may request allocation of disk space, both data structures are reviewed to determine if the requested disk space is available and to limit access of available disk space to a single page of memory to a single thread at any one time.

Abstract: A method and system for managing availability of a dependent thread to service a nested request is provided. A plurality of reply threads are maintained in a single thread pool. In addition, a counter is provided to track availability of a reply thread from the thread pool. A service thread that requires at least one reply thread to complete execution of a request must check the counter to determine availability of the reply thread prior to execution of the request. The process of determining availability of a reply thread prior to execution of a service thread request avoids initiating execution of a request that cannot be completed in a timely manner, or at all.

Abstract: A method and system for allocating blocks of disk in persistent storage to requesting threads. A primary data structure is provided for organizing and categorizing blocks of disk space. In addition, a secondary data structure is provided for maintaining a list of all active file system processes and blocks of disk space used by those processes. Blocks of disk space are assigned to pages. At such time as a thread may request allocation of disk space, both data structures are reviewed to determine if the requested disk space is available and to limit access of available disk space to a single page of memory to a single thread at any one time.

Abstract: A method and system for allocating blocks of disk in persistent storage to requesting threads. A primary data structure is provided for organizing and categorizing blocks of disk space. In addition, a secondary data structure is provided for maintaining a list of all active file system processes and blocks of disk space used by those processes. Blocks of disk space are assigned to pages. At such time as a thread may request allocation of disk space, both data structures are reviewed to determine if the requested disk space is available and to limit access of available disk space to a single page of memory to a single thread at any one time.

Abstract: A method and system for conducting an integrity check of system and user metadata when the metadata is mounted. A filesystem reviewer (48, 74, 84) is embedded within software of a server node. A mutual exclusion lock is obtained on the selected metadata (54, 82, 116, 202, 242, 302). An automated verification of the locked metadata is conducted (58, 86, 120, 156, 206, 246, 306) while the filesystem is mounted. In addition, an automated salvage of the locked metadata may be conducted (62, 90, 124, 158, 210, 250, 310) while the filesystem is mounted. The verification and/or salvage of the locked metadata can be applied to system, user, and/or a portion of the user metadata.

Abstract: A system and method for managing logical versions of a filesystem made through a near-instantaneous copy process is provided. Each logical version of the filesystem, including the primary version, is assigned a unique epoch number or other identifying value, and each filesystem object is assigned two epoch numbers that define the space of logical versions for which the object exists. A list of all valid epoch numbers are maintained in a version table. The near-instantaneous creation of a logical version of the filesystem requires inserting a unique epoch number entry in the version table (106) and the next epoch number to the new logical version. An original state of the system is preserved through the use of a copy-on-write procedure for filesystem objects that are reference by that logical filesystem version (120). Accordingly, filesystem versions are maintained and original states of previous states of the logical filesystem versions are preserved.

Abstract: A method and system for conducting an integrity check of system and user metadata when the metadata is mounted. A filesystem reviewer (48, 74, 84) is embedded within software of a server node. A mutual exclusion lock is obtained on the selected metadata (54, 82, 116, 202, 242, 302). An automated verification of the locked metadata is conducted (58, 86, 120, 156, 206, 246, 306) while the filesystem is mounted. In addition, an automated salvage of the locked metadata may be conducted (62, 90, 124, 158, 210, 250, 310) while the filesystem is mounted. The verification and/or salvage of the locked metadata can be applied to system, user, and/or a portion of the user metadata.