Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/9236
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChakravarty, Gautam-
dc.date.accessioned2014-11-19T05:17:48Z-
dc.date.available2014-11-19T05:17:48Z-
dc.date.issued1992-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/9236-
dc.guideSarje, A. K.-
dc.description.abstractTo study different aspects of distributed database systems a. prototype for such a system has been designed and successfully implemented. The system is capable of supporting a collection, of non-replicated distributed databases spread over a number of computers. It permits fragmentation and location transparency and data in any node can be accessed by submitting queries in a subset of the relational query language SQL. The lexical analyzer and parser for the language have been developed using the utilities Lex and Yacc. The SQL interface, transaction manager and noda.l data manager are the main modules of the system that co-operate to execute a. query. Algorithms 'for converting a.• global, query to subquery messages and integrating the result of these subqueries to execute the global query have been developed and implemented. All c,ammunica.tion between transaction managers and nodal data man'agers is by message passing using message queues and stream socket facilities available in UNIX,. The system has been developed using the C language on HP9000 computer systemsen_US
dc.language.isoenen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.subjectANON-REPLICATED DISTRIBUTED DATABASE SYSTEMen_US
dc.subjectLEXICAL ANALYZERen_US
dc.subjectHP9000 COMPUTER SYSTEMSen_US
dc.titleDESIGN & IMPLEMENTATION OF A PROTOTYPE FOR ANON-REPLICATED DISTRIBUTED DATABASE SYSTEMen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number245568en_US
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECD245568.pdf2.74 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.