BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260914T105758Z
UID:Seminar-dept-453@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20171129T130000
DTEND:20171129T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Isolde Adler: Testing logically defined properties on relational databases of bounded degree\n\nProperty testing (for a property P) asks for a given input, whether it has property P, or is "far" from having that property. A "testing algorithm" is a probabilistic algorithm that answers this question with high probability correctly, by only looking at small parts of the input.  Testing algorithms are thought of as "extremely efficient", making them relevant in the context of big data. \n\n \n\nWe extend the bounded degree model of property testing from graphs to relational databases, and we show that in this model, every property definable in monadic second-order logic is testable with a constant number of queries in polylogarithmic time on databases of bounded tree-width.\n\n\n\nThis is joint work with Frederik Harwath.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=453
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR