An ECA rule rewriting mechanism for peer data management systems

Zhao, D; Mylopoulos, J; Kiringa, I; Kantere, V

dc.contributor.author	Zhao, D	en
dc.contributor.author	Mylopoulos, J	en
dc.contributor.author	Kiringa, I	en
dc.contributor.author	Kantere, V	en
dc.date.accessioned	2014-03-01T02:43:54Z
dc.date.available	2014-03-01T02:43:54Z
dc.date.issued	2006	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/31547
dc.subject	Eca Rules	en
dc.subject	Event Condition Action	en
dc.subject	Global As View	en
dc.subject	Peer Data Management Systems	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Algorithms	en
dc.subject.other	Data processing	en
dc.subject.other	Mathematical models	en
dc.subject.other	User interfaces	en
dc.subject.other	Data management systems	en
dc.subject.other	Event Condition Action (ECA)	en
dc.subject.other	Global-As-View mappings	en
dc.subject.other	Peer data management systems	en
dc.subject.other	Database systems	en
dc.title	An ECA rule rewriting mechanism for peer data management systems	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/11687238_63	en
heal.identifier.secondary	http://dx.doi.org/10.1007/11687238_63	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	Managing coordination among peer databases is at the core of research in peer data management systems. The Hyperion project addresses peer database coordination through Event-Condition-Action (ECA) rules. However, peer databases are intended for non-technical end users, such as a receptionist at a doctor's office or an assistant pharmacist. Such users are not expected to know a technically demanding language for expressing ECA rules that are appropriate for coordinating their respective databases. Accordingly, we propose to offer a library of ""standard"" rules for coordinating two or more types of peer databases. These rules are denned in terms of assumed standard schemas for the peer databases they coordinate. Once two acquainted peers select such a rule, it can be instantiated so that it can operate for their respective databases. In this paper, we propose a mechanism for rewriting given standard rules into rules expressed in terms of the schemas of the two databases that are being coordinated. The rewriting is supported by Global-As-View mappings that are supposed to pre-exist between specific schemas and standard ones. More specifically, we propose a standard rule rewriting algorithm which we have implemented and evaluated. © Springer-Verlag Berlin Heidelberg 2006.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/11687238_63	en
dc.identifier.isi	ISI:000237081600063	en
dc.identifier.volume	3896 LNCS	en
dc.identifier.spage	1069	en
dc.identifier.epage	1078	en