Abstract: In accordance with a first aspect, a software component is equipped to identify looked-up table fields in a data processing statement, and automatically includes with a SQL statement one or more appropriate JOIN clauses joining one or more target tables from which the table fields are to be looked up with a basis table. In one embodiment, the looked-up table fields are expressed in a multi-part form. In accordance with a second aspect, a software component is equipped to automatically expand table fields available for inclusion in a data processing operation to include table fields of a target table of a look-up table field, in response to the selection of the look-up table field. In one embodiment, the second aspect is practiced in conjunction with the automatic inclusion of appropriate JOIN clauses to a SQL statement of the first aspect.

Abstract: An integrated guardianship system. The system can include a Clerk of the Court system for processing ward data and guardianship data; a guardian background investigation system communicatively linked to the Clerk of the Court system over a computer communications network; and, at least one database for storing ward, guardianship and background data, wherein the ward, guardianship and background data can be accessed by an authorized system communicatively linked to the computer communications network. Notably, the guardian background investigation system can conduct background investigations of guardians based on guardian data electronically provided by the Clerk of the Court system over the computer communications network. The background investigations, in turn, can produce guardian background data. Finally, the guardian background investigation system can electronically provide the guardian background data to the Clerk of the Court system over the computer communications network.

Abstract: A method and apparatus for improving search performance in databases organized in B Tree or B+ Tree format has an automatic determination and switching between two methods. It also searches to the end of a current leaf page even if a current value for all key parameters has been fulfilled in the search prior to reaching the end of the current leaf page. Swinging across and thus skipping leaf pages to fetch a next leaf page (trapeze fetching or swinging) is activated only either initially or where a B Tree search has resulted in a skipping of leaf pages previously in a search. User interference with the automatic selection of search type between next sequential leaf or trapeze type is not provided for and not allowed.