Answer:
Searching and sorting.
Step-by-step explanation:
A data dictionary can be defined as a centralized collection of information on a specific data such as attributes, names, fields and definitions that are being used in a computer database system.
In a data dictionary, data elements are combined into records, which are meaningful combinations of data elements that are included in data flows or retained in data stores. This ultimately implies that, a data dictionary found in a computer database system typically contains the records about all the data elements (objects) such as data relationships with other elements, ownership, type, size, primary keys etc. This records are stored and communicated to other data when required or needed.
Basically, when a database management system (DBMS) receives data update requests from application programs, it simply instructs the operating system installed on a server to provide the requested data or informations.
Binary search is an efficient algorithm used to find an item from a sorted list of items by using the run-time complexity of Ο(log n), where n is total number of elements.
Binary search applies the principles of divide and conquer.
A primary key refers to a keyword found in a relational database which uniquely identifies each record contained therein.
A relational database can be defined as a type of database that is structured in a manner that there exists a relationship between its elements. Also, in a relational database, a single space within a row or column contains exactly one value.
Hence, the function of primary keys is that, primary keys facilitates searching and sorting because they act as unique identifiers.