Qobra: Accelerating Transactional Serializability Verifier by Quantum Annealing

• Item type: Trans(1)
• 公開日: 2024-10-22
• タイトル: Qobra: Accelerating Transactional Serializability Verifier by Quantum Annealing
• タイトル / 言語: en
• タイトル: Qobra: Accelerating Transactional Serializability Verifier by Quantum Annealing
• 言語: eng
• キーワード / 主題Scheme: Other
• キーワード / 主題: black-box serializability problem, quantum annealing, satisfiability problem
• 資源タイプ / 資源タイプ識別子: http://purl.org/coar/resource_type/c_6501
• 資源タイプ: journal article
• 著者所属: Keio Research Institute at SFC
• 著者所属: KDDI Research, Inc.
• 著者所属: Faculty of Environment and Information Studies, Keio University
• 著者所属(英): en
• 著者所属(英): Keio Research Institute at SFC
• 著者所属(英): en
• 著者所属(英): KDDI Research, Inc.
• 著者所属(英): en
• 著者所属(英): Faculty of Environment and Information Studies, Keio University
• 著者名: Natsuki, Hamada; Kazuhiro, Saito; Hideyuki, Kawashima
• 著者名(英): Natsuki, Hamada; Kazuhiro, Saito; Hideyuki, Kawashima
• 論文抄録 / 内容記述タイプ: Other
• 論文抄録 / 内容記述: Serializability is a standard that guarantees the correct execution of database operations. Since cloud databases do not always guarantee serializability, users must check for serializability on their own. However, what operations are executed in the cloud databases is a black box for users, making it difficult for them to make a judgment. This is a combinatorial optimization problem called the “black-box serializability problem,” which is a satisfiability problem known to be NP-complete. A seminal work called Cobra has proposed an architecture that solves this problem using the SMT solver, a general-purpose solver for the satisfiability problem. Still, as the number of transactions increases, the search space will expand exponentially, so it becomes challenging to determine serializability. On the other hand, quantum annealing is excellent for fast-solving combinatorial optimization problems and can be applied to this satisfiability problem. This paper proposes a fast solver for the black-box serializability problem using quantum annealing extending Cobra. The evaluation results show that the proposed method is 751-890 times faster than Cobra.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.32(2024) (online); ------------------------------
• 論文抄録(英) / 内容記述タイプ: Other
• 論文抄録(英) / 内容記述: Serializability is a standard that guarantees the correct execution of database operations. Since cloud databases do not always guarantee serializability, users must check for serializability on their own. However, what operations are executed in the cloud databases is a black box for users, making it difficult for them to make a judgment. This is a combinatorial optimization problem called the “black-box serializability problem,” which is a satisfiability problem known to be NP-complete. A seminal work called Cobra has proposed an architecture that solves this problem using the SMT solver, a general-purpose solver for the satisfiability problem. Still, as the number of transactions increases, the search space will expand exponentially, so it becomes challenging to determine serializability. On the other hand, quantum annealing is excellent for fast-solving combinatorial optimization problems and can be applied to this satisfiability problem. This paper proposes a fast solver for the black-box serializability problem using quantum annealing extending Cobra. The evaluation results show that the proposed method is 751-890 times faster than Cobra.; ------------------------------; This is a preprint of an article intended for publication Journal of; Information Processing(JIP). This preprint should not be cited. This; article should be cited as: Journal of Information Processing Vol.32(2024) (online); ------------------------------
• 書誌レコードID / 収録物識別子タイプ: NCID
• 書誌レコードID / 収録物識別子: AA11833852
• 書誌情報: 情報処理学会論文誌コンピューティングシステム（ACS）; 巻 17, 号 2, 発行日 2024-10-22
• ISSN / 収録物識別子タイプ: ISSN
• ISSN / 収録物識別子: 1882-7829
• 出版者 / 言語: ja
• 出版者: 情報処理学会