公开(公告)号：CA2366338C

公开(公告)日：2006-08-08

申请号：CA2366338

申请日：2001-12-21

Applicant: IBM CANADA

Inventor： DOOLE DOUGLAS J ,  VINCENT TIMOTHY J ,  WILSON GEORGE M ,  BOUSFIELD MELISSA ,  MCKEOUGH SEAN W

IPC: G06F17/30 ,  G06F9/40 ,  G06F9/445

Abstract: Library management for libraries of user-defined routines in a database system. Libraries are stored in a long-term storage device and loaded into working memory in t he database system when routines in the libraries are to be executed. An unload thread is defin ed to carry out the process of unloading libraries from the working memory when such libraries are inactive. The unload thread becomes active on a defined timing interval. The unload thread accesses a ha sh table and a most recently used list to determine which of the loaded libraries is inactive an d which of the libraries ought to be unloaded. The hash table maintains information as to which libraries have been accessed in the most recent past defined timing interval. The size of the most recent ly used list can be defined such that all libraries associated with the list are retained in working memory.

公开(公告)号：CA2366338A1

公开(公告)日：2003-06-21

申请号：CA2366338

申请日：2001-12-21

Applicant: IBM CANADA

Inventor： WILSON GEORGE M ,  BOUSFIELD MELISSA ,  DOOLE DOUGLAS J ,  VINCENT TIMOTHY J ,  MCKEOUGH SEAN W

IPC: G06F9/40 ,  G06F9/445 ,  G06F17/30

Abstract: Library management for libraries of user-defined routines in a database system. Libraries are stored in a long-term storage device and loaded into working memory in t he database system when routines in the libraries are to be executed. An unload thread is defin ed to carry out the process of unloading libraries from the working memory when such libraries are inactive. The unload thread becomes active on a defined timing interval. The unload thread accesses a ha sh table and a most recently used list to determine which of the loaded libraries is inactive an d which of the libraries ought to be unloaded. The hash table maintains information as to which libraries have been accessed in the most recent past defined timing interval. The size of the most recent ly used list can be defined such that all libraries associated with the list are retained in working memory.