Journal article Open Access

Challenges in Data Quality and Complexity of Managing Data Quality Assessment in Big Data

D.B.Shanmugam; J.Dhilipan; A.Vignesh; T.Prabhu


DCAT Export

<?xml version='1.0' encoding='utf-8'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:adms="http://www.w3.org/ns/adms#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dct="http://purl.org/dc/terms/" xmlns:dctype="http://purl.org/dc/dcmitype/" xmlns:dcat="http://www.w3.org/ns/dcat#" xmlns:duv="http://www.w3.org/ns/duv#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:frapo="http://purl.org/cerif/frapo/" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:gsp="http://www.opengis.net/ont/geosparql#" xmlns:locn="http://www.w3.org/ns/locn#" xmlns:org="http://www.w3.org/ns/org#" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:prov="http://www.w3.org/ns/prov#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:schema="http://schema.org/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:vcard="http://www.w3.org/2006/vcard/ns#" xmlns:wdrs="http://www.w3.org/2007/05/powder-s#">
  <rdf:Description rdf:about="https://zenodo.org/record/5847697">
    <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/5847697</dct:identifier>
    <foaf:page rdf:resource="https://zenodo.org/record/5847697"/>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>D.B.Shanmugam</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Asst.Prof , Department of Computer Applications,SRM Institute of Science &amp; Technology, Ramapuram Campus, Chennai.</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>J.Dhilipan</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Professor &amp; Head, Department of Computer Applications, SRM Institute of Science and Technology,Ramapuram Campus, Chennai</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>A.Vignesh</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Asst.Prof , Department of Computer Applications,SRM Institute of Science &amp; Technology, Ramapuram Campus, Chennai</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:creator>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>T.Prabhu</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Associate Professor, Department of Computer Applications, Dr.MGR Educational &amp; Research Institute, Chennai.prabhu</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </dct:creator>
    <dct:title>Challenges in Data Quality and Complexity of Managing Data Quality Assessment in Big Data</dct:title>
    <dct:publisher>
      <foaf:Agent>
        <foaf:name>Zenodo</foaf:name>
      </foaf:Agent>
    </dct:publisher>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#gYear">2020</dct:issued>
    <dcat:keyword>Total Data Quality Management, Data Quality Metrics, Data Quality Assessment,</dcat:keyword>
    <dct:subject>
      <skos:Concept>
        <skos:prefLabel>2277-3878</skos:prefLabel>
        <skos:inScheme>
          <skos:ConceptScheme>
            <dct:title>issn</dct:title>
          </skos:ConceptScheme>
        </skos:inScheme>
      </skos:Concept>
    </dct:subject>
    <dct:subject>
      <skos:Concept>
        <skos:prefLabel>100.1/ijrte.E5643018520</skos:prefLabel>
        <skos:inScheme>
          <skos:ConceptScheme>
            <dct:title>handle</dct:title>
          </skos:ConceptScheme>
        </skos:inScheme>
      </skos:Concept>
    </dct:subject>
    <schema:sponsor>
      <rdf:Description>
        <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
        <foaf:name>Blue Eyes Intelligence Engineering and Sciences Publication(BEIESP)</foaf:name>
        <org:memberOf>
          <foaf:Organization>
            <foaf:name>Publisher</foaf:name>
          </foaf:Organization>
        </org:memberOf>
      </rdf:Description>
    </schema:sponsor>
    <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2020-09-30</dct:issued>
    <dct:language rdf:resource="http://publications.europa.eu/resource/authority/language/ENG"/>
    <owl:sameAs rdf:resource="https://zenodo.org/record/5847697"/>
    <adms:identifier>
      <adms:Identifier>
        <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/5847697</skos:notation>
        <adms:schemeAgency>url</adms:schemeAgency>
      </adms:Identifier>
    </adms:identifier>
    <dct:relation rdf:resource="http://issn.org/resource/ISSN/2277-3878"/>
    <owl:sameAs rdf:resource="https://doi.org/10.35940/ijrte.C5643.099320"/>
    <dct:description>&lt;p&gt;High Quality Data are the precondition for examining and making use of enormous facts and for making sure the estimation of the facts. As of now, far reaching exam and research of price gauges and satisfactory appraisal strategies for massive records are inadequate. To begin with, this paper abridges audits of Data excellent studies. Second, this paper examines the records attributes of the enormous records condition, presents high-quality difficulties appeared by large data, and defines a progressive facts exceptional shape from the point of view of records clients. This system accommodates of big records best measurements, best attributes, and best files. At long last, primarily based on this system, this paper builds a dynamic appraisal technique for records exceptional. This technique has excellent expansibility and versatility and can address the troubles of enormous facts fine appraisal. A few explores have verified that preserving up the character of statistics is regularly recognized as hazardous, however at the equal time is considered as simple to effective basic leadership in building aid the executives. Enormous data sources are exceptionally wide and statistics structures are thoughts boggling. The facts got may additionally have satisfactory troubles, for example, facts mistakes, lacking data, irregularities, commotion, and so forth. The motivation behind facts cleansing (facts scouring) is to pick out and expel mistakes and irregularities from facts so as to decorate their quality. Information cleansing may be separated into 4 examples dependent on usage techniques and degrees manual execution, composing of splendid software programs, records cleaning inconsequential to specific software fields, and taking care of the difficulty of a kind of explicit software area. In these 4 methodologies, the 1/3 has terrific down to earth esteem and may be connected effectively.&lt;/p&gt;</dct:description>
    <dct:accessRights rdf:resource="http://publications.europa.eu/resource/authority/access-right/PUBLIC"/>
    <dct:accessRights>
      <dct:RightsStatement rdf:about="info:eu-repo/semantics/openAccess">
        <rdfs:label>Open Access</rdfs:label>
      </dct:RightsStatement>
    </dct:accessRights>
    <dct:license rdf:resource="https://creativecommons.org/licenses/by/4.0/legalcode"/>
    <dcat:distribution>
      <dcat:Distribution>
        <dcat:accessURL rdf:resource="https://doi.org/10.35940/ijrte.C5643.099320"/>
        <dcat:byteSize>790757</dcat:byteSize>
        <dcat:downloadURL rdf:resource="https://zenodo.org/record/5847697/files/E5643018520.pdf"/>
        <dcat:mediaType>application/pdf</dcat:mediaType>
      </dcat:Distribution>
    </dcat:distribution>
  </rdf:Description>
</rdf:RDF>
17
11
views
downloads
Views 17
Downloads 11
Data volume 8.7 MB
Unique views 12
Unique downloads 11

Share

Cite as