ONLINE DATABASE TABLE REORGANIZATION

    公开(公告)号:CA2302981C

    公开(公告)日:2004-06-01

    申请号:CA2302981

    申请日:2000-03-29

    Applicant: IBM CANADA

    Abstract: 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 us ed to prevent table scanner access to the database table from missing or duplicating records whi le scanning the database table during reorganization. Removal of the temporary pointers is synchroniz ed 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.

    METHOD FOR EFFICIENTLY SEARCHING FREE SPACE IN A RELATIONAL DATABASE

    公开(公告)号:CA2249080A1

    公开(公告)日:2000-03-25

    申请号:CA2249080

    申请日:1998-09-25

    Applicant: IBM CANADA

    Abstract: A method for efficiently searching free space in a relational database management system. The method limits the search to a finite number of space map pages in the free space map. If the configured number of space map pages in the free space map are searched and a page with free space is not found for the row, the row is inserted on the last page, or if no space is available on the last page a new page is created and the row is inserted on the new page. New rows are then appended until some predefined amount of space is filled before a search is done again. As a result, insertion of a row into the database management system does not incur the worst-case cost of searching the entire free space map.

    METHOD FOR EFFICIENTLY SEARCHING FREE SPACE IN A RELATIONAL DATABASE

    公开(公告)号:CA2249080C

    公开(公告)日:2001-12-04

    申请号:CA2249080

    申请日:1998-09-25

    Applicant: IBM CANADA

    Abstract: A method for efficiently searching free space in a relational database management system. The method limits the search to a finite number of space map pages in the free space map. If the configured number of space map pages in the free space map are searched and a page with free space is not found for the row, the row is inserted on the last page, or if no space is available on the last page a new page is created and the row is inserted on the new page. New rows are then appended until some predefined amount of space is filled before a search is done again. As a result, insertion of a row into the database management system does not incur the worst-case cost of searching the entire free space map.

    ONLINE DATABASE TABLE REORGANIZATION

    公开(公告)号:CA2302981A1

    公开(公告)日:2001-09-29

    申请号:CA2302981

    申请日:2000-03-29

    Applicant: IBM CANADA

    Abstract: 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 us ed to prevent table scanner access to the database table from missing or duplicating records whi le scanning the database table during reorganization. Removal of the temporary pointers is synchroniz ed 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.

Patent Agency Ranking