rule rewriting mechanism for peer data management systems.
Published: 2005
Language: eng
Number of pages: 89
Description: Peer databases are supposed to be used by non-technical end users, such as a receptionist at a doctor's office or an assistant pharmacist. Accordingly, we suppose the existence of a library of "standard" rules for coordinating two types of peer databases with well defined "standard" schemas. We also suppose that an ECA rule is chosen for a specific coordination task.Coordinating peer databases is an active research topic in peer data management. Within the Hyperion project, peer database coordination is realized through Event-Condition-Action (ECA) rules.In this thesis, we propose a mechanism for instantiating the chosen ECA rule, so that the latter can coordinate specific databases whose schemas are instances of the standard database schemas. In particular, our mechanism rewrites standard ECA rules for specific peers using GAV mappings. We study several cases, design and implement a rewriting algorithm, test the latter with several examples, and evaluate the implementation.
Notes: Thesis (M.Sc.)--University of Toronto, 2005.

Electronic version licensed for access by U. of T. users.

Source: Masters Abstracts International, Volume: 44-01, page: 0420.

GERSTEIN MICROTEXT copy on microfiche (1 microfiche).