检索结果-内蒙古大学图书馆

Proceedings of the 3rd International Conference on Computing Advancements

作者： Mehedi Hasan Samia Yasmin Abdus Salam American International University-Bangladesh Dhaka Bangladesh American International University - Bangladesh Dhaka Bangladesh

来源：评论

学校读者我要写书评

暂无评论

QIACO: A Quantum Dynamic Cost Ant system for Query Optimization in distributed database

引用

IEEE ACCESS 2021年 9卷 15833-15846页

作者： Mohsin, Sayed A. Darwish, Saad Mohamed Younes, Ahmed Alexandria Univ Inst Grad Studies & Res Dept Informat Technol Alexandria 21526 Egypt Alexandria Univ Dept Math & Comp Sci Fac Sci Alexandria 21568 Egypt

Query optimization is considered as the most significant part in a model of distributed database. The optimizer tries to find an optimal join order, which reduces the query execution cost. Several factors may affect the cost of query execution, including number of relations, communication costs, resources, and access to large distributed data sets. The success of a processed query depends heavily on the search methodology that is implemented by the query optimizer. Query processing is considered as NP-hard problem and many researchers are focusing on this problem. Researches are trying to find an appropriate algorithm to seek an ideal solution especially when the size of the database increases. In case of large queries, classical heuristic methods such as ant colony and genetic algorithm can't cover all search space and may lead to falling in a local minimum. In this paper, quantum inspired ant colony algorithm (QIACO), as one of the hybrid strategy of probabilistic algorithms, is utilized to improve the query join cost in the distributed database model. The ability of quantum computing to diversify leads to cover query large search space, which helps in selecting the best trail and thus improves the slow convergence speed and avoid falling into a local optimum. Using this strategy, the algorithm aims to find an optimal join order which minimizes the total execution time. Experimental results show that the proposed model convergence faster with better goodness than the classic ant colony model for same number of ants used.

关键词： distributed database system quantum computing query optimization ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

A Study of Blockchain-Based Metadata Management and Its Use for Data Verification 12

A Study of Blockchain-Based Metadata Management and Its Use ...

引用

12th International Symposium on Computing and Networking Workshops

作者： Hori, Haruka Oguchi, Masato Ochanomizu Univ Grad Sch Humanities & Sci Tokyo Japan Ochanomizu Univ Dept Informat Sci Tokyo Japan

ISBN: (纸本)9798331505356;9798331505349

To realize a data-driven society, it is essential to develop a distributed database system capable of managing data with varying levels of trust in a unified manner. In such a system, a robust data verification mechanism is crucial for ensuring the security of all data. However, there are concerns about performance degradation caused by the increased volume of data being verified at each node. To address this issue, we propose limiting the scope of data verification to metadata. In this paper, we implement a metadata management method that ensures reliability. This is achieved by integrating a series of processes related to metadata generation and updating as built-in commands within the Hyperledger Iroha blockchain platform. This integration also enables the implementation of a metadata verification function in a distributed database system. Additionally, using this metadata, we propose methods for both naive and simplified data verification.

关键词： distributed database system blockchain data validation distributed storage system

来源：评论

学校读者我要写书评

暂无评论

Security and Privacy Challenges in distributed database Management systems

Security and Privacy Challenges in Distributed Database Mana...

引用

2023 IEEE Global Conference on Information Technologies and Communications, GCITC 2023

作者： Kumar, Santosh Dash, Kishor Kumar Piduru, Bhargav Reddy Rajkumar, K. Bhaskar, Bandi Tiwari, Mohit Era University Department of Computer Science Uttar Pradesh Lucknow India Balimela College of Science and Technology Berhampur University and Govt. Model Degree College Study Centre Odisha State Open University Faculty & Academic Counsellor Department of Botany and Journalism & Mass Communication India Customer Experience Architect Hyundai IrvineCA United States /CSE Department Tamilnadu Kovilpatti India Sr University School of Cs & Ai Telangana Warangal India Bharati Vidyapeeth's College of Engineering Department of Computer Science and Engineering Delhi India

ISBN: (纸本)9798350308167

This research aims to investigate the challenge of recognizing and evaluating distributed database management system (DDBMS) security and privacy challenges and also to describe important danger indicators that may lead to possible data security difficulties in distributing resources, both tangible and functioning. An investigation of the primary DDBMS security and privacy challenges that can be found while developing and managing a standard DDBMS meant for supporting data procedures and offering data services was conducted as a component of this research. The data assessment was produced depending on the findings of surveys and questionnaires administered to DDBS security and privacy professionals with varying degrees of training and emphases in their operations within this expertise field. The findings of the research include a list of primary risk variables based on their significance and frequency in practice, and also a spotlight on the most important security and privacy measures. This article summarizes data on traditional methods to illustrate data security challenges employing statistical, qualitative, and mixed evaluation, and also the most recent techniques depending on smart categorization and examination of DDBS security and privacy challenge factors and functioning with huge amounts of data. © 2023 IEEE.

关键词： and distributed database management system Challenges distributed database system Privacy Security

来源：评论

学校读者我要写书评

暂无评论

Join query optimisation in the distributed databases using a hybrid harmony search and artificial bee colony algorithm

引用

INTERNATIONAL JOURNAL OF BIO-INSPIRED COMPUTATION 2021年第3期17卷 189-198页

作者： Yazdani, Manizheh Navimipour, Nima Jafari Islamic Azad Univ Dept Comp Engn Tabriz Branch Tabriz Iran Natl Yunlin Univ Sci & Technol Future Technol Res Ctr 123 Univ RdSect 3 Touliu 64002 Yunlin Taiwan

The query optimiser is a vital part of any distributed database mechanism. Reducing the execution period of the query depends on reaching an ideal query execution plan. Due to this issue's NP-hard nature, a hybrid harmony search and an artificial bee colony algorithm can be useful. The harmony is used to call query plans and signify them by S-dimension real vectors. A harmony memory is a place for creating and storing a primary population of harmony vectors. Then, bees explore harmony memory as a food source. The production of a novel nominate harmony out of all query plans in the harmony memory requires a pitch adjustment principle, a memory consideration one, and a random re-initialisation. Lastly, the new candidate vector replaces the worst harmony vector when it works better. The simulation outcomes have indicated that the introduced method reduces the expenses of evaluating a query compared to the harmony search and bee colony optimisation algorithms. However, this method has a longer execution time.

关键词： distributed database system join query optimisation harmony search algorithm artificial bee colony

来源：评论

学校读者我要写书评

暂无评论

Localized Data Transfer system by Vehicles and Cellular Base Station in Local Area

Localized Data Transfer System by Vehicles and Cellular Base...

引用

IEEE International Conference on Communications (ICC)

作者： Miyata, Hiroshi Arimoto, Kazutami Okayama Prefectural Univ Fac Comp Sci & Syst Sousya Okayama Japan

ISBN: (纸本)9781728194417

Dynamic map system is one of key elements for autonomous driving (AD) car. Semi-dynamic data and semi-static data of Dynamic Map are locally collected and used. Volume of these is some Megabytes, and the time-life of these is sub second to several minutes. A concept of such localized data transfer system is proposed. An effect of Vehicle to Vehicle communication (V2V) using wide range communication technology for Vehicle to Network communication (V2N) is estimated and an effect of off-loading cloud computing to edge computing and vehicle computing is estimated. Require for data base system of these data transfer system realization is proposed.

关键词： dynamic map autonomous driving V2V V2N edge computing localized data transfer system distributed database system

来源：评论

学校读者我要写书评

暂无评论

Interference-Free Checkpointing Algorithm for distributed database system

Interference-Free Checkpointing Algorithm for Distributed Da...

引用

International Conference on Industrial Control and Electronics Engineering (ICICEE)

