1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
aleksley [76]
3 years ago
12

Suppose you have a file of data of approximately 100,000 personnel records (FYI, 213 = 8192 and 214 = 16384) using Social Securi

ty numbers as primary key. You expect to mostly access individual records so you want that to be fast, but you expect to also access the entire file in sorted order reasonably often. You have decided to use an indexed sequential file structure or an order 5 B-Tree. Give 3 reasons why an Indexed sequential search structure is better. Then give three reasons that an order 5 B-tree is better. What additional information do you need to choose between them?
Computers and Technology
1 answer:
Natali [406]3 years ago
8 0

Answer:

See explaination

Explanation:

The reasons why indexed sequential search structure is better are:

1. In index sequential search any field of the records can be used as the key. This key field can be numerical or alphanumerical.

2. Since each record has its data block address, searching for a record in larger database is easy and quick. There is no extra effort to search records. But proper primary key has to be selected to make efficient.

3. This method gives flexibility of using any column as key field and index will be generated based on that. In addition to the primary key and its index, we can have index generated for other fields too. Hence searching becomes more efficient, if there is search based on columns other than primary key.

The reasons why 5 B-tree is better:

1.The B-tree Provides support for range of queries in an efficient manner and You can iterate over an ordered list of elements.

2. B-Tree algorithms are good for accessing pages (or blocks) of stored information which are then copied into main memory for processing. In the worst case, they are designed to do dynamic set operations in O(lg n) time because of their high "branching factor" (think hundreds or thousands of keys off of any node). It is this branching factor that makes B-Trees so efficient for block storage/retrieval, since a large branching factor greatly reduces the height of the tree and thus the number of disk accesses needed to find any key.

3. It is a generalization of a BST in that a node can have more than two children. These are self-balancing and hence the average and worst complexities is logarithmic. We opt for these when the data is too huge to fit in main memory. These structures are used in database indexing and help in faster operations on disk

the additional informations is we should first decide to choose which structure is suiatable for which algoritm in terms of space and time and then use the appropriate search algorithm.

You might be interested in
Create a view named MAJOR CUSTOMER. It consists of the customer number, name, bal. ance, credit limit, and rep number for every
Step2247 [10]

Answer:

Following are the solution to the given point:

Explanation:

The solution to this question is defined in the attached in the attached file.

5 0
3 years ago
Consider the LIBRARY relational database schema description provided below which is used to keep track of books, borrowers, and
sdas [7]

Answer:

1) Yes, Publisher relation should have a publisherID primary key.

2) NOT NULL and UNIQUE for the BookID, BranchID, CardNumber and name of the borrower in the Book, Book_Copies, Library_branch, and Borrower relations respectively. The DueDate field of the book_loan relation must be a time constraint. The BookID of the Book relation must be serial number for automatic addition and update of bookid across the database.

Explanation:

The Publisher relation should have primary key publisherID which should replace the publisherName in the Book relation to easily make a join query and attain a third-level database model.

8 0
3 years ago
Suppose you have two tables: officer and gentleman. what question(s) can be asked by using the union operator?
Alik [6]
The union of two tables is basically the total of the two tables, so "or" questions would be my guess.
8 0
3 years ago
What is radial gradient in Flash CS3
djverab [1.8K]

Answer:

Radial gradients radiate from a center focal point. Both can be edited for color, alpha, and position within a fill or stroke. You can add up to 16 colors to a gradient, precisely control the location of the gradient focal point, and apply other parameters. A gradient behaves like any other fill or stroke.

8 0
3 years ago
Complete this truth Table. Write a program that you can enter from the keyboard, a 1 or 0 into three Boolean variables, A,B,C. W
SSSSS [86.1K]

Answer:

Following are the code to this question:

#include<stdio.h>//defining header file

int AND(int x,int y) //defining a method AND that hold two variable in its parameter

{

if(x==1 && y==1)//defining if block to check x and y value is equal to 1

{

return 1;//return value 1

}

else //defining else block

{

   return 0;//return value 0

}

}

int OR(int x,int y)//defining method OR that hold two variable in its parameter

{

if(x==0&&y==0)//defining if block to check x and y value is equal to 1

{

return 0;//return value 0

}

else //defining else block

{

   return 1;//return value 1

}

}

int main()//defining main method

{

int a,b,c;//defining integer variable  

int k=1;//defining integer variable k that holds a value 1

while(k<=8)//defining while loop for 8 time input

{

printf("Please insert 3 numbers in (0 0r 1):\n ");//print message

scanf("%d%d%d", &a, &b, &c);//input value

k++;//increment the value of k by 1

printf("value: %d\n",AND(OR(a,b),c));

}

return 0;

}

Output:

please find the attachment.

Explanation:

In the above-given C language code two methods "AND and OR" is declared, holds two integer variable "x and y" in its parameters, inside the method a conditional it used that can be defined as follows:

  • In the AND method, inside a conditional statement, if block check x and y both value is same that is 1 it will return 1 or it will goto else block in this it will return value 0.      
  • In the OR method, inside a conditional statement, if block check x and y both value is the same, that is 0 it will return 0 or it will goto else block in this it will return value 1.
  • In the main method, four integers "a,b,c, and k" is declared in which variable "a, b, c" is used in the loop for 8 times input values from the user and print method is used to call the method and prints its return values.

8 0
3 years ago
Other questions:
  • Janice has a "jammed" key on her keyboard. Every time she strikes the "S" key it sticks and doesn't pop back. What should Janice
    6·2 answers
  • What's a qat on a computer
    12·2 answers
  • what properties are associated with all Microsoft Office files and include author, title, and subject
    5·1 answer
  • Which is most harmful computer virus define​
    15·1 answer
  • Individuals who require better speed and performance for graphics-intensive applications (e.g., video editing, gaming, etc.) pre
    8·1 answer
  • 2. (8 points) When creating the Academic Database, there were several instances of data
    11·1 answer
  • What is the different between ethical and legal issues?​
    6·1 answer
  • In what year did the manager and team depicted in the blockbuster film "Moneyball
    9·1 answer
  • On the Format tab, which group allows you to select a different font for a chart?
    7·2 answers
  • Do you think communities or countries can survive without the internet?why or why not?​
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!