search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.

Recent questions tagged indexing

0 votes
0 answers 8 views
Consider the following (incomplete) schedule S: T1:R(X), T1:R(Y), T1:W(X), T2:R(Y), T3:W(Y), T1:W(X), T2:R(Y) If all three transactions eventually commit, show the serializability graph.
asked Jun 3 in Databases Lekhraj 9 points 8 views
0 votes
0 answers 8 views
Lets suppose, we define a schema with no primary key but there is an attribute(s) with unique and not null constraints. Now default indexing i.e primary indexing is not possible here because of no primary key. Now, at the time of Database design, If i write ... is it necessary to input records in sorted order? or is there any other way possible to apply clustering index over a given database file?
asked May 30 in Databases bhardwaj.aakash_420 5 points 8 views
0 votes
0 answers 21 views
https://csedoubts.gateoverflow.in/?qa=blob&qa_blobid=12844912915578520272
asked May 21, 2020 in Databases Rajeev-Dubey 5 points 21 views
0 votes
1 answer 38 views
Can any one give an example of clustered vs non clustered index ?
asked May 3, 2020 in Databases Shivateja MST 45 points 38 views
0 votes
1 answer 12 views
Consider a file of $16384$ records. Each record is $32$ $bytes$ long and its key field is of size $6$ $bytes$. The file is ordered on a non-key field, and the file organization is unspanned. The file is stored in a file system with block size $1024$ $bytes$, and the size of ... and second-level blocks in the multi-level index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
asked Apr 18, 2020 in Databases admin 573 points 12 views
0 votes
0 answers 11 views
A clustering index is defined on the fields which are of type non-key and ordering non-key and non-ordering key and ordering key and non-ordering
asked Apr 18, 2020 in Databases admin 573 points 11 views
0 votes
0 answers 12 views
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Than that index is called Dense Sparse Clustered Unclustered
asked Apr 18, 2020 in Databases admin 573 points 12 views
0 votes
0 answers 16 views
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on the size of the blocks, and the size of the address of the blocks. the number of blocks used for the index, and the size of the blocks. the size of the blocks, the number of blocks used for the index, and the size of the address of the blocks. None of the above
asked Apr 18, 2020 in Databases admin 573 points 16 views
0 votes
0 answers 13 views
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index
asked Apr 18, 2020 in Databases admin 573 points 13 views
0 votes
0 answers 24 views
There are five records in a database. ... associated with this and it contains the values $1, 3, 2, 5$ and $4$. Which one of the fields is the index built from? Age Name Occupation Category
asked Apr 18, 2020 in Databases admin 573 points 24 views
0 votes
0 answers 13 views
Consider a relational table $r$ with sufficient number of records, having attributes $A_1, A_2, \dots ,A_n$ and let $1 \leq p \leq n$. Two queries $Q1$ and $Q2$ are given below. $Q1: \pi_{A_1, \dots ,A_p} \left(\sigma_{A_p=c}\left(r\right)\right)$ ... for both queries Hashing will outperform ordered indexing on $Q1$, but not on $Q2$ Hashing will outperform ordered indexing on $Q2$, but not on $Q1$
asked Apr 18, 2020 in Databases admin 573 points 13 views
0 votes
0 answers 13 views
An $\text{ISAM}$ (indexed sequential) file consists of records of size $64$ $bytes$ each, including key field of size $14$ $bytes$. An address of a disk block takes $2$ $bytes$. If the disk block size is $512$ $bytes$ and there are $16$ $K$ records, compute the size of the data and index areas in terms of number blocks. How many levels of $\text{tree}$ do you have for the index?
asked Apr 18, 2020 in Databases admin 573 points 13 views
0 votes
0 answers 15 views
One giga bytes of data are to be organized as an indexed-sequential file with a uniform blocking factor 8. Assuming a block size of 1 Kilo bytes and a block refrencing pointer size of $32$ bits, find out the number of levels of indexing that would be required ... also the size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
asked Apr 18, 2020 in Databases admin 573 points 15 views
0 votes
0 answers 15 views
Provide short answers to the following questions: For secondary key processing which of the following file organizations is preferred? Give a one line justification: Indexed sequential file organization. Two-way linked list. Inverted file organization. Sequential file organization.
asked Apr 18, 2020 in Databases admin 573 points 15 views
0 votes
0 answers 53 views
Is there any difference between Primary and Clustered Indexing ? Acccording to Korth they are same but in various sources ( youtube videos, gateoverflow answers ) they are mentioned to be different.
asked Jan 12, 2020 in Databases mehulshankhapal 5 points 53 views
0 votes
0 answers 21 views
Can anyone tell how the answer is 10 thank you
asked Dec 10, 2019 in Databases Pratyush Priyam Kuan 1.1k points 21 views
0 votes
1 answer 130 views
Consider a disk with block size 1024B. A block pointer is 6 B long. A file has 30000 employee record of fixed length and each record has 100B. Assume that an unspanned organization is used.to store records. and key SSN takes 9B.Suppose that the file is ordered by key SSN and we ... have done $\frac{3000}{15}=200$ and then $\log200=8$ , as it is primary indexing. But they gave only 3000 But why?
asked Dec 4, 2019 in Databases srestha 1k points 130 views
0 votes
1 answer 26 views
Secondary index over non key can be Dense or Nondense $\checkmark$ Look for this image You will observe Dense view. My doubt: At what situation we might get Nondense ?
asked Nov 23, 2019 in Databases KUSHAGRA गुप्ता 1.4k points 26 views
0 votes
0 answers 178 views
Consider the following statements S1 : allows rapid random access as well as rapid sequential access. S2 : When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. S3: When a key is deleted from the leaf, it is also deleted from the ... in $S_{1}$, For $S_{3}$ they have given it as false. How? It should be true acc. to me & $S_{4}$)
asked Oct 22, 2019 in Databases KUSHAGRA गुप्ता 1.4k points 178 views
0 votes
0 answers 59 views
Consider the database EMPLOYEE and file parameters given below EMPLOYEE field and sizes 4 B Suppose that the file is not ordered by the key field and we want to construct a access structure (index) on . Let P be the branch-node order, and be the leaf-node order, of the tree. What will be ... I use the First one or second one? (P-1)(Key+$R_{p}$)+6B$\leqslant$512B P(Key+$R_{p}$)+6B$\leqslant$512B
asked Oct 22, 2019 in Databases KUSHAGRA गुप्ता 1.4k points 59 views
0 votes
1 answer 111 views
Given the memory can hold 5 blocks at a time. Also, it is known that size of data is 64MB and size of each block is 1 MB. How many merge passes are required to sort the whole data in external merge-sort, after the initial sort pass, when sorted runs have already ... & if anyone having any idea how to solve, do tell. Even I can provide you the answer for some help that I am unable to understand)
asked Oct 21, 2019 in Databases KUSHAGRA गुप्ता 1.4k points 111 views
0 votes
0 answers 118 views
Calculate branching factor in case for B- tree index structure, given: page size: 16 kB, key-size: 16 bytes, pointer size = 8 bytes ? 255 256 510 511 (Note: The answer I am getting is 512 but the given answer is 511. Is my answer correct & if not please tell the approach.)
asked Oct 21, 2019 in Databases KUSHAGRA गुप्ता 1.4k points 118 views
0 votes
0 answers 21 views
please explain the meaning of this paragraph.
asked Sep 8, 2019 in Databases kshitij -3 points 21 views
0 votes
0 answers 30 views
For the below question, https://gateoverflow.in/285557/madeeasy-test-series-databases-b-tree Can anyone explain option B and option D ? I mean what they actually mean to say ?
asked Aug 23, 2019 in Databases user2525 2.4k points 30 views
0 votes
0 answers 18 views
This image is from NAVATHE book. for seconadry Index(in case of CK field) we can use sparse indexing as we do for PK, because every CK value is unique & it can uniquely identify each tuple. then what stops us from doing sparse indexing incase of CK field??? why NON-key row is Dense or Nondense in the image ??? for non-key we should always use dense indexing, isn’t it???
asked Jul 29, 2019 in Databases mrinmoyh 23 points 18 views
To see more, click for the full list of questions or popular tags.
...