Abstract
Increase in amount of data stored and requirement of fast response time has motivated the research in Parallel Database Systems (PDS). Requirement for correctness of data still remains one of the major issues. Concurrency control algorithms used by PDS uses single scheduler approach. Single scheduler approach has some inherent weaknesses such as - very big lock tables, overloaded centralized scheduler and more number of messages in the system. In this paper we investigate the possibility of multiple schedulers and conclude that single scheduler algorithms cannot be migrated in the present form to multi-scheduler environment. Next, we propose a Multi-Scheduler Concurrency Control algorithm for PDS that distributes the scheduling responsibilities to the respective Processing Elements. Correctness of the proposed algorithm is then discussed using a different serializability criterion - Parallel Database Quasi-Serializability.
Original language | English |
---|---|
Title of host publication | Advanced Parallel Processing Technologies |
Subtitle of host publication | 5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings |
Editors | Xingming Zhou, Stefan Jähnichen, Ming Xu, Jiannong Cao |
Place of Publication | Berlin Germany |
Publisher | Springer |
Pages | 643-654 |
Number of pages | 12 |
ISBN (Print) | 3540200541 |
DOIs | |
Publication status | Published - 2003 |
Event | International Workshop in Advanced Parallel Processing Technologies 2003 - Xiamen, China Duration: 17 Sep 2003 → 19 Sep 2003 Conference number: 5th https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13582 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 2834 |
ISSN (Print) | 0302-9743 |
Conference
Conference | International Workshop in Advanced Parallel Processing Technologies 2003 |
---|---|
Abbreviated title | APPT 2003 |
Country/Territory | China |
City | Xiamen |
Period | 17/09/03 → 19/09/03 |
Internet address |