<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
    <record>
        <controlfield tag="001">74816</controlfield>
        <controlfield tag="005">20180830104418.0</controlfield>
        <datafield tag="024" ind1="8" ind2=" ">
            <subfield code="2">sideral</subfield>
            <subfield code="a">106966</subfield>
        </datafield>
        <datafield tag="037" ind1=" " ind2=" ">
            <subfield code="a">ART-1998-106966</subfield>
        </datafield>
        <datafield tag="041" ind1=" " ind2=" ">
            <subfield code="a">eng</subfield>
        </datafield>
        <datafield tag="100" ind1=" " ind2=" ">
            <subfield code="a">Goñi, Alfredo</subfield>
        </datafield>
        <datafield tag="245" ind1=" " ind2=" ">
            <subfield code="a">An Ontology Connected to Several Data Repositories: Query Processing Steps</subfield>
        </datafield>
        <datafield tag="260" ind1=" " ind2=" ">
            <subfield code="c">1998</subfield>
        </datafield>
        <datafield tag="506" ind1="0" ind2=" ">
            <subfield code="a">Access copy available to the general public</subfield>
            <subfield code="f">Unrestricted</subfield>
        </datafield>
        <datafield tag="520" ind1="3" ind2=" ">
            <subfield code="a">The great expansion of communication networks has made avail- able to users a huge number of heterogeneous and autonomous data repositories that present different structures/organizations, query languages and data semantics. In that context it is clear that new information retrieval techniques with a strategy that focuses on in- formation content and semantics are needed. We propose to use domain specific Ontologies to capture the information content of such repositories whenever available. We describe such Ontolo- gies using a system based on Description Logics. In this paper we present all the stages of the processing of a query formulated over an Ontology when the answer must be found in the underly- ing data repositories. Those stages make up a subpart of the global query processing strategy defined for a set of loosely-coupled On- tologies. We show first how the query is transformed into a seman- tically equivalent one and how inconsistent queries are detected. Then, we explain the test to verify if the query can be answered from the cache memory. Next, we present a set of heuristics used during the query decomposition process. Later on, we show how to optimize plans associated to subqueries that access the underlying data repositories and finally we illustrate how the answers retrieved from the repositories are correlated in order to generate the query answer.</subfield>
        </datafield>
        <datafield tag="540" ind1=" " ind2=" ">
            <subfield code="9">info:eu-repo/semantics/openAccess</subfield>
            <subfield code="a">by</subfield>
            <subfield code="u">http://creativecommons.org/licenses/by/3.0/es/</subfield>
        </datafield>
        <datafield tag="655" ind1=" " ind2="4">
            <subfield code="a">info:eu-repo/semantics/article</subfield>
            <subfield code="v">info:eu-repo/semantics/acceptedVersion</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Illarramendi, Arantza</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="0">(orcid)0000-0002-7462-0080</subfield>
            <subfield code="a">Mena, Eduardo</subfield>
            <subfield code="u">Universidad de Zaragoza</subfield>
        </datafield>
        <datafield tag="700" ind1=" " ind2=" ">
            <subfield code="a">Blanco, José Miguel</subfield>
        </datafield>
        <datafield tag="710" ind1="2" ind2=" ">
            <subfield code="1">5007</subfield>
            <subfield code="2">570</subfield>
            <subfield code="a">Universidad de Zaragoza</subfield>
            <subfield code="b">Dpto. Informát.Ingenie.Sistms.</subfield>
            <subfield code="c">Área Lenguajes y Sistemas Inf.</subfield>
        </datafield>
        <datafield tag="773" ind1=" " ind2=" ">
            <subfield code="g">3, 1 (1998), [8 pp.]</subfield>
            <subfield code="p">J. comput. inf.</subfield>
            <subfield code="t">Journal of computing and information</subfield>
            <subfield code="x">1201-8511</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2="1">
            <subfield code="u">http://sid.cps.unizar.es/PUBLICATIONS/POSTSCRIPTS/icci98.ps.gz</subfield>
            <subfield code="z">Texto completo de la revista</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">109381</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/74816/files/texto_completo.pdf</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="856" ind1="4" ind2=" ">
            <subfield code="s">114128</subfield>
            <subfield code="u">http://zaguan.unizar.es/record/74816/files/texto_completo.jpg?subformat=icon</subfield>
            <subfield code="x">icon</subfield>
            <subfield code="y">Postprint</subfield>
        </datafield>
        <datafield tag="909" ind1="C" ind2="O">
            <subfield code="o">oai:zaguan.unizar.es:74816</subfield>
            <subfield code="p">articulos</subfield>
            <subfield code="p">driver</subfield>
        </datafield>
        <datafield tag="951" ind1=" " ind2=" ">
            <subfield code="a">2018-08-30-10:26:24</subfield>
        </datafield>
        <datafield tag="980" ind1=" " ind2=" ">
            <subfield code="a">ARTICLE</subfield>
        </datafield>
    </record>

    
</collection>