edited by
863 views

2 Answers

1 votes
1 votes

Answer : Indexing

Indexing is a data structure technique to efficiently retrieve records from the database files based on some attributes on which the indexing has been done.

0 votes
0 votes

Hash addressing is open addressing, which is a collision resolution technique.

Chaining is also a collision resolution technique which employees linked list.

Indexing is a file organization technique mostly used in Databases (primary and secondary indexing). Indexing uses B-Tree or B+-Tree.

Hence, option D is the correct option.

Related questions

0 votes
0 votes
2 answers
1
go_editor asked Mar 26, 2020
1,028 views
What item is at the root after the following sequence of insertions into an empty splay tree :$1, 11, 3, 10, 8, 4, 6, 5, 7, 9, 2, ?$$1$$2$$4$$8$
1 votes
1 votes
3 answers
2
go_editor asked Mar 26, 2020
1,581 views
Suppose we are implementing quadratic probing with a Hash function, Hash $(y)=X$ mode $100$. If an element with key $4594$ is inserted and the first three locations attem...
1 votes
1 votes
1 answer
3
go_editor asked Mar 26, 2020
1,287 views
What operation is supported in constant time by the doubly linked list, but not by the singly linked list ?AdvanceBackupFirstRetrieve
0 votes
0 votes
2 answers
4
go_editor asked Mar 27, 2020
3,764 views
Code optimization is responsibility of :Application programmerSystem programmerOperating systemAll of the above