Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

PROVING THE CORRECTNESS OF THE EXTENDED SERIAL GRAPH-VALIDATION QUEUE SCHEME IN THE CLIENT-SERVER SYSTEM

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 2 (2024) · pp. 1359–1368

DOI
10.30598/barekengvol18iss2pp1359-1368
ISSN
2615-3017, 1978-7227
Published
2024-05-25
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Numerous studies have been conducted to develop concurrency control schemes that can be applied to client-server systems, such as the Extended Serial Graph-Validation Queue (SG-VQ) scheme. Extended SG-VQ is a control concurrency scheme in client-server system which implements object caching on the client side and locking strategy on the server side. This scheme employs validation algorithms based on queues on the client side and graphs on the server side. This research focuses on the mathematical analysis of the correctness of the Extended SG-VQ scheme using serializability as the criterion that needs to be achieved. Implementing a cycle-free transaction graph is a necessary and sufficient condition to achieve serializability. In this research, the serializability of the Extended SG-VQ scheme has been proven through the exposition of ten definitions, two propositions, three lemmas, and one theorem.

Collaboration network of the authors

18 authors · 37 co-authorship links · 5 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • IPB University
  • Universitas Gadjah Mada
  • Pakuan University
  • Universitas Halu Oleo
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Mohamad Khoirun NajibAffiliation unknown4
Refi RevinaAffiliation unknown3
Muhammad Fakhri JauhariAffiliation unknown2
Sri T. HartatiUniversitas Gadjah Mada1
Muhammad NurwegionoIPB University1
Sony Hartono WijayaIPB University1
Agus BuonoIPB University1
Fajar Delli WihartikoPakuan University1
Edi SantosaIPB University1
Dewi RahmawatiUniversitas Halu Oleo1
Teduh W. Mas’oedAffiliation unknown1
Mohamad K. NajibAffiliation unknown1
Lilis SriwahyuniAffiliation unknown1
Endar Hasafah NugrahaniAffiliation unknown1
Ihwan SukmanaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">PROVING THE CORRECTNESS OF THE EXTENDED SERIAL GRAPH-VALIDATION QUEUE SCHEME IN THE CLIENT-SERVER SYSTEM</dc:title>
	<dc:creator>Salsabila, Fitra Nuvus</dc:creator>
	<dc:creator>Bukhari, Fahren</dc:creator>
	<dc:creator>Nurdiati, Sri</dc:creator>
	<dc:description xml:lang="en-US">Numerous studies have been conducted to develop concurrency control schemes that can be applied to client-server systems, such as the Extended Serial Graph-Validation Queue (SG-VQ) scheme. Extended SG-VQ is a control concurrency scheme in client-server system which implements object caching on the client side and locking strategy on the server side. This scheme employs validation algorithms based on queues on the client side and graphs on the server side. This research focuses on the mathematical analysis of the correctness of the Extended SG-VQ scheme using serializability as the criterion that needs to be achieved. Implementing a cycle-free transaction graph is a necessary and sufficient condition to achieve serializability. In this research, the serializability of the Extended SG-VQ scheme has been proven through the exposition of ten definitions, two propositions, three lemmas, and one theorem.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-05-25</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12572</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss2pp1359-1368</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 2 (2024): BAREKENG: Journal of Mathematics and Its Application; 1359-1368</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss2year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/12572/7949</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Fitra Nuvus Salsabila, Fahren Bukhari, Sri Nurdiati</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>