Abstract
Argues that heterogeneous databases and serializable schedules are contradictory terms in practice. This implies that mechanisms that guarantee fully serializable schedules are an overkill. Much simpler and unrestricted mechanisms can provide the correctness that is needed in heterogeneous systems. Serializable schedules are desirable because they enforce database consistency constraints. In a multi-computer system there are two types of consistency constraints: local and global. Global constraints are the ones that cause problems, as enforcing them requires synchronization among sites. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
