Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Describe Hashing in DBMS?
Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1)). For this every record requires an unique key.
The primary idea is not to find for the correct position of a record along with comparisons but to compute the position inside the array. The function which returns the position is known the 'hash function' and the array is called a 'hash table'.
Improved Reliability: In a centralised DBMS, a server failure stops the operations of the DBMS. Though, a failure at single site of a DDBMS, or a failure of a communication link cr
An important first step to the statistical analysis of data is to "get to know your data". The following tasks should contribute to this. (a) To the right of the dataset cons
What is a view in SQL? When can views be updated? A view is a virtual table which consists of columns from one or more tables. Through it is same to a table; it is stored in
create an er diagram for production management in film industry
Describe the host language? Host Language: You could write applications along with SQL statements embedded inside a host language. The SQL statements give the database inter
Fragmentation: It is definite as partitioning of a relation into various fragments.Every fragment can be stored at a dissimilar site.
Mention the type of constraints we can specify in the CREATE command of DDL. The type of constraints that can be specified are as follows:- PRIMARY KEY, NOT NULL, UNIQUE, FOR
What is known as clustering file organization? In the clustering file organization, records of several dissimilar relations are stored in the similar file.
Compare the Nested-loop join and block-nested loop join Ans: Nested loop join - It is costly as worst case cost, no. of block accesses needed is n r * b s + b r where b
Consider student (std_id, std_name, date_of_birth, phone, dept_name). Put the data for a student with student id200, name arun, birth date 1 February, 1985, phone number (01110 328
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd