Update operations in deductive databases with functional dependencies
Identifieur interne : 003343 ( Istex/Corpus ); précédent : 003342; suivant : 003344Update operations in deductive databases with functional dependencies
Auteurs : Riccardo TorloneSource :
- Acta Informatica [ 0001-5903 ] ; 1994-06-01.
Abstract
Abstract: We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions ofrepresentability, consistency anddeterminism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.
Url:
DOI: 10.1007/BF01213208
Links to Exploration step
ISTEX:E31D6446197F00A93E73065FD6A78CBFCAC05961Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Update operations in deductive databases with functional dependencies</title><author><name sortKey="Torlone, Riccardo" sort="Torlone, Riccardo" uniqKey="Torlone R" first="Riccardo" last="Torlone">Riccardo Torlone</name><affiliation><mods:affiliation>IASI-CNR, Viale Manzoni 30, I-00185, Roma, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: torlone@iasi.rm.cnr.it</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:E31D6446197F00A93E73065FD6A78CBFCAC05961</idno><date when="1994" year="1994">1994</date><idno type="doi">10.1007/BF01213208</idno><idno type="url">https://api.istex.fr/document/E31D6446197F00A93E73065FD6A78CBFCAC05961/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">003343</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Update operations in deductive databases with functional dependencies</title><author><name sortKey="Torlone, Riccardo" sort="Torlone, Riccardo" uniqKey="Torlone R" first="Riccardo" last="Torlone">Riccardo Torlone</name><affiliation><mods:affiliation>IASI-CNR, Viale Manzoni 30, I-00185, Roma, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: torlone@iasi.rm.cnr.it</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Acta Informatica</title><title level="j" type="abbrev">Acta Informatica</title><idno type="ISSN">0001-5903</idno><idno type="eISSN">1432-0525</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1994-06-01">1994-06-01</date><biblScope unit="volume">31</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="573">573</biblScope><biblScope unit="page" to="600">600</biblScope></imprint><idno type="ISSN">0001-5903</idno></series><idno type="istex">E31D6446197F00A93E73065FD6A78CBFCAC05961</idno><idno type="DOI">10.1007/BF01213208</idno><idno type="ArticleID">BF01213208</idno><idno type="ArticleID">Art6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0001-5903</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions ofrepresentability, consistency anddeterminism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Riccardo Torlone</name><affiliations><json:string>IASI-CNR, Viale Manzoni 30, I-00185, Roma, Italy</json:string><json:string>E-mail: torlone@iasi.rm.cnr.it</json:string></affiliations></json:item></author><articleId><json:string>BF01213208</json:string><json:string>Art6</json:string></articleId><language><json:string>eng</json:string></language><abstract>Abstract: We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions ofrepresentability, consistency anddeterminism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.</abstract><qualityIndicators><score>6.26</score><pdfVersion>1.3</pdfVersion><pdfPageSize>439.28 x 662.28 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>777</abstractCharCount><pdfWordCount>15272</pdfWordCount><pdfCharCount>75355</pdfCharCount><pdfPageCount>28</pdfPageCount><abstractWordCount>105</abstractWordCount></qualityIndicators><title>Update operations in deductive databases with functional dependencies</title><genre.original><json:string>OriginalPaper</json:string></genre.original><genre><json:string>research-article</json:string></genre><host><issue>6</issue><subject><json:item><value>Computer Systems Organization and Communication Networks</value></json:item><json:item><value>Software Engineering/Programming and Operating Systems</value></json:item><json:item><value>Data Structures, Cryptology and Information Theory</value></json:item><json:item><value>Theory of Computation</value></json:item><json:item><value>Information Systems and Communication Service</value></json:item><json:item><value>Computational Mathematics and Numerical Analysis</value></json:item></subject><journalId><json:string>236</json:string></journalId><language><json:string>unknown</json:string></language><eissn><json:string>1432-0525</json:string></eissn><title>Acta Informatica</title><genre.original><json:string>Archive Journal</json:string></genre.original><volume>31</volume><pages><last>600</last><first>573</first></pages><issn><json:string>0001-5903</json:string></issn><genre><json:string>Journal</json:string></genre><publicationDate>1994</publicationDate><copyrightDate>1994</copyrightDate></host><publicationDate>1994</publicationDate><copyrightDate>1994</copyrightDate><doi><json:string>10.1007/BF01213208</json:string></doi><id>E31D6446197F00A93E73065FD6A78CBFCAC05961</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/E31D6446197F00A93E73065FD6A78CBFCAC05961/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/E31D6446197F00A93E73065FD6A78CBFCAC05961/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/E31D6446197F00A93E73065FD6A78CBFCAC05961/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Update operations in deductive databases with functional dependencies</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><availability><p>SPRINGER</p></availability><date>1993-12-01</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Update operations in deductive databases with functional dependencies</title><author><persName><forename type="first">Riccardo</forename><surname>Torlone</surname></persName><email>torlone@iasi.rm.cnr.it</email><affiliation>IASI-CNR, Viale Manzoni 30, I-00185, Roma, Italy</affiliation></author></analytic><monogr><title level="j">Acta Informatica</title><title level="j" type="abbrev">Acta Informatica</title><idno type="JournalID">236</idno><idno type="pISSN">0001-5903</idno><idno type="eISSN">1432-0525</idno><idno type="IssueArticleCount">6</idno><idno type="VolumeIssueCount">8</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>Berlin/Heidelberg</pubPlace><date type="published" when="1994-06-01"></date><biblScope unit="volume">31</biblScope><biblScope unit="issue">6</biblScope><biblScope unit="page" from="573">573</biblScope><biblScope unit="page" to="600">600</biblScope></imprint></monogr><idno type="istex">E31D6446197F00A93E73065FD6A78CBFCAC05961</idno><idno type="DOI">10.1007/BF01213208</idno><idno type="ArticleID">BF01213208</idno><idno type="ArticleID">Art6</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1993-12-01</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions ofrepresentability, consistency anddeterminism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.</p></abstract><textClass><keywords scheme="Journal Subject"><list><head>Computer Science</head><item><term>Computer Systems Organization and Communication Networks</term></item><item><term>Software Engineering/Programming and Operating Systems</term></item><item><term>Data Structures, Cryptology and Information Theory</term></item><item><term>Theory of Computation</term></item><item><term>Information Systems and Communication Service</term></item><item><term>Computational Mathematics and Numerical Analysis</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="1993-12-01">Created</change><change when="1994-06-01">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-20">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/E31D6446197F00A93E73065FD6A78CBFCAC05961/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer-Verlag</PublisherName><PublisherLocation>Berlin/Heidelberg</PublisherLocation></PublisherInfo><Journal><JournalInfo JournalProductType="ArchiveJournal" NumberingStyle="Unnumbered"><JournalID>236</JournalID><JournalPrintISSN>0001-5903</JournalPrintISSN><JournalElectronicISSN>1432-0525</JournalElectronicISSN><JournalTitle>Acta Informatica</JournalTitle><JournalAbbreviatedTitle>Acta Informatica</JournalAbbreviatedTitle><JournalSubjectGroup><JournalSubject Type="Primary">Computer Science</JournalSubject><JournalSubject Type="Secondary">Computer Systems Organization and Communication Networks</JournalSubject><JournalSubject Type="Secondary">Software Engineering/Programming and Operating Systems</JournalSubject><JournalSubject Type="Secondary">Data Structures, Cryptology and Information Theory</JournalSubject><JournalSubject Type="Secondary">Theory of Computation</JournalSubject><JournalSubject Type="Secondary">Information Systems and Communication Service</JournalSubject><JournalSubject Type="Secondary">Computational Mathematics and Numerical Analysis</JournalSubject></JournalSubjectGroup></JournalInfo><Volume><VolumeInfo VolumeType="Regular" TocLevels="0"><VolumeIDStart>31</VolumeIDStart><VolumeIDEnd>31</VolumeIDEnd><VolumeIssueCount>8</VolumeIssueCount></VolumeInfo><Issue IssueType="Regular"><IssueInfo TocLevels="0"><IssueIDStart>6</IssueIDStart><IssueIDEnd>6</IssueIDEnd><IssueArticleCount>6</IssueArticleCount><IssueHistory><CoverDate><DateString>1994</DateString><Year>1994</Year><Month>6</Month></CoverDate></IssueHistory><IssueCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1994</CopyrightYear></IssueCopyright></IssueInfo><Article ID="Art6"><ArticleInfo Language="En" ArticleType="OriginalPaper" NumberingStyle="Unnumbered" TocLevels="0" ContainsESM="No"><ArticleID>BF01213208</ArticleID><ArticleDOI>10.1007/BF01213208</ArticleDOI><ArticleSequenceNumber>6</ArticleSequenceNumber><ArticleTitle Language="En">Update operations in deductive databases with functional dependencies</ArticleTitle><ArticleFirstPage>573</ArticleFirstPage><ArticleLastPage>600</ArticleLastPage><ArticleHistory><RegistrationDate><Year>2005</Year><Month>2</Month><Day>8</Day></RegistrationDate><Received><Year>1993</Year><Month>12</Month><Day>1</Day></Received></ArticleHistory><ArticleCopyright><CopyrightHolderName>Springer-Verlag</CopyrightHolderName><CopyrightYear>1994</CopyrightYear></ArticleCopyright><ArticleGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ArticleGrants><ArticleContext><JournalID>236</JournalID><VolumeIDStart>31</VolumeIDStart><VolumeIDEnd>31</VolumeIDEnd><IssueIDStart>6</IssueIDStart><IssueIDEnd>6</IssueIDEnd></ArticleContext></ArticleInfo><ArticleHeader><AuthorGroup><Author AffiliationIDS="Aff1"><AuthorName DisplayOrder="Western"><GivenName>Riccardo</GivenName><FamilyName>Torlone</FamilyName></AuthorName><Contact><Email>torlone@iasi.rm.cnr.it</Email></Contact></Author><Affiliation ID="Aff1"><OrgName>IASI-CNR</OrgName><OrgAddress><Street>Viale Manzoni 30</Street><Postcode>I-00185</Postcode><City>Roma</City><Country>Italy</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions of<Emphasis Type="Italic">representability, consistency</Emphasis> and<Emphasis Type="Italic">determinism</Emphasis> are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>Work partially supported by Consiglio Nazionale delle Ricerche, within “Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo, LRC Logidata+”, and by System & Management S.p.A.</SimplePara></ArticleNote><ArticleNote Type="Misc"><SimplePara>A preliminary version of this paper appeared in [33].</SimplePara></ArticleNote></ArticleHeader><NoBody></NoBody></Article></Issue></Volume></Journal></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Update operations in deductive databases with functional dependencies</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Update operations in deductive databases with functional dependencies</title></titleInfo><name type="personal"><namePart type="given">Riccardo</namePart><namePart type="family">Torlone</namePart><affiliation>IASI-CNR, Viale Manzoni 30, I-00185, Roma, Italy</affiliation><affiliation>E-mail: torlone@iasi.rm.cnr.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="OriginalPaper"></genre><originInfo><publisher>Springer-Verlag</publisher><place><placeTerm type="text">Berlin/Heidelberg</placeTerm></place><dateCreated encoding="w3cdtf">1993-12-01</dateCreated><dateIssued encoding="w3cdtf">1994-06-01</dateIssued><copyrightDate encoding="w3cdtf">1994</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: We study the problem of updating intensional relations in the framework of deductive databases on which integrity constraints (specifically functional dependencies) are defined. First, a formalization of a model-theoretic semantics of updates is provided: the notions ofrepresentability, consistency anddeterminism are introduced to characterize the various cases. Then, a proof-theoretic approach, based on a variant of resolution integrated with the chase procedure, is defined, showing that the method exactly captures the above notions. It turns out that using functional dependencies it is possible to resolve potential ambiguities in several practical cases. Also, precomputations can be performed at definition time to execute update requests more efficiently.</abstract><relatedItem type="host"><titleInfo><title>Acta Informatica</title></titleInfo><titleInfo type="abbreviated"><title>Acta Informatica</title></titleInfo><genre type="Journal" displayLabel="Archive Journal"></genre><originInfo><dateIssued encoding="w3cdtf">1994-06-01</dateIssued><copyrightDate encoding="w3cdtf">1994</copyrightDate></originInfo><subject><genre>Computer Science</genre><topic>Computer Systems Organization and Communication Networks</topic><topic>Software Engineering/Programming and Operating Systems</topic><topic>Data Structures, Cryptology and Information Theory</topic><topic>Theory of Computation</topic><topic>Information Systems and Communication Service</topic><topic>Computational Mathematics and Numerical Analysis</topic></subject><identifier type="ISSN">0001-5903</identifier><identifier type="eISSN">1432-0525</identifier><identifier type="JournalID">236</identifier><identifier type="IssueArticleCount">6</identifier><identifier type="VolumeIssueCount">8</identifier><part><date>1994</date><detail type="volume"><number>31</number><caption>vol.</caption></detail><detail type="issue"><number>6</number><caption>no.</caption></detail><extent unit="pages"><start>573</start><end>600</end></extent></part><recordInfo><recordOrigin>Springer-Verlag, 1994</recordOrigin></recordInfo></relatedItem><identifier type="istex">E31D6446197F00A93E73065FD6A78CBFCAC05961</identifier><identifier type="DOI">10.1007/BF01213208</identifier><identifier type="ArticleID">BF01213208</identifier><identifier type="ArticleID">Art6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag, 1994</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag, 1994</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/E31D6446197F00A93E73065FD6A78CBFCAC05961/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">Updates, a new frontier</title><author><persName><forename type="first">R</forename><surname>Abiteboul</surname></persName></author><author><persName><forename type="first">S</forename></persName></author></analytic><monogr><title level="m">Second International Conference on Data Base Theory</title><meeting><address><addrLine>Berlin Heidelberg New York</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="1988"></date><biblScope unit="page" from="1" to="18"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">Solving ambiguities in updating deductive databases</title><author><persName><forename type="first">P</forename><surname>Atzeni</surname></persName></author><author><persName><forename type="first">R</forename><surname>Torlone</surname></persName></author></analytic><monogr><title level="m">MFDBS'91</title><meeting><address><addrLine>Rostock, Germany ; Berlin Heidelberg New York</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="1991"></date><biblScope unit="page" from="104" to="118"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b2"><analytic><title level="a" type="main">Updating intensionaI predicates in Datalog</title><author><persName><forename type="first">P</forename><surname>Atzeni</surname></persName></author><author><persName><forename type="first">R</forename><surname>Torlone</surname></persName></author></analytic><monogr><title level="j">Data Knowl. Eng</title><imprint><biblScope unit="volume">7</biblScope><biblScope unit="issue">8</biblScope><biblScope unit="page" from="1" to="17"></biblScope><date type="published" when="1992"></date></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Updating relational databases through weak instance interfaces Update semantics of relational views</title><author><persName><forename type="first">P</forename><surname>Atzeni</surname></persName></author><author><persName><forename type="first">R</forename><surname>Torlone</surname></persName></author></analytic><monogr><title level="j">ACM Trans. Database Syst. ACM Trans. Database Syst</title><imprint><biblScope unit="volume">17</biblScope><biblScope unit="issue">5</biblScope><biblScope unit="page" from="718" to="746"></biblScope><date type="published" when="1992-12"></date></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Relational chase procedures interpreted as resolution with paramodnlation</title><author><persName><forename type="first">J</forename><surname>Biskup</surname></persName></author><author><persName><forename type="first">B</forename><surname>Convent</surname></persName></author></analytic><monogr><title level="j">Fundam. Inf</title><imprint><biblScope unit="volume">15</biblScope><biblScope unit="issue">8</biblScope><biblScope unit="page" from="123" to="138"></biblScope><date type="published" when="1991"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">Intensional updates: abduction via deduction</title><author><persName><forename type="first">F</forename><surname>Bry</surname></persName></author></analytic><monogr><title level="m">7th International Conference on Logic Programming</title><imprint><date type="published" when="1990"></date><biblScope unit="page" from="561" to="575"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b6"><monogr><title level="m" type="main">Logic Programming and Data Bases</title><author><persName><forename type="first">S</forename><surname>Ceri</surname></persName></author><author><persName><forename type="first">G</forename><surname>Gottlob</surname></persName></author><author><persName><forename type="first">L</forename><surname>Tanca</surname></persName></author><imprint><date type="published" when="1989"></date><publisher>Springer</publisher><pubPlace>Berlin Heidelberg New York</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">Decidable optimization problems for database logic programs</title><author><persName><forename type="first">S</forename><forename type="middle">S</forename><surname>Cosmadakis</surname></persName></author><author><persName><forename type="first">H</forename><surname>Gaifman</surname></persName></author><author><persName><forename type="first">P</forename><forename type="middle">C</forename><surname>Kanellakis</surname></persName></author><author><persName><forename type="first">M</forename><surname>Vardi</surname></persName></author></analytic><monogr><title level="m">Twentieth ACM SIGACT Symposium on Theory of Computing</title><imprint><date type="published" when="1988"></date><biblScope unit="page" from="477" to="490"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">Updates of relational views</title><author><persName><forename type="first">S</forename><forename type="middle">S</forename><surname>Cosmadakis</surname></persName></author><author><persName><forename type="first">C</forename><forename type="middle">H</forename><surname>Papadimitriou</surname></persName></author></analytic><monogr><title level="j">J. ACM</title><imprint><biblScope unit="volume">31</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="742" to="760"></biblScope><date type="published" when="1984"></date></imprint></monogr></biblStruct><biblStruct xml:id="b9"><analytic><title level="a" type="main">On the correct translation of update relations on relational views</title><author><persName><forename type="first">U</forename><surname>Dayal</surname></persName></author><author><persName><forename type="first">P</forename><forename type="middle">A</forename><surname>Bernstein</surname></persName></author></analytic><monogr><title level="j">ACM Trans. Database Syst</title><imprint><biblScope unit="volume">8</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="381" to="416"></biblScope><date type="published" when="1982"></date></imprint></monogr></biblStruct><biblStruct xml:id="b10"><analytic><title level="a" type="main">Drawing updates from derivations</title><author><persName><forename type="first">H</forename><surname>Decker</surname></persName></author></analytic><monogr><title level="m">ICDT'90, Third International Conference on Data Base Theory</title><meeting><address><addrLine>Berlin Heidelberg New York</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="1990"></date><biblScope unit="page" from="437" to="451"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b11"><monogr><title level="m" type="main">Updating logical databases Advances in computing research</title><author><persName><forename type="first">R</forename><surname>Fagin</surname></persName></author><author><persName><forename type="first">G</forename><forename type="middle">M</forename><surname>Kuper</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">D</forename><surname>Ullman</surname></persName></author><author><persName><forename type="first">M</forename><forename type="middle">Y</forename><surname>Vardi</surname></persName></author><editor>Kanellakis, P.C., Preparata, F.P.</editor><imprint><date type="published" when="1986"></date><publisher>JAI Press</publisher><biblScope unit="page" from="1" to="18"></biblScope><pubPlace>London</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b12"><analytic><title level="a" type="main">On the semantics of updates in databases</title><author><persName><forename type="first">R</forename><surname>Fagin</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">D</forename><surname>Ullman</surname></persName></author><author><persName><forename type="first">M</forename><forename type="middle">Y</forename><surname>Vardi</surname></persName></author></analytic><monogr><title level="m">Second ACM SIGACT SIGMOD Symposium on Principles of Database Systems</title><imprint><date type="published" when="1983"></date><biblScope unit="page" from="352" to="365"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b13"><analytic><title level="a" type="main">Properties and update semantics of consistent views</title><author><persName><forename type="first">G</forename><surname>Gottlob</surname></persName></author><author><persName><forename type="first">P</forename><surname>Paolini</surname></persName></author><author><persName><forename type="first">R</forename><surname>Zicari</surname></persName></author></analytic><monogr><title level="j">ACM Trans. Database Syst</title><imprint><biblScope unit="volume">13</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="486" to="524"></biblScope><date type="published" when="1988"></date></imprint></monogr></biblStruct><biblStruct xml:id="b14"><analytic><title level="a" type="main">Updating knowledge bases</title><author><persName><forename type="first">A</forename><surname>Guessoum</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Lloyd</surname></persName></author></analytic><monogr><title level="j">New Generation Comput</title><imprint><biblScope unit="volume">8</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="71" to="89"></biblScope><date type="published" when="1990"></date></imprint></monogr></biblStruct><biblStruct xml:id="b15"><analytic><title level="a" type="main">Updating knowledge bases II</title><author><persName><forename type="first">A</forename><surname>Guessoum</surname></persName></author><author><persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Lloyd</surname></persName></author></analytic><monogr><title level="j">New Generation Comput</title><imprint><biblScope unit="volume">10</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="73" to="100"></biblScope><date type="published" when="1991"></date></imprint></monogr></biblStruct><biblStruct xml:id="b16"><analytic><title level="a" type="main">Testing satisfaction of functional dependencies</title><author><persName><forename type="first">P</forename><surname>Honeyman</surname></persName></author></analytic><monogr><title level="j">J. ACM</title><imprint><biblScope unit="volume">29</biblScope><biblScope unit="issue">3</biblScope><biblScope unit="page" from="668" to="677"></biblScope><date type="published" when="1982"></date></imprint></monogr></biblStruct><biblStruct xml:id="b17"><analytic><title level="a" type="main">Database updates through abduction</title><author><persName><forename type="first">A</forename><forename type="middle">C</forename><surname>Kakas</surname></persName></author><author><persName><forename type="first">P</forename><surname>Mancarella</surname></persName></author></analytic><monogr><title level="m">Sixteenth International Conference on Very Large Data Bases</title><meeting><address><addrLine>Brisbane</addrLine></address></meeting><imprint><date type="published" when="1990"></date><biblScope unit="page" from="650" to="661"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b18"><analytic><title level="a" type="main">Algorithms for translating view updates to database updates for views involving selections , projections, and joins</title><author><persName><forename type="first">A</forename><forename type="middle">M</forename><surname>Keller</surname></persName></author></analytic><monogr><title level="m">Fourth ACM SIGACT SIGMOD Symposium on Principles of Database Systems</title><imprint><date type="published" when="1985"></date><biblScope unit="page" from="154" to="163"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b19"><monogr><title level="m" type="main">Foundations of Logic Programming</title><author><persName><forename type="first">J</forename><forename type="middle">W</forename><surname>Lloyd</surname></persName></author><imprint><date type="published" when="1987"></date><publisher>Springer</publisher><pubPlace>Berlin Heidelberg New York</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b20"><analytic><title level="a" type="main">Testing implications of data dependencies</title><author><persName><forename type="first">D</forename><surname>Maier</surname></persName></author><author><persName><forename type="first">A</forename><forename type="middle">O</forename><surname>Mendelzon</surname></persName></author><author><persName><forename type="first">Y</forename><surname>Sagiv</surname></persName></author></analytic><monogr><title level="j">ACM Trans. Database Syst</title><imprint><biblScope unit="volume">4</biblScope><biblScope unit="issue">4</biblScope><biblScope unit="page" from="455" to="468"></biblScope><date type="published" when="1979"></date></imprint></monogr></biblStruct><biblStruct xml:id="b21"><analytic><title level="a" type="main">A logic-based language for database updates</title><author><persName><forename type="first">S</forename><surname>Manchanda</surname></persName></author><author><persName><forename type="first">D</forename><forename type="middle">S</forename><surname>Warren</surname></persName></author></analytic><monogr><title level="m">Foundations of deductive databases and logic programming</title><editor>Minker, J.</editor><meeting><address><addrLine>Los Altos</addrLine></address></meeting><imprint><publisher>Morgan Kaufman</publisher><date type="published" when="1988"></date><biblScope unit="page" from="363" to="394"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b22"><analytic><title level="a" type="main">Functional dependencies in horn clause queries</title><author><persName><forename type="first">A</forename><forename type="middle">O</forename><surname>Mendelzon</surname></persName></author><author><persName><forename type="first">P</forename><forename type="middle">T</forename><surname>Woods</surname></persName></author></analytic><monogr><title level="j">ACM Trans. Database Syst</title><imprint><biblScope unit="volume">16</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="31" to="55"></biblScope><date type="published" when="1991"></date></imprint></monogr></biblStruct><biblStruct xml:id="b23"><analytic><title level="a" type="main">Database updates in logic programming</title><author><persName><forename type="first">S</forename><surname>Naqvi</surname></persName></author><author><persName><forename type="first">R</forename><surname>Krishnamurthy</surname></persName></author></analytic><monogr><title level="m">Seventh ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems</title><imprint><date type="published" when="1988"></date><biblScope unit="page" from="251" to="262"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b24"><analytic><title level="a" type="main">Data independent recursion in deductive databases</title><author><persName><forename type="first">J</forename><surname>Nanghton</surname></persName></author></analytic><monogr><title level="m">Fifth ACM SIGACT SIGMOD Symposium on Principles of Database Systems</title><imprint><date type="published" when="1986"></date><biblScope unit="page" from="267" to="279"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b25"><analytic><title level="a" type="main">Minimizing function-free recursive inference rules</title><author><persName><forename type="first">J</forename><surname>Naughton</surname></persName></author></analytic><monogr><title level="j">J. ACM</title><imprint><biblScope unit="volume">36</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="69" to="91"></biblScope><date type="published" when="1989"></date></imprint></monogr></biblStruct><biblStruct xml:id="b26"><monogr><title level="m" type="main">Collected papers of Charles Sanders Peirce</title><author><persName><forename type="first">C</forename><forename type="middle">S</forename><surname>Peirce</surname></persName></author><imprint><date type="published" when="1958"></date><publisher>Harvard University Press</publisher><pubPlace>Cambridge</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b27"><analytic><title level="a" type="main">Contributions to the view update problem</title><author><persName><forename type="first">F</forename><surname>Rossi</surname></persName></author><author><persName><forename type="first">S</forename><surname>Naqvi</surname></persName></author></analytic><monogr><title level="m">6th International Conference on Logic Programming</title><imprint><date type="published" when="1989"></date><biblScope unit="page" from="398" to="415"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b28"><analytic><title level="a" type="main">A theorem-proving approach to database integrity</title><author><persName><forename type="first">F</forename><surname>Sadri</surname></persName></author><author><persName><forename type="first">R</forename><surname>Kowalski</surname></persName></author></analytic><monogr><title level="m">Foundations of deductive databases and logic programming</title><editor>Minker, J.</editor><meeting><address><addrLine>Los Altos</addrLine></address></meeting><imprint><publisher>Morgan Kaufman</publisher><date type="published" when="1988"></date><biblScope unit="page" from="313" to="362"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b29"><analytic><title level="a" type="main">Optimizing Datalog programs</title><author><persName><forename type="first">Y</forename><surname>Sagiv</surname></persName></author></analytic><monogr><title level="m">Foundations of deductive databases and logic programming</title><editor>Minker, J.</editor><meeting><address><addrLine>Los Altos</addrLine></address></meeting><imprint><publisher>Morgan Kanfman</publisher><date type="published" when="1988"></date><biblScope unit="page" from="627" to="658"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b30"><analytic><title level="a" type="main">View update translation via deduction and annotation</title><author><persName><forename type="first">A</forename><surname>Tomasic</surname></persName></author></analytic><monogr><title level="m">ICDT'88, Second International Conference on Data Base Theory</title><meeting><address><addrLine>Berlin Heidelberg New York</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="1988"></date><biblScope unit="page" from="338" to="352"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b31"><analytic><title level="a" type="main">Updating deductive databases with functional dependencies</title><author><persName><forename type="first">R</forename><surname>Torlone</surname></persName></author><author><persName><forename type="first">P</forename><surname>Atzeni</surname></persName></author></analytic><monogr><title level="m">DOOD'91 Second International Conference on Deductive and Object-Oriented Databases</title><meeting><address><addrLine>Berlin Heidelberg New York</addrLine></address></meeting><imprint><publisher>Springer</publisher><date type="published" when="1991"></date><biblScope unit="page" from="278" to="291"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b32"><monogr><title level="m" type="main">Principles of database and knowledge base systems</title><author><persName><forename type="first">J</forename><forename type="middle">D</forename><surname>Ullman</surname></persName></author><imprint><date type="published" when="1988"></date><publisher>Computer Science Press</publisher><pubPlace>Potomac, Maryland</pubPlace></imprint></monogr></biblStruct><biblStruct xml:id="b33"><analytic><title level="a" type="main">Decidability and undecidability results for boundedness of linear recursive queries</title><author><persName><forename type="first">M</forename><forename type="middle">Y</forename><surname>Vardi</surname></persName></author></analytic><monogr><title level="m">Seventh ACM SIGACT SIGMOD SIGART Symposium on Principles of Database Systems</title><imprint><date type="published" when="1988"></date><biblScope unit="page" from="341" to="351"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b34"><analytic><title level="a" type="main">A model-theoretic approach to updating logical databases</title><author><persName><forename type="first">M</forename><forename type="middle">W</forename><surname>Wilkins</surname></persName></author></analytic><monogr><title level="m">Fifth ACM SIGACT SIGMOD Symposium on Principles of Database Systems</title><imprint><date type="published" when="1986"></date><biblScope unit="page" from="224" to="234"></biblScope></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI></enrichments><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003343 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 003343 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:E31D6446197F00A93E73065FD6A78CBFCAC05961
|texte= Update operations in deductive databases with functional dependencies
}}
| This area was generated with Dilib version V0.6.32. |  |