Unfolding of Conjunctive Queries Using Context Free Grammar for Parsing

MIST Central Library Repository

Show simple item record

dc.contributor.author Showjal, Kona Rani
dc.contributor.author Naima, Jannathun
dc.contributor.author Toj Johora, Fatama
dc.date.accessioned 2015-06-28T06:28:57Z
dc.date.available 2015-06-28T06:28:57Z
dc.date.issued 2014-12
dc.identifier.uri http://hdl.handle.net/123456789/110
dc.description We are thankful to Almighty Allah for his blessings for the successful completion of our thesis. Ourheartiestgratitude,profoundindebtednessanddeeprespectgotooursupervisor, Dr.MuhammadMasroorAli,Professor,DepartmentofComputerScienceandEngineering, Bangladesh University of Engineering and Technology, Dhaka-1205, Bangladesh, for his constant supervision, affectionate guidance and great encouragement and motivation. His keen interest on the topic and valuable advices throughout the study was of great help in completing thesis. We are especially grateful to the Department of Computer Science and Engineering (CSE) of Military Institute of Science and Technology (MIST) for providing their all out support during the thesis work. Finally, we would like to thank our families and our course mates for their appreciable assistance, patience and suggestions during the course of our thesis. en_US
dc.description.abstract There are two different notations for queries over relational databases throughout the thesis. The first is SQL, which is the language used to query relational data in commercial relational systems. SQL is a very complex language. For our discussion, we typically used only its most basic features such as selecting specific rows from a table, selecting specific columns from a table, combining data from multiple tables usingthejoinoperator,takingtheunionoftwotablesandcomputingbasicaggregation functions. Secondly, we used the notation of Conjunctive Queries, which is based on mathematical logic. Lexical analysis is the extraction of individual words or lexemes from an input stream of symbols and passing corresponding tokens back to the parser. If we consider a statement in a programming language, we need to be able to recognize the small syntactic units (tokens) and pass this information to the Yacc generator. We need to also store the various attributes in the symbol or literal tables for later use, e.g., if we have an variable, the tokenizer would generate the token var and then associate the name of the variable with it in the symbol table. In this case, the variable name is the lexeme. The tokenization process takes input and then passes this input through a keywordrecognizer,anidentifierrecognizer,anumericconstantrecognizerandastring constant recognizer, each being put in to their own output based on disambiguating rules. Our goal was to unfold Conjunctive Queries. We successfully implemented our production rules and tokenization process. The rest of our task is to implement unfolding Conjunctive Queries with C language and merge with Yacc generator. So, we are hopeful that we will be able to unfold Conjunctive Queries in future. en_US
dc.description.sponsorship Department of Computer Science and Engineering, Military Institute of Science and Technology en_US
dc.language.iso en en_US
dc.publisher Department of Computer Science and Engineering, Military Institute of Science and Technology en_US
dc.relation.ispartofseries B.Sc. in Computer Science and Engineering Thesis;
dc.subject Unfolding, Conjunctive, Queries, Context, Grammar, Parsing en_US
dc.title Unfolding of Conjunctive Queries Using Context Free Grammar for Parsing en_US
dc.type Thesis en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account