Recent rapid advancements in communication technology have brought forth the era of Web 3.0,representing a substantial transformation in the Internet landscape.This shift has led to the emergence of various decentrali...Recent rapid advancements in communication technology have brought forth the era of Web 3.0,representing a substantial transformation in the Internet landscape.This shift has led to the emergence of various decentralized metaverse applications that leverage blockchain as their underlying technology to enable users to exchange value directly from point to point.However,blockchains are blind to the real world,and smart contracts cannot directly access data from the external world.To address this limitation,the technology of oracles has been introduced to provide real-world data for smart contracts and other blockchain applications.In this paper,we focus on mitigating the risks associated with oracles providing corrupt or incorrect data.We propose a novel Web 3.0 architecture for the Metaverse based on the multiidentifier network(MIN),and its decentralized blockchain oracle model called Meta Oracle.The experimental results show that the proposed scheme can achieve minor time investment in return for significantly more reliable data and increased throughput.展开更多
Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the uns...Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the unstructured search problems with the time complexity of O(). In Grover’s algorithm, the key is Oracle and Amplitude Amplification. In this paper, our purpose is to show through examples that, in general, the time complexity of the Oracle Phase is O(N), not O(1). As a result, the time complexity of Grover’s algorithm is O(N), not O(). As a secondary purpose, we also attempt to restore the time complexity of Grover’s algorithm to its original form, O(), by introducing an O(1) parallel algorithm for unstructured search without repeated items, which will work for most cases. In the worst-case scenarios where the number of repeated items is O(N), the time complexity of the Oracle Phase is still O(N) even after additional preprocessing.展开更多
本文分析了民航行业中Oracle数据库ADG(Active Data Guard)的同步策略的工作原理、当前应用状况以及可能影响其稳定性的各种因素,并给出了针对性的优化建议。对ADG同步方案基本原理进行总结,对该方案在民航的应用现状进行分析。探讨了...本文分析了民航行业中Oracle数据库ADG(Active Data Guard)的同步策略的工作原理、当前应用状况以及可能影响其稳定性的各种因素,并给出了针对性的优化建议。对ADG同步方案基本原理进行总结,对该方案在民航的应用现状进行分析。探讨了网络因素、硬件相关因素等对ADG同步进行稳定性的影响。并提出了一系列措施,包括网络配置的优化、硬件的维护和保障,以及参数的合理配置,为了确保民航Oracle数据库ADG同步方案的稳健性。展开更多
随着财务系统数据库的使用时间增长,数据库中的数据量也会增加,数据量越大也意味着数据库备份与恢复所需要的成本就越高,不仅是备份所需时间越来越长,恢复数据所需时间也随之增长;当数据库发生意外而导致数据库中的数据不可修复的时候,...随着财务系统数据库的使用时间增长,数据库中的数据量也会增加,数据量越大也意味着数据库备份与恢复所需要的成本就越高,不仅是备份所需时间越来越长,恢复数据所需时间也随之增长;当数据库发生意外而导致数据库中的数据不可修复的时候,容灾远比备份更能快速有效的恢复生产业务的数据;在实际的使用过程中,我们也可以把容灾当做是一个活动的备份来使用,主要介绍了Oracle Data Guard和GoldenGate。展开更多
常规的医院Oracle数据库容灾备份方法数据恢复时间过长,因此设计一种全新的医院Oracle数据库容灾备份方法。先以成本和时间有效的容灾系统模型体系(Cost and Time Effective Disaster Recovery System,ETDRS)为基础,结合遗传算法选取了...常规的医院Oracle数据库容灾备份方法数据恢复时间过长,因此设计一种全新的医院Oracle数据库容灾备份方法。先以成本和时间有效的容灾系统模型体系(Cost and Time Effective Disaster Recovery System,ETDRS)为基础,结合遗传算法选取了有效的Oracle容灾备份编码例子,再根据智能合约构建了有效的数据库容灾备份平台,从而实现了Oracle数据库容灾备份。实验结果表明,设计方法在不同数量数据块下的数据恢复时间均较短,备份效果较好,有一定的应用价值。展开更多
基金supported by Shenzhen Fundamental Research Programs under Grant Nos.JCYJ20220531093206015,GXWD20201231165807007-20200807164903001,JCYJ20210324122013036,and JCYJ20190808155607340Guang Dong Prov.R&D Key Programs under Grant Nos.2019B010137001 and 2018B010124001+4 种基金Basic Research Enhancement Program of China under Grant No.2021-JCJQ-JJ-0483National Keystone R&D Program of China under Grant No.2017YFB0803204Natural Science Foundation of China under Grant No.61671001ZTE Industry-University-Institute Fund Project under Grant No.2019ZTE03-01HuaWei Funding under Grant No.TC20201222002。
文摘Recent rapid advancements in communication technology have brought forth the era of Web 3.0,representing a substantial transformation in the Internet landscape.This shift has led to the emergence of various decentralized metaverse applications that leverage blockchain as their underlying technology to enable users to exchange value directly from point to point.However,blockchains are blind to the real world,and smart contracts cannot directly access data from the external world.To address this limitation,the technology of oracles has been introduced to provide real-world data for smart contracts and other blockchain applications.In this paper,we focus on mitigating the risks associated with oracles providing corrupt or incorrect data.We propose a novel Web 3.0 architecture for the Metaverse based on the multiidentifier network(MIN),and its decentralized blockchain oracle model called Meta Oracle.The experimental results show that the proposed scheme can achieve minor time investment in return for significantly more reliable data and increased throughput.
文摘Since Grover’s algorithm was first introduced, it has become a category of quantum algorithms that can be applied to many problems through the exploitation of quantum parallelism. The original application was the unstructured search problems with the time complexity of O(). In Grover’s algorithm, the key is Oracle and Amplitude Amplification. In this paper, our purpose is to show through examples that, in general, the time complexity of the Oracle Phase is O(N), not O(1). As a result, the time complexity of Grover’s algorithm is O(N), not O(). As a secondary purpose, we also attempt to restore the time complexity of Grover’s algorithm to its original form, O(), by introducing an O(1) parallel algorithm for unstructured search without repeated items, which will work for most cases. In the worst-case scenarios where the number of repeated items is O(N), the time complexity of the Oracle Phase is still O(N) even after additional preprocessing.
文摘本文分析了民航行业中Oracle数据库ADG(Active Data Guard)的同步策略的工作原理、当前应用状况以及可能影响其稳定性的各种因素,并给出了针对性的优化建议。对ADG同步方案基本原理进行总结,对该方案在民航的应用现状进行分析。探讨了网络因素、硬件相关因素等对ADG同步进行稳定性的影响。并提出了一系列措施,包括网络配置的优化、硬件的维护和保障,以及参数的合理配置,为了确保民航Oracle数据库ADG同步方案的稳健性。
文摘随着财务系统数据库的使用时间增长,数据库中的数据量也会增加,数据量越大也意味着数据库备份与恢复所需要的成本就越高,不仅是备份所需时间越来越长,恢复数据所需时间也随之增长;当数据库发生意外而导致数据库中的数据不可修复的时候,容灾远比备份更能快速有效的恢复生产业务的数据;在实际的使用过程中,我们也可以把容灾当做是一个活动的备份来使用,主要介绍了Oracle Data Guard和GoldenGate。
文摘常规的医院Oracle数据库容灾备份方法数据恢复时间过长,因此设计一种全新的医院Oracle数据库容灾备份方法。先以成本和时间有效的容灾系统模型体系(Cost and Time Effective Disaster Recovery System,ETDRS)为基础,结合遗传算法选取了有效的Oracle容灾备份编码例子,再根据智能合约构建了有效的数据库容灾备份平台,从而实现了Oracle数据库容灾备份。实验结果表明,设计方法在不同数量数据块下的数据恢复时间均较短,备份效果较好,有一定的应用价值。
