menu
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

Subjects

Recent questions tagged indexing

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged indexing

0 votes
0 answers
1
databases
This index is a dense index ...right ...???
This index is a dense index ...right ...???
asked Apr 26, 2017 in Databases vignesh 156 views
2 votes
0 answers
2
databases
State TRUE or FALSE. "In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1". Please support your answer with explanations ...
State TRUE or FALSE. "In Indexing,the number of ordering field (field based on which records in data file and its corresponding index file are sorted) should always be 1". Please support your answer with explanations ...
asked Apr 26, 2017 in Databases vignesh 173 views
0 votes
0 answers
3
ISI-JRF
Two queries equivalent to each other are specified for a relation R(A, B, C, D, E, F). The queries are: πA,B,C(σB>500(R)) σB>500(πA,B,C(R)) The system maintains a B+ tree index for (A, B, C) on R. However, ... the two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.
Two queries equivalent to each other are specified for a relation R(A, B, C, D, E, F). The queries are: πA,B,C(σB>500(R)) σB>500(πA,B,C(R)) The system maintains a B+ tree index for (A, B, C) on R. However, the index is ... of the two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.
asked Apr 19, 2017 in Databases kauray 233 views
2 votes
2 answers
4
MADE EASY TEST SERIES
Assume that search key size is 90% of the record size within a file(records are fixed length records). Pointer makes up only 10% of the record size. Based on the above assumptions which of the following statements is true? a. Index block factor > ... Index block factor c. Database file block factor = (Index block factor)/2 d. Database file block factor = Index block factor
Assume that search key size is 90% of the record size within a file(records are fixed length records). Pointer makes up only 10% of the record size. Based on the above assumptions which of the following statements is true? a. Index block factor >> Database file block ... >> Index block factor c. Database file block factor = (Index block factor)/2 d. Database file block factor = Index block factor
asked Jan 26, 2017 in Databases pranjalgennext 243 views
2 votes
1 answer
5
TestBook Test Series
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is (m-1)h-1 (m-1)h-1+1 Mh-1 Mh+1+1
Let T be a B-tree of order m and height h. if n is the number of key elements in T then the maximum value of n is (m-1)h-1 (m-1)h-1+1 Mh-1 Mh+1+1
asked Jan 14, 2017 in Databases vnc 422 views
2 votes
1 answer
6
Virtual Gate Test Series: Databases - Indexing
Consider a relation company with $3000$ records are of fixed length, with record size $50$ bytes are stored in block of size $512$ bytes $\text{(unspanned).}$ If a secondary index is built on the key field of size $10$ bytes and a block pointer of size $5$ bytes, the number of first level index blocks are_____$?$
Consider a relation company with $3000$ records are of fixed length, with record size $50$ bytes are stored in block of size $512$ bytes $\text{(unspanned).}$ If a secondary index is built on the key field of size $10$ bytes and a block pointer of size $5$ bytes, the number of first level index blocks are_____$?$
asked Jan 9, 2017 in Databases Purple 239 views
0 votes
1 answer
7
Indexing
What is the difference between different types of indices: 1. Clustered Index 2. Unclustered Index 3. Dense Index 4. Sparse Index
What is the difference between different types of indices: 1. Clustered Index 2. Unclustered Index 3. Dense Index 4. Sparse Index
asked Dec 27, 2016 in Databases pranjalgennext 309 views
–1 vote
0 answers
8
Test series
asked Dec 23, 2016 in Databases shefaligups11 Gups 95 views
2 votes
1 answer
9
MadeEasy Test Series: Databases - Indexing
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is called a. Dense b. Sparse c. CLustered d. Unclustered
A file is organized so that the ordering of data record is same as or close to the ordering of data block in some index. The that index is called a. Dense b. Sparse c. CLustered d. Unclustered
asked Dec 12, 2016 in Databases Akanksha Kesarwani 245 views
1 vote
2 answers
10
Ace Test Series: Databases - B Tree
asked Dec 2, 2016 in Databases chaser 402 views
4 votes
2 answers
11
GATE1989-4-xiv
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.
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 Dec 1, 2016 in Databases makhdoom ghaya 2.7k views
11 votes
1 answer
12
B-tree/B+tree
1)Consider a B+ Tree of order 4 and height 3, then find a)The maximum number of records stored are ........... b)The maximum number of keys ........... c)The minimum number of records stored are ............ d)The minimum ... maximum number of keys ? 3) Find the following with order 3 and height 3 in B-tree Minimum and maximum number of keys ? Please provide detailed explanation
1)Consider a B+ Tree of order 4 and height 3, then find a)The maximum number of records stored are ........... b)The maximum number of keys ........... c)The minimum number of records stored are ............ d)The minimum number of keys ... and maximum number of keys ? 3) Find the following with order 3 and height 3 in B-tree Minimum and maximum number of keys ? Please provide detailed explanation
asked Nov 30, 2016 in Databases Prabhanjan_1 4.7k views
15 votes
4 answers
13
GATE1990-10b
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 ... the size of the master index. The referencing capability (fanout ratio) per block of index storage may be considered to be $32$.
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 Nov 24, 2016 in Databases makhdoom ghaya 2.7k views
1 vote
0 answers
14
Doubt on primary indexing and clustred index.
I have read this. - Clustered index are those in which data is arranged on fields so that it act as an index. like the phonebook. And in non-clustered index we make a new index outside and data and indexes are at different places ... a clustred index then what is clustred index that states that make a entry for unique keys only. Are they both the same?
I have read this. - Clustered index are those in which data is arranged on fields so that it act as an index. like the phonebook. And in non-clustered index we make a new index outside and data and indexes are at different places like book index at the back. ... primary index is a clustred index then what is clustred index that states that make a entry for unique keys only. Are they both the same?
asked Nov 24, 2016 in Databases Tendua 395 views
5 votes
1 answer
15
Number of blocks at different levels of database indexes
Consider a file of 8192 records. Each record is 16 bytes long and its key field is of size 6 bytes. The file is ordered on a key field, and the file organization is unspanned. The file is stored in a file system with block size 512 bytes, ... blocks in the multilevel index are respectively a. 8 and 1 b. 16 and 1 c. 8 and 2 d. None of these
Consider a file of 8192 records. Each record is 16 bytes long and its key field is of size 6 bytes. The file is ordered on a key field, and the file organization is unspanned. The file is stored in a file system with block size 512 bytes, and the size of a block porinte is ... level and second level blocks in the multilevel index are respectively a. 8 and 1 b. 16 and 1 c. 8 and 2 d. None of these
asked Oct 30, 2016 in Databases GateAspirant999 1.2k views
6 votes
1 answer
16
Basic doubt in B+ Tree Indexing
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..
asked Oct 19, 2016 in Databases Habibkhan 564 views
4 votes
2 answers
17
B+ Tree insertion
I think it would be 7..please check
I think it would be 7..please check
asked Oct 19, 2016 in Databases KISHALAY DAS 871 views
5 votes
2 answers
18
database-indexing-2
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
Maximum number of clustered indices one can build for a table with n attributes, which already has a primary index?
asked Sep 21, 2016 in Databases resilientknight 279 views
5 votes
1 answer
19
database-indexing
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
How many different secondary indices are possible for a table with n attributes(Not necessarily at the same time)?
asked Sep 21, 2016 in Databases resilientknight 389 views
1 vote
2 answers
20
databases-query
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
A clustered index is typicallly less expensive to maintain than unclustered index. True or False.
asked Sep 17, 2016 in Databases resilientknight 349 views
1 vote
1 answer
21
Indexing problem
Consider the following relations. Emp(eid:integer,ename:varchar,sal:integer,age:integer,did:integer) Dept(did:integer,budget:integer,floor:integer,mgr_eid:integer) Salaries ranges from 10000 to 100000 ages vary from 20 to 80, each department has about five employees ... Clustered B+ tree index on the budge field of Dept I feel in first paragraph what all important is Dept table.
Consider the following relations. Emp(eid:integer,ename:varchar,sal:integer,age:integer,did:integer) Dept(did:integer,budget:integer,floor:integer,mgr_eid:integer) Salaries ranges from 10000 to 100000 ages vary from 20 to 80, each department has about five employees on average, ... (D) Clustered B+ tree index on the budge field of Dept I feel in first paragraph what all important is Dept table.
asked Sep 15, 2016 in Databases GateAspirant999 293 views
3 votes
1 answer
22
Ace Page#39, Q# 20
What is the answer of 2nd Question ??
What is the answer of 2nd Question ??
asked Aug 16, 2016 in Databases Payal Rastogi 327 views
4 votes
1 answer
23
Indexing
If one block access time is 30ms,then what is the access time for 100 blocks index if we use binary search?
If one block access time is 30ms,then what is the access time for 100 blocks index if we use binary search?
asked Aug 2, 2016 in Databases sumedha 482 views
3 votes
3 answers
24
UGCNET-June2014-II: 48
A clustering index is created when _______. Primary key is declared and ordered No key ordered Foreign key ordered There is no key and no order
A clustering index is created when _______. Primary key is declared and ordered No key ordered Foreign key ordered There is no key and no order
asked Jul 1, 2016 in Databases makhdoom ghaya 2.3k views
1 vote
0 answers
25
ISI2014-PCB-CS-6a
Two queries equivalent to each other are specified for a relation $R(A, B, C, D, E, F)$. The queries are: $\pi_{A,B,C}(\sigma B>500(R))$ $\sigma B>500(\pi_{A,B,C}(R))$ The system maintains a $B+$ tree index ... two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.
Two queries equivalent to each other are specified for a relation $R(A, B, C, D, E, F)$. The queries are: $\pi_{A,B,C}(\sigma B>500(R))$ $\sigma B>500(\pi_{A,B,C}(R))$ The system maintains a $B+$ ... of the two queries will be preferred by the query optimizer for minimum cost of execution. The cost of query execution is primarily dependent on the number of disk accesses.
asked May 31, 2016 in Databases jothee 263 views
1 vote
1 answer
26
DBMS: Indexing Question
A file is organized so that the odering of data record is same as or close to the odering of data block in some index. Then that index is called Dense Sparse Clustered Unclustered Solution given: (b) • In sparse index number of ... In dense index number of entries depends on number of data record in previous level. Link: https://gateoverflow.in/8222/gate2015-1_24
A file is organized so that the odering of data record is same as or close to the odering of data block in some index. Then that index is called Dense Sparse Clustered Unclustered Solution given: (b) • In sparse index number of entries depends on number ... ; In dense index number of entries depends on number of data record in previous level. Link: https://gateoverflow.in/8222/gate2015-1_24
asked Jan 15, 2016 in Databases Prasanna 1.5k views
1 vote
1 answer
28
Indexing
asked Jan 8, 2016 in Databases bahirNaik 657 views
4 votes
1 answer
29
Indexing (Find no. of Blocks)
asked Jan 2, 2016 in Databases Himanshu1 1.3k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...