Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/2771
Title: | Applying an update method to a set of receivers | Authors: | ANDRIES, Ellen Cabibbo, L Paredaens, J VAN DEN BUSSCHE, Jan |
Issue Date: | 2001 | Publisher: | ASSOC COMPUTING MACHINERY | Source: | ACM TRANSACTIONS ON DATABASE SYSTEMS, 26(1). p. 1-40 | Abstract: | In the context of object databases, we study the application of an update method to a collection of receivers rather than to a single one. The obvious strategy of applying the update to the receivers one after the other, in some arbitrary order, brings up the problem of order independence. On a very general level, we investigate how update behavior can be analyzed in terms of certain schema annotations, called colorings. We are able to characterize those colorings that always describe order-independent updates. We also consider a more specific model of update methods implemented in the relational algebra. Order-independence of such algebraic methods is undecidable in general, but decidable if the expressions used are positive. Finally, we consider an alternative parallel strategy for set-oriented application of algebraic update methods and compare and relate it to the sequential strategy. | Notes: | Univ Antwerp, B-2020 Antwerp, Belgium. Univ Roma Tre, Rome, Italy. Limburgs Univ Ctr, B-3590 Diepenbeek, Belgium.Andries, M, Univ Pl 1, B-2610 Wilrijk, Belgium. | Keywords: | algorithms; languages; theory; verification; database update; order independence; parallel update; relational algebra; schema coloring | Document URI: | http://hdl.handle.net/1942/2771 | ISSN: | 0362-5915 | e-ISSN: | 1557-4644 | ISI #: | 000171371900001 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2002 |
Appears in Collections: | Research publications |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.