BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20260329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20261025T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20260623T104500
DTEND;TZID=Europe/Paris:20260623T114500
DTSTAMP:20260615T145516
CREATED:20260615T075540Z
LAST-MODIFIED:20260615T075540Z
UID:12209-1782211500-1782215100@www.greyc.fr
SUMMARY:Séminaire Algorithmique : « Codd’s Theorem for Databases over Semirings »\, Guillermo Badia (University of Queensland\, Australie)
DESCRIPTION:Codd’s Theorem\, a fundamental result of database theory\, asserts that relational algebra and relational calculus have the same expressive power on relational databases. We explore Codd’s Theorem for databases over semirings and establish two different versions of this result for such databases: the first version involves the five basic operations of relational algebra\, while in the second version the division operation is added to the five basic operations of relational algebra. In both versions\, the difference operation of relations is given semantics using semirings with monus\, while on the side of relational calculus a limited form of negation is used. The reason for considering these two different versions of Codd’s theorem is that\, unlike the case of ordinary relational databases\, the division operation need not be expressible in terms of the five basic operations of relational algebra for databases over an arbitrary positive semiring; in fact\, we show that this inexpressibility result holds for bag databases\, as well as for databases over the tropical semiring. \nThis is a common work with Phokion G. Kolaitis and Carles Noguera DOI: https://doi.org/10.1145/3767713
URL:https://www.greyc.fr/event/seminaire-algorithmique-codds-theorem-for-databases-over-semirings-guillermo-badia-university-of-queensland-australie/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR