In Oracle database, if we have any date field such as DOB field in any of our tablethen we can use DECODE function to sort the result based on our own customizedorder.This can be done by including the following in ORDER BY clause:DECODE(TO_CHAR(DOB,'DAY'),'SUNDAY', 1,'MONDAY', 2,'TUESDAY', 3,TrueFalse'WEDNESDAY', 4,'THURSDAY', 5,'FRIDAY', 6,'SATURDAY', 7)This will generate the correct ordered result BRANCH_NO SALES RANK10010511311210210611010411110110810710311410935007880133658205 128680995125414340120175110188020651608779514439605 213796770 311957615311520520 3114676153993995049036135 41646200 4TrueFalse222 №This can be done by including a RANK function:DENSE_RANK() OVER (order by sum(subtotal) desc) Rank

Description: The first answer is false. Because the Oracle DECODE function is used to search the…

Answered: cle database, if we have any date field…

cle database, if we have any date field such as DOB field in a ve can use DECODE function to sort the result based on our ORDER DK

Np Ms Office 365/Excel 2016 I Ntermed

1st Edition

ISBN:9781337508841

Author:Carey

Publisher:Carey

Chapter3: Performing Calculations With Formulas And Functions

Section: Chapter Questions

Problem 3.15CP

See similar textbooks

Similar questions

