<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>01451nam a22001337a 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">56172</subfield>
    <subfield code="d">56169</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Khanzada, Taooz Javed </subfield>
    <subfield code="a">14MSIT21</subfield>
    <subfield code="a">Supervisor Dr. Muhammad Saleem Vighio</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Automated Tool For Query Normalization &amp; Elimination Of Redound Ancy   </subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Nawabshah:</subfield>
    <subfield code="b">QUEST,</subfield>
    <subfield code="c">2016.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">43P, :</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">ABSTRACT


Redundancy and complexity have adversely ineradicable effects on performance of the database management system (DBMS), during the execution of queries. DBMS software takes more time as compared to normal processing of queries, when queries are complex and contain redundancy. To respond the user more quickly, there is need to execute queries more efficiently i.e., the queries that take less time to execute and consume less resources. Therefore we have suggested a new technique that before to take on execution process, queries should be normalized or simplified and must remove redundancy and complexity from query, then DBMS should perform whole execution process. Our research presents a tool in which we have implemented an algorithm with idempotent and equivalence rules. The proposed tool automatically performs normalization upon complex and redundant queries, and as a result provides an efficient normalized query which makes further processing (optimization and execution process) faster.
</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Department of Information Technology</subfield>
  </datafield>
  <datafield tag="856" ind1=" " ind2=" ">
    <subfield code="u">https://tinyurl.com/ycxtxwpf</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2016-11-28</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/13-131</subfield>
    <subfield code="r">2016-11-28 00:00:00</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">RESEARCH</subfield>
    <subfield code="b">RESEARCH</subfield>
    <subfield code="d">2018-10-01</subfield>
    <subfield code="l">0</subfield>
    <subfield code="p">MP/26-280</subfield>
    <subfield code="r">2018-10-01 00:00:00</subfield>
    <subfield code="y">THESIS</subfield>
  </datafield>
</record>
