We are building EduLadder(ELADR) - Protocol

The Eladr Protocol is a decentralized, security and efficiency enhanced Web3 noSQL database powered by IPFS as the data storage layer https://ipfs.io/, and the Cardano block chain as the rewards token platform, https://cardano.org/. It provides a JSON based, IPFS layer 2 solution for data indexing and retrieval in an 'append only' file system built with open source Node.js API libraries.

The ELADR token was designed to incentivize and reward community members as a proof of contribution. Token holders are also granted access to EduLadder.com premium features as well as associated ELADR token enabled apps.


Real Problems! Real Experts!

Join Our Telegram Channel !

The Eduladder is a community of students, teachers, and programmers. We help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions? Ask Questions

You are here:Open notes-->VTU-->ADVANCED-DBMS-10CS751


How to study this subject

Subject Code: 10CS751 I.A. Marks : 25
Hours/Week : 04 Exam Hours: 03
Total Hours : 52 Exam Marks: 100
UNIT 1 7 Hours
Overview of Storage and Indexing, Disks and Files : Data on external
storage; File organizations and indexing; Index data structures; Comparison
of file organizations; Indexes and performance tuning
Memory hierarchy; RAID; Disk space management; Buffer manager; Files of
records; Page formats and record formats
UNIT 2 7 Hours
Tree Structured Indexing: Intuition for tree indexes; Indexed sequential
access method; B+ trees, Search, Insert, Delete, Duplicates, B+ trees in
UNIT 3 6 Hours
Hash-Based Indexing: Static hashing; Extendible hashing, Linear hashing,
UNIT 4 6 Hours
Overview of Query Evaluation, External Sorting : The system catalog;
Introduction to operator evaluation; Algorithms for relational operations;
Introduction to query optimization; Alternative plans: A motivating example;
what a typical optimizer does.
When does a DBMS sort data? A simple two-way merge sort; External merge
UNIT 5 6 Hours
Evaluating Relational Operators : The Selection operation; General
selection conditions; The Projection operation; The Join operation; The Set
operations; Aggregate operations; The impact of buffering 76
UNIT 6 7 Hours
A Typical Relational Query Optimizer: Translating SQL queries in to
Relational Algebra; Estimating the cost of a plan; Relational algebra
equivalences; Enumeration of alternative plans; Nested sub-queries; other
approaches to query optimization.
UNIT 7 7 Hours
Physical Database Design and Tuning: Introduction; Guidelines for index
selection, examples; Clustering and indexing; Indexes that enable index-only
plans; Tools to assist in index selection; Overview of database tuning;
Choices in tuning the conceptual schema; Choices in tuning queries and
views; Impact of concurrency; DBMS benchmarking.
UNIT 8 6 Hours
More Recent Applications: Mobile databases; Multimedia databases;
Geographical Information Systems; Genome data management
Text Books:
1. Raghu Ramakrishnan and Johannes Gehrke: Database Management
Systems, 3rd Edition, McGraw-Hill, 2003.
(Chapters 8, 9, 10, 11, 12, 13.1 to 13.3, 14, 15, 20)
2. Elmasri and Navathe: Fundamentals of Database Systems, 5th
Edition, Pearson Education, 2007.
(Chapter 30)
Reference Books:
1. Connolly and Begg: Database Systems, 4th Edition, Pearson
Education, 2002. 

Official Notes

Add contents here

Notes from other sources

Add contents here

Model question papers

Add contents here

Previous year question papers

Add contents here

Useful links

Add contents here



You might like this video:Watch more here

Watch more videos from this user Here

Learn how to upload a video over here