
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

2003 Course Advanced Database Management

7 pages, 45 questions, 0 questions with responses, 0 total responses,

	pune_eng	+Fave Message
	Profile Timeline Uploads Q & A

Home > pune_eng >

Formatting page ...

Total No. of Questions : 12] P1319 [Total No. of Pages : 7 [3864]-417 B.E. (IT) ADVANCED DATABASE MANAGEMENT (2003 Course) (414442) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates : 1) Answers to the two sections should be written in separate books. 2) Neat diagrams must be drawn wherever necessary. 3) Assume suitable data, if necessary. 4) Section I : Q. 1 or Q. 2, Q. 3 or Q. 4, Q. 5 or Q. 6. 5) Section II : Q. 7 or Q. 8, Q. 9 or Q. 10, Q. 11 or Q. 12. SECTION - I Q1) a) b) Explain Parallel Hash Join with suitable example. [6] Histogram are used for constructing load balanced range partition. [6] i) ii) c) Suppose a histogram where values are between 1 and 100, and are partitioned into 10 ranges, 1-10, 11-20, ........, 91-100, with frequencies 15, 5, 20, 10, 10, 5, 5, 20, 5 and 5, respectively. Express a load balanced range partitioning function to divide the values into 5 partition. Write an algorithm for computing a balanced range partition with p partitions, given a histogram of frequency distributions containing n ranges. Explain a nonuniform memory architecture (NUMA). [5] OR Q2) a) Describe interoperation parallelism, left-deep trees versus bushy trees, and query cost estimation. [6] P.T.O.

Formatting page ...

Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers

pune_eng chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: