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'.
Explain cursors in SQL? Cursors in SQL - An object used to store the output of a query for row-through-row processing through the application programs. Cursors are constructs
If R1 and R2 are two relations or functions, then the result of R3 = R1 × R2 is the combination of tuples that are in R1 and R2. The product is associative and commutative. Degr
System level permissions : With the use of data dictionary you can view them. Let us take the table name as user_sys_privs (used in oracle). DESCRIBE USER_SYS_PRI
Views in relational algebra: 1. Basic expression contains either a) A relation in the database. b) A constant relation. 2. General expressions are madde out of sma
I need solution of the question posted at http://www.expertsmind.com/questions/sql-query-for-testing-triggers-and-stored-procedures-30140149.aspx
Which of the operations constitute a basic set of operations for manipulating relational data? Relational algebra operations constitute a basic set of operations for manipulati
Define granularity, hierarchy of granularity of locks & multiple granularity locking. Explain the modified two phase locking along with multiple granularity locking. Ans: The s
Explain Candidate key? Candidate Key - A candidate key is a minimal superkey, that can be used to uniquely identify a tuple in the relation.
What is candidate key? Candidate Key - A candidate key of an entity set is a minimal superkey, which uniquely identifies each row in the relation.
Explain the Management of Data Store Every system irrespective of its nature of application requires storing permanent data for consequent use in problem solving. Some objects
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd