Total No. of Questions : 12] [Total No. of Pages : 3 Ei [3564]-338 B.E. (Computer Engineering) ADVANCED DATABASES (2003 Course) Time : 3 Hours} ‘Max. Marks : 100 Instructions to the candidates: 1) Answers to the two sections should be written in separate answer books. 2) Neat diagrams must be drawn wherever necessary. 3) Figures to the right indicate full marks. « 4) Assume suitable data, if necessary. SECTION - 1 Q1) a) Explain in detail intraoperation and interoperation parallelism. [8] b) What is skew in parallel databases? Explain handling of skew. [8] OR Q2) a) Explain how following operations can be parallelized using data partitioning, [8] i) Scanning. ii) Sorting. iii) Join. b) Describe and differentiate the following partitioning techniques. [8] i) Hash partitioning, ii) Range partitioning, Explain the following with respect to distributed databases. [10) i) Availability. ii) Deadlock handling. Write short notes on : [8] i) LDAP. ii) Location transparency. 03) aj b. OR Q4) a) Explain with respect to distributed databases Locking protocols and Timestamping. [oy PLO.Q5) 06) Q7) Q8) 9) b) a) b) a) b a) b a) b) a) b c) Q10) a) {3864]-338. b c) Write short notes on : 18] i) Replication transparency. ii) Distributed data storage. Explain in detail XML document. [8] Explain following terms [8] i) Soap. ii) XMLDTD. iii) XQuery. OR Explain in detail different tiers in 3-tier architecture. [8] Explain following terms [8] i) Thinclient. ii) Thick client. iii) Xpath. SECTION - 11 Explain showflake schema for the multidimensional databases in detail. [8] Explain the following in brief. [8] i) OLAP. ii) Data Smoothing techniques. OR Explain star schema for the multidimensional databases in detail. [8] Explain the following in brief. [8] i) Data Cube ii) Materialized view. Explain “Apriori Algorithm” for association rulessin detail. 18] Write short note: Text Mining. 15] Explain Decision tree. 15] oR Explain “K-means Algorithm” for clustering in detail. {8] Explain supervised and unsupervised clustering. 15] Write short note : Outlier analysis. 15]O11) a) b Q12) a) b [3564]-338 Explain Page ranking in detail. Explain the following terms i) Synonyms, ii) Homonyms. iil) Ontologies. iv) Hyperlinks. OR Explain the following terms. i) Signature files. ii) Web crawlers. iil) Information Extraction. iv) Inverted index. Explain in detail popularity ranking. RK [8] [8] [8] 18]