Fault-Tolerant Distributed Transactions on Blockchain
Springer International Publishing (Verlag)
978-3-031-00749-1 (ISBN)
Suyash Gupta is pursuing doctoral research at the Computer Science Department at University of California, Davis. At UC Davis, he is a senior member of Exploratory Systems Lab and works under the supervision of Prof. Sadoghi. He also works as the Lead Architect at the blockchain company Moka Blox. Prior to joining UC Davis, he started his doctoral research at the Department of Computer Science at Purdue University. He earned a Master of Science degree from Purdue University in 2017 and transferred to UC Davis to complete his research. He also received a Master of Science (Research) degree from Indian Institute of Technology Madras in 2015. His current research focuses on attaining safe and efficient, fault-tolerant consensus in distributed and blockchain applications. He also has published works that present efficient optimizations and design for parallel and distributed algorithms. In his free time, Suyash likes to code and has won awards at several hackathons.Jelle Hellings is currently a Postdoc Fellow in the Exploratory Systems Lab led by Prof. Sadoghi at UC Davis. Since 2018, his work focusses on exploring the theoretical limitations of future high-performance resilient data processing systems, this with the aim of exploring new directions for data processing in malicious environments. Jelle Hellings studied Computer Science and Engineering at the Eindhoven University of Technology, Netherlands. At the TU/e, he finished his graduate studies with a research project focused on external memory algorithms for indexing data that can be represented by trees or directed acyclic graphs. The results of which were presented at SIGMOD 2012. Following, he moved to Hasselt University, Belgium, to pursue his doctorate at the Databases and Theoretical Computer Science research group. There, his main focus was on the study of the expressive power of graph query languages. Furthermore, he also studied constraints for semi-structured data, graph querying via walks and via context-free languages, counting-only queries, and temporal join algorithms.Mohammad Sadoghi is an Assistant Professor in the Computer Science Department at the University of California, Davis. Formerly, he was an Assistant Professor at Purdue University and Research Staff Member at IBM T.J. Watson Research Center. He received his Ph.D. from the University of Toronto in 2013. He leads the ExpoLab research group with the mission to pioneer a resilient data platform at scale, a distributed ledger centered around a democratic and decentralized computational model (ResilientDB Fabric) that further aims to unify secure transactional and real-time analytical processing (L-Store). He envisioned ResilientDB to serve as a platform to foster "creativity." He has co-founded a blockchain company called Moka Blox LLC, the ResilientDB spinoff. He has over 90 publications in leading database conferences/journals and 34 filed U.S. patents. His ACM Middleware'18 paper entitled "QueCC: A Queue-oriented, Control-free Concurrency Architecture" won the Best Paper Award. He served as the Area Editor for Transaction Processing in Encyclopedia of Big Data Technologies by Springer. He has coauthored the book Transaction Processing on Modern Hardware, Morgan & Claypool Synthesis Lectures on Data Management. He regularly serves on the program committee of SIGMOD, VLDB, Middleware, ICDE, EDBT, Middleware, ICDCS, and ICSOC and has been an invited reviewer for TKDE, TPDS, JPDC, and VLDBJ.
Preface.- Introduction.- Practical Byzantine Fault-Tolerant Consensus.- Beyond the Design of PBFT.- Toward Scalable Blockchains.- Permissioned Blockchains.- Permissionless Blockchains.- Bibliography.- Authors' Biographies.
Erscheinungsdatum | 06.06.2022 |
---|---|
Reihe/Serie | Synthesis Lectures on Data Management |
Zusatzinfo | XX, 248 p. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 191 x 235 mm |
Gewicht | 511 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Netzwerke |
Informatik ► Theorie / Studium ► Algorithmen | |
ISBN-10 | 3-031-00749-2 / 3031007492 |
ISBN-13 | 978-3-031-00749-1 / 9783031007491 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich