Show simple item record

dc.contributor.authorBhasker, Bharaten_US
dc.date.accessioned2014-03-14T21:19:10Z
dc.date.available2014-03-14T21:19:10Z
dc.date.issued1992-06-06en_US
dc.identifier.otheretd-09202005-091021en_US
dc.identifier.urihttp://hdl.handle.net/10919/39437
dc.description.abstractThe goal of this work is to present an advanced query processing algorithm formulated and developed in support of heterogeneous distributed database management systems. Heterogeneous distributed database management systems view the integrated data through an uniform global schema. The query processing algorithm described here produces an inexpensive strategy for a query expressed over the global schema. The research addresses the following aspects of query processing: (1) Formulation of a low level query language to express the fundamental heterogeneous database operations; (2) Translation of the query expressed over the global schema to an equivalent query expressed over a conceptual schema; (3) An estimation methodology to derive the intermediate result sizes of the database operations; (4) A query decomposition algorithm to generate an efficient sequence of the basic database operations to answer the query. This research addressed the first issue by developing an algebraic query language called cluster algebra. The cluster algebra consists of the following operations: (a) Selection, union, intersection and difference, which are extensions of their relational algebraic counterparts to heterogeneous databases; (b) Normal-join and normal-projection which replace their counterparts, join and projection, in the relational algebra; (c) Two new operators embed and unembed to restructure the database schema. The second issue of the query translation was addressed by development of an algorithm that translates a cluster algebra query expressed over the virtual views to an equivalent cluster algebra query expressed over the conceptual databases. A non-parametric estimation methodology to estimate the result size of a cluster algebra operation was developed to address the third issue described above. Finally, this research developed a query decomposition algorithm, applicable to the relational and non-relational databases, that decomposes a query by computing all profitable semi-join operations, followed by the determination of the best sequence of join operations per processing site. The join optimization is performed by formulating a zero-one integer linear program that uses the non-parametric estimation technique to compute the sizes of intermediate results. The query processing algorithm was implemented in the context of DAVID, a heterogeneous distributed database management system.en_US
dc.format.mediumBTDen_US
dc.publisherVirginia Techen_US
dc.relation.haspartLD5655.V856_1992.B424.pdfen_US
dc.subjectDistributed databasesen_US
dc.subjectDatabase management.en_US
dc.subject.lccLD5655.V856 1992.B424en_US
dc.titleQuery processing in heterogeneous distributed database management systemsen_US
dc.typeDissertationen_US
dc.contributor.departmentComputer Scienceen_US
dc.description.degreePh. D.en_US
thesis.degree.namePh. D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen_US
thesis.degree.disciplineComputer Scienceen_US
dc.contributor.committeechairEgyhazy, Csaba J.en_US
dc.contributor.committeememberHaddad, Emileen_US
dc.contributor.committeememberTriantis, Konstantinos P.en_US
dc.contributor.committeememberHartson, H. Rexen_US
dc.contributor.committeememberRicci, Fred J.en_US
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-09202005-091021/en_US
dc.date.sdate2005-09-20en_US
dc.date.rdate2005-09-20
dc.date.adate2005-09-20en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record