Search Results cs_kb_result_varray_type




Overview

CS_KNOWLEDGE_GRP is a group-type PL/SQL package owned by the APPS schema in Oracle E-Business Suite 12.1.1 and 12.2.2. It provides the internal grouping and link-management layer for the Oracle Knowledge Base functionality used by Oracle Service (CS) and related interaction-channel modules. Where the public API package CS_KNOWLEDGE_PUB exposes the externally callable knowledge operations, CS_KNOWLEDGE_GRP supplies the lower-level set, element, and link construction routines that those public APIs delegate to. Its API classification is GRP, indicating it is intended primarily for consumption by other packages rather than by end-user or custom code.

In business terms, the package supports the organization of knowledge content into sets and elements, the association of sets and elements with source objects (such as service requests, solutions, or other knowledge entities) through link records, and the retrieval of sets or elements matching supplied search criteria. It also participates in the purging and refresh of knowledge links.

Key Procedures and Functions

The ETRM metadata documents fifteen procedures and functions. The principal ones are:

  • CREATE_SET — creates a knowledge set record, providing the container for grouped knowledge content.
  • CREATE_ELEMENT — creates an individual knowledge element belonging to a set.
  • CREATE_SET_AND_ELEMENTS — creates a set together with its constituent elements in a single operation, used when bulk-loading grouped knowledge.
  • CREATE_SET_LINK / CREATE_ELEMENT_LINK — establish associations between a set or element and a target object, storing the relationship in the link tables.
  • DELETE_SET_LINK / DELETE_ELEMENT_LINK — remove previously created set or element associations.
  • UPDATE_SET_LINK — modifies an existing set link, such as changing link attributes or target references.
  • FIND_SETS_MATCHING — returns the sets that satisfy the supplied matching criteria, typically returning set identifiers for further processing.
  • SPECIFIC_SEARCH — performs a targeted search operation, generally a more constrained form of the matching logic used by the public search routines.
  • CONSTRUCT_TEXT_QUERY — builds the text query expression used by the search routines.
  • PURGE_KNOWLEDGE_LINKS — removes obsolete or orphaned knowledge link records, typically as part of a purge or refresh cycle.

The package depends on AMV_SEARCH_PVT, CS_KNOWLEDGE_PUB, FND_API, and STANDARD, and uses collection types such as CS_KB_NUMBER_TBL_TYPE, CS_KB_RESULT_VARRAY_TYPE, CS_KB_VARCHAR100_TBL_TYPE, and the JTF_NUMBER_TABLE and JTF_VARCHAR2_TABLE_* types for bulk parameter passing.

Tables Accessed

  • CS_KB_ELEMENT_LINKS — stores the relationship between knowledge elements and their associated target objects; inserted by CREATE_ELEMENT_LINK, deleted by DELETE_ELEMENT_LINK, and purged by PURGE_KNOWLEDGE_LINKS.
  • CS_KB_SET_LINKS — stores the relationship between knowledge sets and their target objects; maintained by CREATE_SET_LINK, UPDATE_SET_LINK, and DELETE_SET_LINK.
  • JTF_OBJECT_PURGE_PARAM_TMP — a temporary parameter table used by the purge routines to pass purge scope information.
  • PLITBLM — the standard PL/SQL table used for bulk bind and array processing operations.

Usage Notes

CS_KNOWLEDGE_GRP is referenced by five other packages: CS_KNOWLEDGE_GRP itself (recursive/internal calls), CS_KNOWLEDGE_PUB, CS_SERVICEREQUEST_PUB, CS_SR_DELETE_UTIL, IEM_EMAIL_PROC_PVT, and IEM_TEXT_PVT. Invocation therefore occurs indirectly through service request processing, service request deletion, e-mail and text interaction processing, and the public knowledge API. Direct invocation from custom code is not recommended; customizations should call CS_KNOWLEDGE_PUB, which provides the supported public interface and encapsulates the group-level routines. Administrators should note that status is VALID in APPS, and that the package participates in dependency chains that must be preserved when patching or upgrading the knowledge modules in 12.1.1 and 12.2.2.