Abstract: A method, computer program product and computing device for promoting reuse of previously generated access plans in a relational DBMS are disclosed. SQL statements containing literals are amended so as to substitute a parameter marker for each literal. Amended statements are provided to the DBMS along with parameters comprising the substituted literals and a substitution indicator indicating that the substitution has been performed. The DBMS assesses the soundness of the substitutions that are performed. Soundness may be measured in terms of the semantic correctness of the amended statement and the likelihood that the literal substitution will improve DBMS efficiency. If a substitution is unsound, the DBMS may obtain and optimize (i.e. select an access plan for) the original version of the amended SQL statement. Otherwise, the amended statement is optimized.

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 the database system when routines in the libraries are to be executed. An unload thread is defined 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 hash table and a most recently used list to determine which of the loaded libraries is inactive and 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 recently used list can be defined such that all libraries associated with the list are retained in working memory.

Abstract: An SQL database management system for executing SQL requests from applications. The SQL database management system includes a hierarchical arrangement of data structures comprising packages, section entries, sibling control blocks and sections, for representing SQL context information and SQL statement information. Each package represents SQL context information on an application component-level basis. Each section entry is associated with a package and corresponds to a set of SQL actions. Each section entry is potentially associated with one or more sibling control blocks. Each sibling control block is associated with one section and represents context information relating to a unique SQL request. Each section includes logic for a specific SQL statement.

Abstract: Working memory in an SQL database system is organized in workspaces. Agent workspaces are defined into which working copies of SQL executable logic information are loaded. Application workspaces are also defined for the loading of working copies of SQL executable logic information. Reference copies of the SQL information are available in a global SQL cache. An application SQL context data structure is used as an entry point to access working copies of SQL information in the agent or application workspaces. An application workspace is associated with an application and is maintained until the last application in the set is not active. An agent workspace is associated with an agent in the database system and is maintained until the agent is no longer active.

Abstract: A cursor query identifier is defined to uniquely identify cursors in a relational database system that supports nested routine invocation. The identifier includes a cursor nesting level value that corresponds to the nested level at which the cursor is opened. The identifier also includes a invocation identifier that corresponds to the routine within which a cursor is opened. The third part of the identifier is a unique cursor counter. The definition of the cursor query identifier permits cursors to be opened within nested levels of the same relational database context and to be uniquely identified for reference by database system and by applications accessing the system.

Abstract: A database management system provides for the execution of invokable user-defined routines. Applications specify user-defined routines as being threadsafe or not threadsafe and specify the language of user-defined routines. Execution of routines will be carried out dependent on the threadsafe characteristic of the routines and on the language of the routines. Routines are assigned to processes based on their language to have any given process execute routines of the same language. Routines that are specified to be threadsafe are executed in threads in a potentially multi-threaded process. Each routine that is specified to be not threadsafe is executed in a fenced-mode processes in which no other routine is being executed.

Abstract: A system and method for managing deadlocks in a database management system (DBMS) for a demultiplexed database system having worker agents and applications associated with, and disassociated from, the worker agents is disclosed. The DBMS of the present invention supports applications that are capable of holding and retaining locks on database resources while disassociated from worker agents. The system and method of the present invention includes an application scheduler for managing requests for access to the database, and a deadlock detector for identifying a deadlock. According to one embodiment of the present invention, the application scheduler assigns one worker agent to an application requesting access to a database resource, assigns a flag to an application holding a lock on the database resource while disassociated from a worker agent, and in cooperation with the deadlock detector, resolves the deadlock between the application requesting access and the flagged application holding the lock.