METHOD AND SYSTEM FOR EFFICIENTLY SEARCHING FOR FREE SPACE IN A TABLE OF A RELATIONAL DATABASE HAVING A CLUSTERING INDEX

    公开(公告)号:CA2281287C

    公开(公告)日:2003-03-11

    申请号:CA2281287

    申请日:1999-09-01

    Applicant: IBM CANADA

    Abstract: A method of searching a table in a database management system for free space for inserting a new record into the table. The table resides in a storage media, and includes a series of pages capable of storing a plurality of records. The table has a clustering index defined in a column of the table. The new record has a new record attribute for storing in the column o f the table when the new record is stored in the table. The method comprises searching for a target page in the series of pages, the target page being selected to maintain clustering when the new record is inserted thereon. Once the target page has been located, it is searched for sufficient free space t o accommodate the new record. If sufficient free space is found on the target page, then the new record is inserted on the target page. If sufficient free space is not found on the target page, then a target neighbourhood of pages in the series of pages is searched for sufficient free space to accommodate the new record. The target neighbourhood of pages surrounds the target page. If sufficient free space is found on a page in a target neighbourhood of pages, then the new record is inserted on to this page in the target neighbourhood of pages. If sufficient free space is not found in the target neighbourhood of pages, then the methodfurther comprises searching for sufficient free space to accommodate the new record outside the target neighbourhood of pages. If sufficient free space is found outside the target neighbourhood of pages, then the new record is inserted on a non-neighbourin g page outside the target neighbourhood of pages. If sufficient free space is not found outside the target neighbourhood of pages, then a new page having the new record is appended to the end of table.

    METHOD AND SYSTEM FOR EFFICIENTLY SEARCHING FOR FREE SPACE IN A TABLE OF A RELATIONAL DATABASE HAVING A CLUSTERING INDEX

    公开(公告)号:CA2281287A1

    公开(公告)日:2001-03-01

    申请号:CA2281287

    申请日:1999-09-01

    Applicant: IBM CANADA

    Abstract: A method of searching a table in a database management system for free space for inserting a new record into the table. The table resides in a storage media, and includes a series of pages capable of storing a plurality of records. The table has a clustering index defined in a column of the table. The new record has a new record attribute for storing in the column o f the table when the new record is stored in the table. The method comprises searching for a target page in the series of pages, the target page being selected to maintain clustering when the new record is inserted thereon. Once the target page has been located, it is searched for sufficient free space t o accommodate the new record. If sufficient free space is found on the target page, then the new record is inserted on the target page. If sufficient free space is not found on the target page, then a target neighbourhood of pages in the series of pages is searched for sufficient free space to accommodate the new record. The target neighbourhood of pages surrounds the target page. If sufficient free space is found on a page in a target neighbourhood of pages, then the new record is inserted on to this page in the target neighbourhood of pages. If sufficient free space is not found in the target neighbourhood of pages, then the methodfurther comprises searching for sufficient free space to accommodate the new record outside the target neighbourhood of pages. If sufficient free space is found outside the target neighbourhood of pages, then the new record is inserted on a non-neighbourin g page outside the target neighbourhood of pages. If sufficient free space is not found outside the target neighbourhood of pages, then a new page having the new record is appended to the end of table.

    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