Path: newssvr20.news.prodigy.com!newsmst01.news.prodigy.com!prodigy.com!in.100proofnews.com!in.100proofnews.com!aotearoa.belnet.be!news.belnet.be!ossa.telenet-ops.be!phobos.telenet-ops.be.POSTED!not-for-mail From: Jan Hidders Subject: Re: Final CFP: XML Database Symposium (XSym03) @ VLDB 2003 Newsgroups: comp.databases.theory References: <5022d011.0308270110.56c233ea@posting.google.com> <8lv3b.6084$HV.28701@phobos.telenet-ops.be> Lines: 29 Organization: none User-Agent: KNode/0.7.2 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7Bit Message-ID: Date: Fri, 29 Aug 2003 20:04:08 GMT NNTP-Posting-Host: 81.83.163.20 X-Complaints-To: abuse@telenet.be X-Trace: phobos.telenet-ops.be 1062187448 81.83.163.20 (Fri, 29 Aug 2003 22:04:08 MEST) NNTP-Posting-Date: Fri, 29 Aug 2003 22:04:08 MEST Xref: newssvr20.news.prodigy.com comp.databases.theory:21086 Mikito Harakiri wrote: > "Jan Hidders" wrote in message > news:n2x3b.6238$LD6.306225@phobos.telenet-ops.be... >> That alone would certainly not have been enough. If I would have to >> summarize their major achievement then it is that they managed to >> characterize the classical normal forms in an information-theoretic way >> and >> they managed to generalize this for the XML data model, which is >> important because the notion of "update anomaly" is less clear there, and >> justified that way a normal they had introduced earlier. This has (1) >> deepened our insight into the classical normal forms for the nested and >> flat relational model and (2) opened the way for more research on normal >> forms for more complex data models such as the XML data model. > > I thought that Dalkilic&Robertson should be credited for #1 (for "flat" > relations, at least). A little, but Arenas and Libkin managed to lift the concepts to schema level (Dalkilic and Robertson stay at the instance level) which is certainly not trivial (as they show the "first guess" doesn't work) and essential to get their results. Anyway, let's also not forget that the Dalkilic and Robertson paper had to compete with the likes of Christos Papadimitriou whom you probably know as the author of the classic work on computational complexity. That's tough competition. :-) -- Jan Hidders