作者： Luo, Chaojin Motorola China Chengdu R&D Ctr Chengdu Peoples R China

ISBN: (纸本)9780769547923

Checkpointing Algorithm is widely used in distributed database system (DDBS) to recover DDBS from fault. In traditional algorithms, normal DDBS activities, i.e. message exchanging between distributed sites should be blocked in checkpointing, thus the DDBS service are interfered with and the DDBS availability is dropped down. This paper presents a new algorithm that does not impact DDBS normal processing in checkpointing, and hence promote the DDBS availability.

关键词： Interference-Free Consistent Global Checkpoint Recovery Point distributed database system

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Two database Partitioning Approaches that Support Taxonomy-Based Query Answering 22

A Comparison of Two Database Partitioning Approaches that Su...

引用

22nd Annual International Conference on Information Integration and Web-Based Applications and Services (IIWAS)

作者： Schaefer, Jero Mario Wiese, Lena Univ Gottingen Inst Comp Sci Gottingen Germany Goethe Univ Frankfurt Inst Comp Sci Frankfurt Germany

ISBN: (纸本)9781450389228

In this paper we address the topic of identification of cohorts of similar patients in a database of electronic health records. We follow the conjecture that retrieval of similar patients can be supported by an underlying distributed database design. Hence we propose a fragmentation based on partitioning the health records and present a benchmark of two implementation variants in comparison to an off-the-shelf data distribution approach provided by Apache Ignite. While our main use case in this paper is cohort identification, our approach has advantages for taxonomy-based query answering in other (non-medical) domains.

关键词： distributed database system relational databases taxonomy-based query answering

来源：评论

学校读者我要写书评

暂无评论

distributed Machine Learning Scale Out with Algorithms and systems

Distributed Machine Learning Scale Out with Algorithms and S...

引用

作者： Yuan, Binhang Rice University

学位级别：Ph.D.

Machine learning (ML) is ubiquitous, and has powered the recent success of artificial intelligence. However, the state of affairs with respect to distributed ML is far from ideal. TensorFlow and PyTorch simply crash when an operation’s inputs and outputs cannot fit on a GPU for model parallelism, or when a model cannot fit on a single machine for data parallelism. A TensorFlow code that works reasonably well on a single machine with eight GPUs procured from a cloud provider often runs slower on two machines totaling sixteen GPUs. In this thesis, I propose solutions at both algorithm and system levels in order to scale out distributed ML. At the algorithm level, I propose a new method to distributed neural network learning, called independent subnet training (IST). In IST, per iteration, a neural network is decomposed into a set of subnetworks of the same depth as the original network, each of which is trained locally, before the various subnets are exchanged and the process is repeated. IST training has many advantages including reduction of communication volume and frequency, implicit extension to model parallelism, and memory limit decrease in each compute site. At the system level, I believe that proper computational and implementation abstractions will allow for the construction of self-configuring, declarative ML systems, especially when the goal is to execute tensor operations for ML in a distributed environment, or partitioned across multiple AI accelerators (ASICs). To this end, I first introduce a tensor relational algebra (TRA), which is expressive to encode any tensor operation that can be written in the Einstein notation, and then consider how TRA expressions can be re-written into an implementation algebra (IA) that enables effective implementation in a distributed environment, as well as how expressions in the IA can be optimized. The empirical study shows that the optimized implementation provided by IA can reach or even out-perform carefully engineer

关键词： distributed Machine Learning distributed database system

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Two database Partitioning Approaches that Support Taxonomy-Based Query Answering 20

A Comparison of Two Database Partitioning Approaches that Su...

引用

Proceedings of the 22nd International Conference on Information Integration and Web-based Applications & Services

作者： Jero Mario Schäfer Lena Wiese Institute of Computer Science University of Göttingen Göttingen Germany Institute of Computer Science Goethe University Frankfurt Frankfurt Germany

ISBN: (纸本)9781450389228

关键词： relational databases taxonomy-based query answering distributed database system

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：