In python code: Using the dataframe produced in question#2 and your Database class from Lab1, Byte Stream your dataframe into your Database object. Also, use your Query Builder to build the Insert Query for your byte stream insertion. class GreenhouseGas(NamedTuple): Gas: str Pre_1750: float Recent: float Absolute_increase_since_1750: float Percentage_increase_since_1750: float def __repr__(self): return f"Gas: {self.Gas}, Pre-1750: {self.Pre_1750}, Recent: {self.Recent}, Absolute increase since 1750: {self.Absolute_increase_since_1750}, Percentage increase since 1750: {self.Percentage_increase_since_1750}" def __lt__(self, other): return self.Recent < other.Recent def __eq__(self, other): return self.Gas == other.Gas @classmethod def from_list(cls, data): gas, pre_1750, recent, absolute_increase, percentage_increase = data return cls(gas, pre_1750, recent, absolute_increase, percentage_increase) def…
1) Assume the EMPLOYEE table has the following rowsID DEPT SALARY NAME100 SALES 40000 Smith101 RD 38000 Terry102 HR 60000 David103 SALES 58000 Ellie104 RD 70000 Judya) Provide the complete PL/SQL code to implement a Virtual Private Database suchthat an employee could only view the records for employees in the samedepartment while masking coworkers’ salary with NULL.b) Based on the Virtual Private Database you implemented in step a), would anemployee be able to insert, update or delete a record for another employee whoworks in another department? If yes, what might be the potential security risk andhow would you fix the problem by setting up the VPD appropriately?
You are interested in analyzing some hard-to-obtain data from two separate databases. Each database contains n numerical values—so there are 2n values total—and you may assume that no two values are the same. You'd like to determine the median of this set of 2n values, which we will define here to be the nth smallest value. However, the only way you can access these values is through queries to the databases. In a single query, you can specify a value k to one of the two databases, and the chosen database will return the kth smallest value that it contains. Since queries are expensive, you would like to compute the median using as few queries as possible. Give a recursive algorithm that finds the median value using at most O(logn) queries. Explain why your algorithm only requires at most O(log(n)) queries to locate the median?
A database has four transactions. Let min sup = 60% and min conf = 80%.cust ID TID items bought (in the form of brand-item category)01 T100 {King’s-Crab, Sunset-Milk, Dairyland-Cheese, Best-Bread}02 T200 {Best-Cheese, Dairyland-Milk, Goldenfarm-Apple, Tasty-Pie, Wonder-Bread}01 T300 {Westcoast-Apple, Dairyland-Milk, Wonder-Bread, Tasty-Pie}03 T400 {Wonder-Bread, Sunset-Milk, Dairyland-Cheese}(a) At the granularity of item category (e.g., itemi could be “Milk”), for the ruletemplate,∀X ∈ transaction, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3) [s,c],list the frequent k-itemset for the largest k, and all the strong association rules(with their support s and confidence c) containing the frequent k-itemset for thelargest k.(b) At the granularity of brand-item category (e.g., itemi could be “Sunset-Milk”),for the rule template,∀X ∈ customer, buys(X,item1) ∧ buys(X,item2) ⇒ buys(X,item3),list the frequent k-itemset for the largest k (but do not print any rules).
In the SQL Oracle Application Write one query to return the employee_id, job_id, hire_date, and department_id of all employees and a second query listing employee_id, job_id, start_date, and department_id from the job_history table and combine the results as one single output. Make sure you suppress duplicates in the output.
Consider the query:select *from r, swhere upper(r.A) = upper(s.A);where “upper” is a function that returns its input argument with all lowercaseletters replaced by the corresponding uppercase letters. Find out what plan is generated for this query on the database system you use.
Try switching the joins pthread_join(tid2, NULL); pthread_join(tid1, NULL); Do you see any difference? Please report if and why you do or do not see any difference in terms of the randomness in the result of the shared resource. In the inc_dec_resource() function, implement mutual exclusion (pthread_mutex_lock) to ensure that the result becomes 0 every time when you execute your program. Put your updated code in the report (highlighted) and show your screenshot of the execution by running the script three time using $ time ./shared_resource_mutex. Hint: Your loop is incrementing/decrementing the resource which should be protected by each thread while it is executing that portion. #include <stdio.h> #include <pthread.h> #define iterations 300000000 long long shared_resource = 0; pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; // Thread function to modify shared resource void* inc_dec_resource(void* arg){ //get the pointer from main thread and dereference it…
Try switching the joins pthread_join(tid2, NULL); pthread_join(tid1, NULL); Do you see any difference? Please report if and why you do or do not see any difference in terms of the randomness in the result of the shared resource. In the inc_dec_resource() function, implement mutual exclusion (pthread_mutex_lock) to ensure that the result becomes 0 every time when you execute your program. Put your updated code in the report (highlighted) and show your screenshot of the execution by running the script three time using $ time ./shared_resource_mutex. Hint: Your loop is incrementing/decrementing the resource which should be protected by each thread while it is executing that portion. /* Compile: gcc -o shared_resouce_mutex shared_resource_mutex.c -lpthread Execute: ./shared_resource_mutex */ #include <stdio.h> #include <pthread.h> #define iterations 300000000 long long shared_resource = 0; pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; // Thread function to…
what is insert anomaly, Updateanomaly, and Delete anomaly
awk is similar to the SQL language in that you can query certain records. What command below will search the the file /etc/passwd file by locating all users that have a default shell '/bin/bash' and print the first column (which is the user name). awk -D: '$7 == "/bin/bash" {print $3}' /etc/passwd Give this to your new intern to figure out. awk -F: '$4 == "/bin/bash" {print $10}' /etc/passwd awk -F: '$7 == "/bin/bash" {print $1}' /etc/passwd awk -F: '$1 == "/bin/bash" {print $7}' /etc/passwd.
Update this database with the following stored modules and submit the updatedCompanyDB.sql file as your solution. Additionally, provide screenshots for all the code 1. A stored procedure that takes in a department identifier and prints a list of all employeesin that department.2. A stored procedure that lists all employee names that do not have any dependents.3. A function that takes in an employee id and returns the number of hours the employee isworking on all their assigned projects4. A stored procedure that updates the ‘Hours’ field for all employees in the employee tableusing a cursor and the function defined in part 3.5. Triggers that are activated after any inserts, deletes, or updates on the WORKS_ON table.The triggers will update the Hours field in the Employee table to reflect any changes forthe hours worked.6. A stored procedure that lists any employees working less than 20 hours.
A manager has a list of items that have been sorted according to an item ID. Some of them are duplicates. She wants to add a code to the database that assigns a 1 to the item if it is unique, and if there are duplicates, assigns the number of the duplicate. An example is shown below. The first two items are unique, so the repeat code is 1. However, Item ID 37695 is listed six times, so the codes are assigned from 1 to 6, and so on. Explain how to assign the correct code using an IF statement Item ID Repeat Code35080 135222 137695 137695 237695 337695 437695 537695 637712 137722 137757 137757 2 In cell B2 enter 1, and then type a formula into cell B3, followed by dragging the formula down column B until it aligns with the last row in the Item ID column. Which of the following is the correct formula to type into cell B3?