Abstract: A method and computer program for processing structured documents follows a processing framework that enables generation of events corresponding to instance document elements and events corresponding to definition components in a single serial process. The process comprises creating a graph data structure in which nodes of the graph represent components of a document definition. The process further involves reading an instance document conforming to the document definition, identifying elements of the document that correspond to nodes of the graph, identifying a path between nodes of the graph that correspond to elements of the document, and traversing the path to generate a start event when moving from a parent node to a child node and an end event when moving from a child node to a parent node.

Abstract: A system and computer-based method is provided for context-sensitive decomposition of a markup based document into a relational database, based on schemas with reusable item declarations. The user creates a mapping document from a schema of a markup based document with at least one reusable item declaration defining an item being mapped to different tables/columns pairs, depending on the item's ancestry. Mapping document is then annotated with the item ancestry mapping annotation having a location path of the item. Each item is decomposed into a corresponding table column. Preferably, the mapping document is an annotated XML Schema.

Abstract: Methods for pre-processing mapping information for efficient decomposition of an XML document for storage in a database are provided. The method includes receiving a mapping document that describes how all of (or a portion of) an XML document is to be decomposed, transforming the mapping document into a data structure for decomposing an XML document, and making the data persistent for use with a subsequent decomposition operation that decomposes an XML document.

Abstract: Pre-processing mapping information for efficient decomposition of an XML document for storage in a database. A mapping document is received that describes how all of (or a portion of) an XML document is to decomposed, the mapping document is transformed into a data structure for decomposing an XML document, and the data is made persistent for use with a subsequent decomposition operation that decomposes an XML document.

Abstract: A method and computer program for processing structured documents follows a processing framework that enables generation of events corresponding to instance document elements and events corresponding to definition components in a single serial process. The process comprises creating a graph data structure in which nodes of the graph represent components of a document definition. The process further involves reading an instance document conforming to the document definition, identifying elements of the document that correspond to nodes of the graph, identifying a path between nodes of the graph that correspond to elements of the document, and traversing the path to generate a start event when moving from a parent node to a child node and an end event when moving from a child node to a parent node.

Abstract: A system and computer-based method is provided for decomposing and storing a markup based document into a relational database. For a schema of a markup based document a user identifies multiple items mapping into a same database table-column pair, creates a logical table and associates the logical table to each item and a corresponding database table. Next, a user creates a mapping document of the markup based document with mapping annotations defining mapping of the items into columns of the logical tables. Decomposition of each item into a corresponding logical table column is accomplished by collecting the item content from the markup based document and storing it in the corresponding row column.

Abstract: Aspects for handling destage requests during shutdown in a log-structured array storage subsystem are described. In a method aspect, the method includes receiving a shut-down command, and utilizing at least three data structures for tracking destage requests when the shut-down command is received, wherein closing of open segments before completion of the shut-down is ensured. A further method aspect includes maintaining an outstanding requests list and destage requests list, forming a missing requests list based on the contents of the outstanding requests list and destage requests list when a shut-down command occurs, and tracking destage request processing with the outstanding requests list, destage requests list and missing requests list until all destage requests have been successfully completed.

Abstract: In a storage system comprising an array of storage devices, including a processor and memory, a plurality of logical tracks are organized on the storage devices in segments comprising columns striped across the storage devices. A system and method are provided for storing logical tracks in the storage devices. Sequentially logically related logical tracks are stored together in neighborhoods. Logical tracks of the same neighborhood destaged at the same time are assigned to a single open segment with other logical tracks of the same neighborhood type. The time at which open segments are designated as closed segments to be written to the storage devices is based on performance, disk utilization and memory utilization criteria. Logical tracks are never split between segment columns. Also, attempts are made not to split a neighborhood of logical tracks being destaged together between segment columns.

Abstract: Aspects for increasing concurrency during staging and destaging of a log structured array (LSA) are described. In an exemplary method aspect, the method includes determining a process type making a request for access to a locking mechanism associated with an LSA directory entry for a logical track, and determining a lock status for the locking mechanism. Access to the locking mechanism is then provided according to the determined process type and lock status. Further, a destaging process is allowed to obtain an available locking mechanism in a read-write mode, a staging process is allowed to obtain an available locking mechanism in a read-only mode, and a garbage collection process is allowed to obtain an available locking mechanism initially in a read-only mode and subsequently in a read-write mode, wherein increased concurrency results during the staging and destaging processes.

Abstract: In a storage system comprising an array of storage devices, including a processor and memory, a plurality of logical tracks are organized on the storage devices in segments comprising columns striped across the storage devices. A system and method are provided for storing logical tracks in the storage devices. Sequentially logically related logical tracks are stored together in neighborhoods. Logical tracks of the same neighborhood A0 destaged at the same time are assigned to a single open segment with other logical tracks of the same neighborhood type. The time at which open segments are designated as closed segments to be written to the storage devices is based on performance, disk utilization and memory utilization criteria. Logical tracks are never split between segment columns. Also, attempts are made not to split a neighborhood of logical tracks being destaged together between segment columns.

Abstract: A method for rebuilding contents of a malfunctioned direct access storage device within a log-structured array is disclosed. In accordance with the method and system of the present invention, each direct access storage device within a log-structured array is divided into multiple segment-columns, and each corresponding segment-column from each direct access storage device within the log-structured array forms a segment. A segment is first located within the direct access storage devices. A determination is made as to whether or not the segment is empty. In response to a determination that the segment is empty, a pointer is moved within a segment-column mapping table from pointing to a segment-column in the malfunctioned direct access storage device to point to a segment-column in a spare direct access storage device of the segment.

Abstract: A method for rebuilding contents of a malfunctioned direct access storage device within a log-structured array is disclosed. In accordance with the method and system of the present invention, each direct access storage device within a log-structured array is divided into multiple segment-columns, and each corresponding segment-column from each direct access storage device within the log-structured array forms a segment. A segment is first located within the direct access storage devices. A determination is made as to whether or not the segment is empty. In response to a determination that the segment is empty, a pointer is moved within a segment-column mapping table from pointing to a segment-column in the malfunctioned direct access storage device to point to a segment-column in a spare direct access storage device of the segment.