resume _of_all
Posts
h...........12/3/2019 - 1/4/19 i............7/3/2019- 27/3/19 Numerical analysis 4 way search tree with child pointer and record pointer (problem with mbay search tree is creation of node under the guideline can be done in any way) About b tree: here is cp and bp both B+ tree B++ tree theory part Note: <v1,R1,> value and record pointer Note: A B/B+ tree with order p has maximum p pointers and hence maximum p children. A B/B+ tree with order p has minimum ceil(p/2) pointers and hence minimum ceil(p/2) children. A B/B+ tree with order p has maximum (p – 1) and minimum ceil(p/2) – 1 keys. What is SQL? SQL stands for Structured Query Language. It is a language used to interact with the database, i.e to create a database, to create a table in the database, to retrieve data or update a table in the database etc. SQL is an ANSI(American National Standards Institute) standard. What is a Database? A Database is d...