Kawashima, Hideyuki

写真a

Affiliation

Faculty of Environment and Information Studies ( Shonan Fujisawa )

Position

Professor

Related Websites
Scopus Paper Info  
Paper Count: 114 Citation Count: 383 h-index: 9

Click to view the Scopus page. The data was downloaded from Scopus API in September 06, 2026, via http://api.elsevier.com and http://www.scopus.com .

Page Top ▲
 

Papers 【 Display / hide 】

  • Decentralization of Two Phase Locking based Protocols

    Nakamori T., Nemoto J., Hoshino T., Kawashima H.

    HPDC 2022 - Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing (HPDC 2022 - Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing)     281 - 282 2022.06

    　View Summary

    Bamboo is a state-of-the-art concurrency control protocol based on the 2-phase locking protocol. One problem of Bamboo is that it requires transactions to fetch timestamps from a single centralized atomic counter. To replace the concentrated access to it, each transaction should generate timestamps independently. This paper proposes thread-ID method (TID), which dismisses the process of fetching timestamps entirely by assigning an ID to each thread, and transactions use the thread IDs as their timestamps. In high-contention settings, the performance of TID plummets, but proposed optimization FairTID sustains the performance. The experiments measured an improvement of up to 60% from Bamboo with the proposed method.

  • Accelerating Concurrency Control with Active Thread Adjustment

    Masumura K., Hoshino T., Kawashima H.

    Proceedings - 2022 IEEE International Conference on Big Data and Smart Computing, BigComp 2022 (Proceedings - 2022 IEEE International Conference on Big Data and Smart Computing, BigComp 2022)     280 - 287 2022

    　View Summary

    We attempted to improve the performance of Silo, a concurrency control protocol for inmemory DataBase Management System that performs well under high-contention work-loads. Adaptive backoff is known as an effective optimization method under high-contention workloads. As a result of analyzing, we found that its efficacy lies in the non-existence of conflict events rather than in the reduction of the conflict rate, which has been considered in the past. On the basis of this analysis, we propose a method of adjusting the number of active threads. We conducted experiments comparing Cicada, another concurrency control protocol, and our method applied to Silo. The results indicate that the proposed method enabled Silo to significantly outperform. We found that cache misses are related to the performance.

  • Fast Accurate Discovery of Tuple Inclusion Dependencies

    Shen M., Kawashima H., Saito K.

    Proceedings - 2022 IEEE International Conference on Smart Computing, SMARTCOMP 2022 (Proceedings - 2022 IEEE International Conference on Smart Computing, SMARTCOMP 2022)     246 - 251 2022

    　View Summary

    Inclusion dependencies (IND) is an important problem in relational database, relevant to data integration, query optimization and various data management tasks. The discovery of IND has been addressed by many studies following different strategies, while IND detection still needs improvement as the complexity and diversity of real-life data increase. Conventional IND is only for column-to-column dimension, which is not applicable to lots of data processing tasks. The concept of dependency can be expanded. Based on the understanding of the conventional IND and approximate approach FAIDA, we present our algorithm for detecting tuple IND, converting column-to-column detection to row-to-row dimension, more in line with real-world data retrieval tasks in distributed system. Through probabilistic and accurate detection and the use of multi-threading, both accuracy and performance are guaranteed and IND detection performance is taken to a new level.

  • Stable Low Latency Logging for Epoch-based In-memory Database

    Tanaka M., Kawashima H.

    Proceedings - 2022 IEEE International Conference on Big Data and Smart Computing, BigComp 2022 (Proceedings - 2022 IEEE International Conference on Big Data and Smart Computing, BigComp 2022)     167 - 170 2022

    　View Summary

    We design and implement a logging method for the Silo concurrency control protocol and evaluate its performance. We also propose a low-latency method for Silo logging for real-time use and support threaded memory allocation for the NUMA architecture in the Silo logging implementation. The results of an experiment in which epochs were proceeded in increments of 4 ms demonstrated that the proposed method reduced the latency by 80% in exchange for a 35% reduction in throughput performance.

  • Removing Performance Bottleneck of Timestamp Allocation in Two-Phase Locking Based Protocol

    Nakamori T., Nemoto J., Hoshino T., Kawashima H.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics))  13459 LNCS   201 - 208 2022

    ISSN  03029743

    　View Summary

    Concurrency control ensures the correctness of databases when transactions are processed in parallel. Bamboo is a state-of-the-art concurrency control protocol. One problem of Bamboo is that it requires transactions to fetch timestamps from a single centralized atomic counter. To replace the concentrated access to it, each transaction should generate timestamps independently. This paper proposes two methods of decentralization to address the problem. The first is the thread-ID method (TID): transactions use thread IDs as their timestamps. In high-contention settings, the performance of TID plummets, but proposed optimization FairTID sustains the performance. The second method (RandID) allocates timestamps using random-number generators. Experiments indicated that there were up to 60% and 34% improvement in throughput from Bamboo with FairTID and RandID, respectively. In high-contention settings, TID recorded 24% degradation, but FairTID and RandID showed 19% to 31% and 12% to 22% improvement from Bamboo, respectively.

display all >>

Page Top ▲

Papers, etc., Registered in KOARA 【 Display / hide 】

display all >>

Page Top ▲

Research Projects of Competitive Funds, etc. 【 Display / hide 】

  • 自律移動ロボットに資する迅律データシステムの創出

    2022.04
    -
    2025.03

    MEXT,JSPS, Grant-in-Aid for Scientific Research, 基盤研究(B), Principal investigator

  • Real-Time Data Kernel for Data Intensive Science

    2019.04
    -
    2022.03

    MEXT,JSPS, Grant-in-Aid for Scientific Research, Grant-in-Aid for Scientific Research (B), Principal investigator

Page Top ▲
 

Courses Taught 【 Display / hide 】

  • MASTER SEMINAR

    2026

  • DATA SCIENCE AND ARTIFICIAL INTELLIGENCE

    2026

  • ADVANCED RESEARCH(CI)

    2026

  • DATA SCIENCE SPECIAL LECTURE A

    2026

  • ACADEMIC PROJECT(NOVEL COMPUTING: AI AND BRAIN SCIENCE)

    2026

display all >>

Page Top ▲