Q.29: What is the use of temporary tablespaces? Ans: Temporary tablespaces work for specific processes like SQL hash joins and table data sorting. In SQL, if data size is large and comprise upon millions of returned rows, then the temporary memory of computer (RAM) becomes insufficient. As a result, the sort job takes place on disk by using temporary tablespaces. Q.30: Briefly explain the importance of temporary tablespace?
Applications have typically been categorized as either Client or Server applications. Traditional client/server interactions are often data-centric and combine most of the processing (or business) logic and user interface within the Client application. Client or Server applications have usually performed many of the functions of stand-alone systems and present a user interface, gather and process user input, perform the requested processing, and report the status of the request. Without a standard framework to work with, each application can end up sharing very little of its control-flow logic with another application. This leads to buggier software and maintainability nightmares.
Network packets can be examined using the OSI model to interpret the raw data into an application-level stream. Application analysis is a large category of analysis techniques because there are so many application types. Some of the more common ones are listed here: • OS Analysis: An operating system is an application, although it is a special application because it is the first one that is run when a computer starts. This analysis examines the configuration files and output data of the OS to determine what events may have occurred. • Executable Analysis: Executables are digital objects that can cause events to occur and they are frequently examined during intrusion investigations because the investigator needs to determine what events the executable could
10th January (2008). Introduction to Relational Database-Part I: Theory Foundation. Ashith Trivedi.6th February (2014).Mapping Relational Database and SQL Susan Harkins. 30th April(2003). Relational Database: Defining Relationship between Database Tables.
Modifying and testing monolithic systems takes longer than their microkernel counterparts. When a bug surfaces within the core of the kernel the effects can be far reaching. Also, patching monolithic systems can be more difficult (especially for source patching). Microkernel The microkernel architecture is very different from the monolithic. In the microkernel, only the most fundamental of tasks are are performed such as being able to access some (not necessarily all) of the hardware, manage memory and coordinate message passing between the processes.
There is probability that a single file may be stored in many other different places. DeDuplication takes care of those data’s which are stored in many places. To perform this operation we needed to have an algorithm which could be helpful in removing of those data’s. The duplicated data may be either in primary storage or may be in the secondary storage drive. But here we are going to work on with the secondary storage device and there are many algorithms existing to avoid duplication in secondary devices but each on fails in something or other.
Thus, providing client server architecture.  2.2 Disadvantages: • Difficulty in Interfacing: Interfacing an SQL database is more complex than adding a few lines of code.  • Tables dependency: When create a view based on underlying tables of a database. Whenever we change the structure of those tables that view associated with, we have to change the view as well.