首页 > 最新文献
paperpass

Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data最新文献

英文 中文
Data Replication on the Cloud/Edge 云/边缘上的数据复制
David Mealha, Nuno M. Preguiça, M. C. Gomes, J. Leitao
This work presents a database replication system capitalising on hybrid cloud/edge infra-structures, which may be used in novel software architectures like microservices' applications. The system aims to reduce the latency perceived by clients performing read and update operations on a database, by locating replicas on edge nodes nearer end users. The replicas' convergence algorithm is based on eventual consistency and presents a novel solution that combines Operations Transformation and CRDTs techniques. The system follows the MongoDB data model and is validated on geographically disperse Amazon AWS data centers simulating edge nodes.
这项工作提出了一个利用混合云/边缘基础设施结构的数据库复制系统,它可以用于微服务应用程序等新型软件架构。该系统旨在通过在靠近最终用户的边缘节点上定位副本,减少客户端在数据库上执行读取和更新操作时感受到的延迟。副本的收敛算法基于最终一致性,并提出了一种结合操作转换和crdt技术的新颖解决方案。系统采用MongoDB数据模型,并在地理上分散的Amazon AWS数据中心模拟边缘节点上进行验证。
{"title":"Data Replication on the Cloud/Edge","authors":"David Mealha, Nuno M. Preguiça, M. C. Gomes, J. Leitao","doi":"10.1145/3301419.3323973","DOIUrl":"https://doi.org/10.1145/3301419.3323973","url":null,"abstract":"This work presents a database replication system capitalising on hybrid cloud/edge infra-structures, which may be used in novel software architectures like microservices' applications. The system aims to reduce the latency perceived by clients performing read and update operations on a database, by locating replicas on edge nodes nearer end users. The replicas' convergence algorithm is based on eventual consistency and presents a novel solution that combines Operations Transformation and CRDTs techniques. The system follows the MongoDB data model and is validated on geographically disperse Amazon AWS data centers simulating edge nodes.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115191296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Higher-Order Patterns in Replicated Data Types 复制数据类型中的高阶模式
Adriaan Leijnse, Paulo Sérgio Almeida, Carlos Baquero
The design of Conflict-free Replicated Data Types traditionally requires implementing new designs from scratch to meet a desired behavior. Although there are composition rules that can guide the process, there has not been a lot of work explaining how existing data types relate to each other, nor work that factors out common patterns. To bring clarity to the field we explain underlying patterns that are common to flags, sets, and registers. The identified patterns are succinct and composable, which gives them the power to explain both current designs and open up the space for new ones.
无冲突复制数据类型的设计传统上需要从头开始实现新的设计,以满足期望的行为。虽然有一些组合规则可以指导这个过程,但是没有很多工作可以解释现有数据类型如何相互关联,也没有工作可以分解出常见的模式。为了使这个领域更加清晰,我们解释了标志、集合和寄存器中常见的基础模式。确定的模式简洁且可组合,这使它们能够解释当前的设计并为新设计开辟空间。
{"title":"Higher-Order Patterns in Replicated Data Types","authors":"Adriaan Leijnse, Paulo Sérgio Almeida, Carlos Baquero","doi":"10.1145/3301419.3323971","DOIUrl":"https://doi.org/10.1145/3301419.3323971","url":null,"abstract":"The design of Conflict-free Replicated Data Types traditionally requires implementing new designs from scratch to meet a desired behavior. Although there are composition rules that can guide the process, there has not been a lot of work explaining how existing data types relate to each other, nor work that factors out common patterns. To bring clarity to the field we explain underlying patterns that are common to flags, sets, and registers. The identified patterns are succinct and composable, which gives them the power to explain both current designs and open up the space for new ones.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116931534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
In Search of a Scalable Raft-based Replication Architecture 寻找可扩展的基于筏的复制架构
Christian Deyerl, T. Distler
Providing a consistent replicated log across different servers, the Raft consensus protocol greatly facilitates the design of fault-tolerant services. However, due to the protocol following the principle of a single strong leader, such architectures in general do not scale with the number of cores and/or network cards available on each server. To address this problem, we present the Niagara replication architecture, which makes it possible to build scalable systems while still relying on Raft for consensus. In particular, we show how Niagara parallelizes the process of appending new log entries across multiple Raft instances and discuss Niagara's support for read operations with different consistency requirements.
Raft共识协议提供跨不同服务器的一致复制日志,极大地促进了容错服务的设计。然而,由于协议遵循单一强领导者的原则,这种体系结构通常不能随着每个服务器上可用的内核和/或网卡的数量而扩展。为了解决这个问题,我们提出了Niagara复制架构,这使得构建可扩展的系统成为可能,同时仍然依赖于Raft达成共识。特别是,我们展示了Niagara如何并行化跨多个Raft实例追加新日志条目的过程,并讨论了Niagara对具有不同一致性要求的读操作的支持。
{"title":"In Search of a Scalable Raft-based Replication Architecture","authors":"Christian Deyerl, T. Distler","doi":"10.1145/3301419.3323968","DOIUrl":"https://doi.org/10.1145/3301419.3323968","url":null,"abstract":"Providing a consistent replicated log across different servers, the Raft consensus protocol greatly facilitates the design of fault-tolerant services. However, due to the protocol following the principle of a single strong leader, such architectures in general do not scale with the number of cores and/or network cards available on each server. To address this problem, we present the Niagara replication architecture, which makes it possible to build scalable systems while still relying on Raft for consensus. In particular, we show how Niagara parallelizes the process of appending new log entries across multiple Raft instances and discuss Niagara's support for read operations with different consistency requirements.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115089152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Techniques for safe and highly available cloud applications 用于安全和高可用性云应用程序的技术
Carla Ferreira
Building trustworthy and highly available cloud applications is inherently complex and error-prone. Current industrial solutions are either ad-hoc solutions, relying heavily on the developerâĂŹs expertise, or use protocols that blindly restrict concurrency reducing performance and availability. We discusses sound techniques that leverage recent theoretical advances that either reduce or avoid coordinating the execution of operations, while enforcing the correctness of the application. To minimise coordination based on application-specific invariants, an analysis technique was developed that identifies which operations would be unsafe under concurrent execution. Given the set of problematic operations, the developer can then devise and formally check an optimized coordination protocol that guarantees the application invariants. Alternatively, coordination can be eschew altogether by extending operations with repair actions that ensure application invariants are always maintained. The modified operations preserve the original semantics when no conflicting updates occur. If a concurrent conflict occurs, we leverage conflict resolution policies to ensure a deterministic result that preserves the application invariants.
构建值得信赖且高度可用的云应用程序本质上是复杂且容易出错的。当前的工业解决方案要么是特别的解决方案,严重依赖developerâĂŹs专业知识,要么使用盲目限制并发性的协议,从而降低性能和可用性。我们讨论了合理的技术,这些技术利用了最近的理论进展,减少或避免了协调操作的执行,同时加强了应用程序的正确性。为了最小化基于特定于应用程序的不变量的协调,开发了一种分析技术,用于识别在并发执行下哪些操作是不安全的。给定一组有问题的操作,开发人员可以设计并正式检查保证应用程序不变性的优化协调协议。另外,可以通过扩展带有修复操作的操作来避免协调,这些操作确保始终维护应用程序不变量。当没有冲突的更新发生时,修改后的操作保留原始语义。如果并发冲突发生,我们利用冲突解决策略来确保保留应用程序不变量的确定性结果。
{"title":"Techniques for safe and highly available cloud applications","authors":"Carla Ferreira","doi":"10.1145/3301419.3323967","DOIUrl":"https://doi.org/10.1145/3301419.3323967","url":null,"abstract":"Building trustworthy and highly available cloud applications is inherently complex and error-prone. Current industrial solutions are either ad-hoc solutions, relying heavily on the developerâĂŹs expertise, or use protocols that blindly restrict concurrency reducing performance and availability. We discusses sound techniques that leverage recent theoretical advances that either reduce or avoid coordinating the execution of operations, while enforcing the correctness of the application. To minimise coordination based on application-specific invariants, an analysis technique was developed that identifies which operations would be unsafe under concurrent execution. Given the set of problematic operations, the developer can then devise and formally check an optimized coordination protocol that guarantees the application invariants. Alternatively, coordination can be eschew altogether by extending operations with repair actions that ensure application invariants are always maintained. The modified operations preserve the original semantics when no conflicting updates occur. If a concurrent conflict occurs, we leverage conflict resolution policies to ensure a deterministic result that preserves the application invariants.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131803902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Generic Replicated Data Type for Strong Eventual Consistency 实现强最终一致性的通用复制数据类型
Kevin De Porre, Florian Myter, C. Troyer, Christophe Scholliers, W. Meuter, E. G. Boix
Conflict-free replicated data types (CRDTs) [7] aid programmers develop highly available and scalable distributed systems. However, CRDTs require operations to commute which is not practical. This means that programmers cannot replicate regular objects without worrying about concurrency. In this paper, we introduce strong eventually consistent replicated objects (SECROs), a generic data type that is highly available and guarantees strong eventual consistency (SEC) without imposing restrictions on its operations.
无冲突复制数据类型(crdt)[7]帮助程序员开发高可用性和可伸缩的分布式系统。然而,crdt要求操作进行交换,这是不实际的。这意味着程序员不能在不担心并发性的情况下复制常规对象。在本文中,我们引入了强最终一致性复制对象(SECROs),这是一种高可用性的通用数据类型,它保证了强最终一致性(SEC),而不会对其操作施加限制。
{"title":"A Generic Replicated Data Type for Strong Eventual Consistency","authors":"Kevin De Porre, Florian Myter, C. Troyer, Christophe Scholliers, W. Meuter, E. G. Boix","doi":"10.1145/3301419.3323974","DOIUrl":"https://doi.org/10.1145/3301419.3323974","url":null,"abstract":"Conflict-free replicated data types (CRDTs) [7] aid programmers develop highly available and scalable distributed systems. However, CRDTs require operations to commute which is not practical. This means that programmers cannot replicate regular objects without worrying about concurrency. In this paper, we introduce strong eventually consistent replicated objects (SECROs), a generic data type that is highly available and guarantees strong eventual consistency (SEC) without imposing restrictions on its operations.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131442248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Support of Strong Consistency on Fog Applications 支持雾应用程序的强一致性
Diogo Lima, Hugo M. Miranda, François Taïani
Providing scalability for mobile distributed applications often leads the applications to compromise their consistency requirements. However, some of these applications depend on strong consistency to guarantee that one consistent state is observed by all participants over (some of) the shared objects of the application. While deploying the application in the Cloud facilitates state management and trivially solves the strong consistency requirements, this also creates a geographical barrier between mobile devices and the application servers that penalises performance with an unavoidable latency and jitter. Fog Computing architectures can mitigate this impact by deploying surrogate servers at the network edge but its performance depends of a middleware service able to monitor the application and deploy each fragment of the state at the most convenient location. Such alternative leads to the emergence of distributed transactions that require increasing efforts to maintain strong consistency. This paper addresses how virtual synchrony, in particular a technique named Light-Weight Group (LWG), can help supporting strong consistency for mobile applications in the Fog Computing environment.
为移动分布式应用程序提供可伸缩性通常会导致应用程序损害其一致性需求。然而,其中一些应用程序依赖于强一致性来保证应用程序的(一些)共享对象的所有参与者都能观察到一个一致的状态。虽然在云中部署应用程序有助于状态管理并轻松解决强一致性需求,但这也在移动设备和应用程序服务器之间创建了地理障碍,这会因不可避免的延迟和抖动而影响性能。雾计算架构可以通过在网络边缘部署代理服务器来减轻这种影响,但其性能取决于能够监视应用程序并在最方便的位置部署状态的每个片段的中间件服务。这种替代方案导致分布式事务的出现,需要付出更多的努力来保持强一致性。本文讨论了虚拟同步,特别是一种名为轻量级组(LWG)的技术,如何帮助支持雾计算环境中移动应用程序的强一致性。
{"title":"Support of Strong Consistency on Fog Applications","authors":"Diogo Lima, Hugo M. Miranda, François Taïani","doi":"10.1145/3301419.3323969","DOIUrl":"https://doi.org/10.1145/3301419.3323969","url":null,"abstract":"Providing scalability for mobile distributed applications often leads the applications to compromise their consistency requirements. However, some of these applications depend on strong consistency to guarantee that one consistent state is observed by all participants over (some of) the shared objects of the application. While deploying the application in the Cloud facilitates state management and trivially solves the strong consistency requirements, this also creates a geographical barrier between mobile devices and the application servers that penalises performance with an unavoidable latency and jitter. Fog Computing architectures can mitigate this impact by deploying surrogate servers at the network edge but its performance depends of a middleware service able to monitor the application and deploy each fragment of the state at the most convenient location. Such alternative leads to the emergence of distributed transactions that require increasing efforts to maintain strong consistency. This paper addresses how virtual synchrony, in particular a technique named Light-Weight Group (LWG), can help supporting strong consistency for mobile applications in the Fog Computing environment.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121701637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Interleaving anomalies in collaborative text editors 协同文本编辑器中的交错异常
Martin Kleppmann, Victor B. F. Gomes, D. Mulligan, A. Beresford
Collaborative text editors allow two or more users to concurrently edit a shared document without merge conflicts. Such systems require an algorithm to provide convergence, ensuring all clients that have seen the same set of document edits are in the same state. Unfortunately convergence alone does not guarantee that a collaborative text editor is usable. Several published algorithms for collaborative text editing exhibit an undesirable anomaly in which concurrently inserted portions of text with a well-defined order may be randomly interleaved on a character-by-character basis, resulting in an unreadable jumble of letters. Although this anomaly appears to be known informally by some researchers in the field, we are not aware of any published work that fully explains or addresses it. We show that several algorithms suffer from this problem, explain its cause, and also identify a lesser variant of the anomaly that occurs in another algorithm. Moreover, we propose a specification of collaborative text editing that rules out the anomaly, and show how to prevent the lesser anomaly from occurring in one particular algorithm.
协作文本编辑器允许两个或多个用户并发地编辑共享文档,而不会产生合并冲突。这样的系统需要一种算法来提供收敛性,以确保所有看到同一组文档编辑的客户端都处于相同的状态。不幸的是,聚合本身并不能保证协作文本编辑器是可用的。一些已发表的协作文本编辑算法显示出一种不希望出现的异常,即同时插入的具有良好定义顺序的文本部分可能会在逐个字符的基础上随机交错,从而导致无法读取的字母混乱。尽管该领域的一些研究人员似乎非正式地知道这种异常现象,但我们不知道有任何已发表的作品可以完全解释或解决它。我们展示了几种算法遭受此问题,解释了其原因,并确定了另一种算法中发生的异常的较小变体。此外,我们提出了一种排除异常的协同文本编辑规范,并展示了如何在一个特定的算法中防止较小的异常发生。
{"title":"Interleaving anomalies in collaborative text editors","authors":"Martin Kleppmann, Victor B. F. Gomes, D. Mulligan, A. Beresford","doi":"10.1145/3301419.3323972","DOIUrl":"https://doi.org/10.1145/3301419.3323972","url":null,"abstract":"Collaborative text editors allow two or more users to concurrently edit a shared document without merge conflicts. Such systems require an algorithm to provide convergence, ensuring all clients that have seen the same set of document edits are in the same state. Unfortunately convergence alone does not guarantee that a collaborative text editor is usable. Several published algorithms for collaborative text editing exhibit an undesirable anomaly in which concurrently inserted portions of text with a well-defined order may be randomly interleaved on a character-by-character basis, resulting in an unreadable jumble of letters. Although this anomaly appears to be known informally by some researchers in the field, we are not aware of any published work that fully explains or addresses it. We show that several algorithms suffer from this problem, explain its cause, and also identify a lesser variant of the anomaly that occurs in another algorithm. Moreover, we propose a specification of collaborative text editing that rules out the anomaly, and show how to prevent the lesser anomaly from occurring in one particular algorithm.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130420943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Invariant Safety for Distributed Applications 分布式应用程序的不变安全性
Sreeja Nair, G. Petri, M. Shapiro
We study a proof methodology for verifying the safety of data invariants of highly-available distributed applications that replicate state. The proof is (1) modular: one can reason about each individual operation separately, and (2) sequential: one can reason about a distributed application as if it were sequential. We automate the methodology and illustrate the use of the tool with a representative example.
我们研究了一种证明方法,用于验证复制状态的高可用分布式应用程序的数据不变量的安全性。证明是(1)模块化的:人们可以单独推理每个单独的操作;(2)顺序的:人们可以推理分布式应用程序,就好像它是顺序的。我们将该方法自动化,并通过一个代表性示例说明该工具的使用。
{"title":"Invariant Safety for Distributed Applications","authors":"Sreeja Nair, G. Petri, M. Shapiro","doi":"10.1145/3301419.3323970","DOIUrl":"https://doi.org/10.1145/3301419.3323970","url":null,"abstract":"We study a proof methodology for verifying the safety of data invariants of highly-available distributed applications that replicate state. The proof is (1) modular: one can reason about each individual operation separately, and (2) sequential: one can reason about a distributed application as if it were sequential. We automate the methodology and illustrate the use of the tool with a representative example.","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127736592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data 第六届分布式数据一致性原则与实践研讨会论文集
{"title":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","authors":"","doi":"10.1145/3301419","DOIUrl":"https://doi.org/10.1145/3301419","url":null,"abstract":"","PeriodicalId":337828,"journal":{"name":"Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data","volume":"153 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133552956","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Proceedings of the 6th Workshop on Principles and Practice of Consistency for Distributed Data
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1