Multi-scheduler concurrency control for parallel database systems

Sushant Goel, Hema Sharda, David Taniar

    Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

    1 Citation (Scopus)


    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 languageEnglish
    Title of host publicationAdvanced Parallel Processing Technologies
    Subtitle of host publication5th International Workshop, APPT 2003 Xiamen, China, September 17-19, 2003 Proceedings
    EditorsXingming Zhou, Stefan Jähnichen, Ming Xu, Jiannong Cao
    Place of PublicationBerlin Germany
    Number of pages12
    ISBN (Print)3540200541
    Publication statusPublished - 2003
    EventInternational Workshop in Advanced Parallel Processing Technologies 2003 - Xiamen, China
    Duration: 17 Sep 200319 Sep 2003
    Conference number: 5th (Proceedings)

    Publication series

    NameLecture Notes in Computer Science
    ISSN (Print)0302-9743


    ConferenceInternational Workshop in Advanced Parallel Processing Technologies 2003
    Abbreviated titleAPPT 2003
    Internet address

    Cite this