Modified version of Chapter 18 of the book Fundamentals_of_Database_Systems,_6th_Edition with review questions
as part of database management system course
File is the basic unit of information storage on a secondary storage device. Therefore, almost every form of data and information reside on these devices in form of file – whether audio data or video, whether text or binary.
Files may be classified on different bases as follows:
1. On the basis of content:
Text files: Files containing data/information in textual form. It is merely a collection of characters. Document files etc.
Binary files: Files containing machine code. The contents are non-recognizable and can be interpreted only in a specified way using the same application that created it. E.g. executable program files, audio files, video files etc.
Content of slide
Tree
Binary tree Implementation
Binary Search Tree
BST Operations
Traversal
Insertion
Deletion
Types of BST
Complexity in BST
Applications of BST
In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. https://apkleet.com
<a href="https://apkleet.com" >games apk </a>
File is the basic unit of information storage on a secondary storage device. Therefore, almost every form of data and information reside on these devices in form of file – whether audio data or video, whether text or binary.
Files may be classified on different bases as follows:
1. On the basis of content:
Text files: Files containing data/information in textual form. It is merely a collection of characters. Document files etc.
Binary files: Files containing machine code. The contents are non-recognizable and can be interpreted only in a specified way using the same application that created it. E.g. executable program files, audio files, video files etc.
Content of slide
Tree
Binary tree Implementation
Binary Search Tree
BST Operations
Traversal
Insertion
Deletion
Types of BST
Complexity in BST
Applications of BST
In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data. https://apkleet.com
<a href="https://apkleet.com" >games apk </a>
Describes basic understanding of priority queues, their applications, methods, implementation with sorted/unsorted list, sorting applications with insertion sort and selection sort with their running times.
Indexing is used to speed up access to desired data.
E.g. author catalog in library
A search key is an attribute or set of attributes used to look up records in a file. Unrelated to keys in the db schema.
An index file consists of records called index entries.
An index entry for key k may consist of
An actual data record (with search key value k)
A pair (k, rid) where rid is a pointer to the actual data record
A pair (k, bid) where bid is a pointer to a bucket of record pointers
Index files are typically much smaller than the original file if the actual data records are in a separate file.
If the index contains the data records, there is a single file with a special organization.
Database systems that were based on the object data model were known originally as object-oriented databases (OODBs).These are mainly used for complex objects
This PPT is all about the Tree basic on fundamentals of B and B+ Tree with it's Various (Search,Insert and Delete) Operations performed on it and their Examples...
This presentation gives a basic introduction to files as a Data Structure. Physical Files and Logical Files are covered. Files as a collection of records and as a stream of bytes are talked about. Basic operations in files are explained. C syntax is given. Types of files are briefly talked about.
Describes basic understanding of priority queues, their applications, methods, implementation with sorted/unsorted list, sorting applications with insertion sort and selection sort with their running times.
Indexing is used to speed up access to desired data.
E.g. author catalog in library
A search key is an attribute or set of attributes used to look up records in a file. Unrelated to keys in the db schema.
An index file consists of records called index entries.
An index entry for key k may consist of
An actual data record (with search key value k)
A pair (k, rid) where rid is a pointer to the actual data record
A pair (k, bid) where bid is a pointer to a bucket of record pointers
Index files are typically much smaller than the original file if the actual data records are in a separate file.
If the index contains the data records, there is a single file with a special organization.
Database systems that were based on the object data model were known originally as object-oriented databases (OODBs).These are mainly used for complex objects
This PPT is all about the Tree basic on fundamentals of B and B+ Tree with it's Various (Search,Insert and Delete) Operations performed on it and their Examples...
This presentation gives a basic introduction to files as a Data Structure. Physical Files and Logical Files are covered. Files as a collection of records and as a stream of bytes are talked about. Basic operations in files are explained. C syntax is given. Types of files are briefly talked about.
Introduction to transaction processing concepts and theoryZainab Almugbel
Modified version of Chapter 21 of the book Fundamentals_of_Database_Systems,_6th_Edition with review questions
as part of database management system course
Ch 17 disk storage, basic files structure, and hashingZainab Almugbel
Modified version of Chapter 17 of the book Fundamentals_of_Database_Systems,_6th_Edition with review questions
as part of database management system course
Adbms 22 dynamic multi level index using b and b+ treeVaibhav Khanna
A single-level index is an auxiliary file that makes it more efficient to search for a record in the data file.
The index is usually specified on one field of the file (although it could be specified on several fields)
One form of an index is a file of entries <field value, pointer to record>, which is ordered by field value
The index is called an access path on the field
Furnish an Index Using the Works of Tree Structuresijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Ontology based approach for annotating a corpus of computer science abstractsZainab Almugbel
This presentation was presented in ICCIS 2019 conference. It tacks the issue of searching massive number of papers by answering two questions: what to represent and how to represent
Representing, Querying, and Visualizing Health-Insurance Knowledge in a Cost-...Zainab Almugbel
Cost-Sharing Estimator (CostShEs) 1.0 is a prototype for
health-insurance knowledge representation, querying, and visualization. CostShEs 1.0 allows client-side consultation about the cost of a healthcare service for a client with/without insurance. The input to this prototype system is a form-based inquiry by a client about the cost of a service. Based on the client’s entered membership number, desired service, etc., CostShEs 1.0 generates a logical query. The output is the calculated cost of the service, optionally as a text or a visualization. For logical reasoning, CostShEs 1.0 requires (1) an RDFS taxonomy, (2) webized Rule Markup Language (RuleML) data, and (3) RuleML decision rules. The
taxonomy helps the system to find the client’s relatives that can take advantage of his/her insurance. The webized RuleML data are relational ground facts that link to the relevant information on web pages, such as a client’s web page. Based on (1) and (2), the decision rules answer the query. These three components form the knowledge base that CostShEs uses for reasoning with the Object Oriented Java Deductive Reasoning Engine for the Web (OO jDREW). The visualization of the system’s output
in Graph Inscribed Logic (Grailog) is obtained via GrailogKSViz 2.0 translation of RuleML/XML to Scalable Vector Graphics (SVG/XML).
a use case calculates cost sharing (the shared cost between customers who needs medical service and insurance company) It uses RuelML for knowledge representation and convert it to scale vector machine graph using Grailog
Database concepts and Archeticture Ch2 with in class ActivitiesZainab Almugbel
This is the slides of chapter 2 of the book Ramez Elmasri and Shamkant Navathe, "Fundamentals of Database Systems" 6th Edition, 2010
I did not include the activities in the slides. I printed them out in separate papers. Then, I asked students: who liked to participate in activity 1 (the interview) in the class. I selected 2 students for the first activity (one was the interviewer and another was the guest). I did the same for the other activities.
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
4. Indexes as Access Paths
A single-level index is an auxiliary file that makes it
more efficient to search for a record in the data file.
The index is usually specified on one field of the file
(although it could be specified on several fields)
One form of an index is a file of entries <field value,
pointer to record>, which is ordered by field value
The index is called an access path on the field.
4
5. Indexes as Access Paths (cont.)
The index file usually occupies considerably less disk
blocks than the data file because its entries are much
smaller
A binary search on the index yields a pointer to the file
record
Indexes can also be characterized as dense or sparse
A dense index has an index entry for every search key value
(and hence every record) in the data file.
A sparse (or nondense) index, on the other hand, has index
entries for only some of the search values
5
6. Review
True or False
The index file usually occupies considerably more
disk blocks
A dense index has not an index entry for every
search key value
The following index represent a sparse index
index Block contains data file
6
7. Exercise
Example: Given the following data file EMPLOYEE(NAME, SSN,
ADDRESS, JOB, SAL, ... )
Suppose that:
record size R=150 bytes block size B=512 bytes r=30000
records
Then, we get:
blocking factor Bfr= B div R= 512 div 150= 3 records/block
number of file blocks b= (r/Bfr)= (30000/3)= 10000 blocks
For an index on the SSN field, assume the field size VSSN=9 bytes,
assume the record pointer size PR=7 bytes. Then:
index entry size RI=(VSSN+ PR)=(9+7)=16 bytes
index blocking factor BfrI= B div RI= 512 div 16= 32 entries/block
number of index blocks b= (r/ BfrI)= (30000/32)= 938 blocks
binary search needs log2bI= log2938= 10 block accesses
This is compared to an average linear search cost of:
(b/2)= 30000/2= 15000 block accesses
If the file records are ordered, the binary search cost would be:
log2b= log230000= 15 block accesses
7
9. Types of Single-Level Indexes
Primary Index Clustering Index Secondary Index
ordered file ordered file ordered file
a secondary means of accessing a file
Data file is ordered
on a key field
(distinct value for
each record)
Data file is ordered on a
non-key field (no distinct
value for each record)
Data file is ordered may be on
candidate key has a unique value or a
non-key with duplicate values
file content
<key field, pointer>
one index entry for
each disk block.
key field value is
the first record in
the block, which is
called the block
anchor
file content
<key field, pointer>
one index entry for each
distinct value of the field;
the index entry points to
the first data block that
contains records with that
field value
file content
<key field, pointer>
The index is an ordered file with two
fields:
1- field value.
2- it is either a block pointer or a record
pointer.
nondense (sparse)
index
nondense (sparse) index If key, dense. If non key, dense or
sparse index
9
10. Review
On the next slides, determine the type of single
level index
10
14. A Two-Level Primary Index
Dynamic Multilevel Indexes Using B-Trees and B+-Trees
14
15. Multi-Level Indexes
Because a single-level index is an ordered file, we can create
a primary index to the index itself;
In this case, the original index file is called the first-level
index and the index to the index is called the second-level
index.
We can repeat the process, creating a third, fourth, ..., top
level until all entries of the top level fit in one disk block
A multi-level index can be created for any type of first-level
index (primary, secondary, clustering) as long as the first-
level index consists of more than one disk block
15
17. Multi-Level Indexes
Such a multi-level index is a form of search tree
However, insertion and deletion of new index entries is a
severe problem because every level of the index is an
ordered file.
17
19. A Node in a Search Tree with Pointers to Subtrees
Below It
19
20. Dynamic Multilevel Indexes Using B-Trees and B+-
Trees
Most multi-level indexes use B-tree or B+-tree data
structures because of the insertion and deletion problem
This leaves space in each tree node (disk block) to allow for
new index entries
These data structures are variations of search trees that
allow efficient insertion and deletion of new search values.
In B-Tree and B+-Tree data structures, each node
corresponds to a disk block
Each node is kept between half-full and completely full
20
21. Dynamic Multilevel Indexes Using B-Trees and B+-
Trees (cont.)
An insertion into a node that is not full is quite
efficient
If a node is full the insertion causes a split into two
nodes
Splitting may propagate to other tree levels
A deletion is quite efficient if a node does not become
less than half full
If a deletion causes a node to become less than half
full, it must be merged with neighboring nodes
21
22. Difference between B-tree and B+-tree
In a B-tree, pointers to data records exist at all levels of
the tree
In a B+-tree, all pointers to data records exists at the
leaf-level nodes
A B+-tree can have less levels (or higher capacity of
search values) than the corresponding B-tree
22
Similarities between B-tree and B+-tree
All leaf nodes at the same level
Nodes contents not less than the half
23. Example
Using a B-tree index of order p = 3. Insert the
following values in the order 8, 5, 1, 7, 3, 12, 9, 6.
23
Employee id name salary department
8 Saleh 10000 1
5 Ahmed 20000 1
1 Jasem 30000 2
7 Nader 15000 2
3 Saleh 13000 3
12 Waleed 8000 3
9 Salim 11000 4
6 Raed 8000 5
26. Example
Using a B+-tree index of order p = 3, pleaf=2.
Insert the following values in the order 8, 5, 1, 7, 3, 12,
9, 6.
26
Employee
id
name salary departme
nt
8 Saleh 10000 1
5 Ahmed 20000 1
1 Jasem 30000 2
7 Nader 15000 2
3 Saleh 13000 3
12 Waleed 8000 3
9 Salim 11000 4
6 Raed 8000 5