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

Intelligent Control, Computing and Communications (IC3), International Conference on

作者： Nemala Jayasri Santosh Kumar B Navdeep Singh Ajeet Singh Taqi Mohammed Khattab Al-Rubaye Mallikarjuna Rao Department of CSE-AI&ML MLR Institute of Technology Hyderabad Telangana India Department of Computer Science Engineering New Horizon College of Engineering Bangalore India Lovely Professional University Phagwara India Department of Electrical Electronics & Communication Engineering Galgotias university Gerater Noida Uttar Pradesh Department of Medical Laboratory Technology College of Medical Technologies The Islamic University Najaf Iraq Department of CSE GRIET Bachupally Hyderabad Telangana India

ISBN: (数字)9798331527495

ISBN: (纸本)9798331527501

Optimisation of queries in distributed databases is more imperative to enhance the processing rate and use of resources with limited computational abilities. This work presents a novel GA-ACO hybrid swarm intelligence model to address the query optimization problem. The optimization effort of the proposed model starts with GA for an initial population of probable paths for query execution which uses the concept of evolution to select diverse solutions. After that, ACO strengthens this set by the application of pheromone-based reinforcement that allows adjusting of a query paths toward the best solution or its approximation with the following number values. In this way the enhancement of the convergence rates and the scalability of the proposed solution when distributed databases are used can be explained. The model was tested with artificial query logs with DEAP being used for the implementation of the genetic algorithm while ant colony operations were implemented using Python built ACO libraries. Performance analysis shows the success of the developed model in decreasing query response time as follows: This essentially complex hybrid mechanism shows potential for future use in other areas with large data sets and efficient query handling.

关键词： Costs Query processing Computational modeling Scalability distributed databases Time factors Particle swarm optimization Optimization Genetic algorithms Load modeling

来源：评论

学校读者我要写书评

暂无评论

Benchmarking Consistency Levels of Cloud-distributed NoSQL databases Using YCSB

引用

IEEE ACCESS 2025年 13卷 63428-63438页

作者： Ferreira, Saulo Mendonca, Julio Nogueira, Bruno Tiengo, Willy Andrade, Ermeson Fed Rural Univ Pernambuco UFRPE Dept Comp BR-52171900 Recife PE Brazil Univ Luxembourg Interdisciplinary Ctr Secur Reliabil & Trust SnT L-4365 Esch Sur Alzette Luxembourg Univ Fed Alagoas Inst Comp BR-57260000 Maceio Brazil

distributed database systems offer scalability and fault tolerance by replicating databases across geographically dispersed nodes. This redundancy aims to ensure data availability even during failures and allows for backups in case of disasters. However, maintaining strong data consistency, where all nodes reflect the latest data simultaneously, becomes a challenge in such geographically distributed setups since database systems need to prioritize availability or performance over strong data consistency. This study examines how different data consistency configurations affect the performance of popular NoSQL (Not only SQL) databases, namely Cassandra, MongoDB, and Redis, in a multi-region cloud environment. We adopt the Yahoo! Cloud Serving Benchmark (YCSB) tool to simulate various workloads, measure performance metrics, and compare the results. Our findings reveal significant performance degradation associated with strong data consistency configurations. For instance, in Cassandra, the number of writing/reading operations processed per second can decrease by up to 95% for specific workloads. Similarly, enforcing strong data consistency in Redis can result in execution times that are over 20 times slower on writing/reading operations.

关键词： NoSQL databases databases distributed databases Database systems Benchmark testing Cloud computing Time factors Runtime Relational databases Redundancy Database NoSQL cloud benchmarking

来源：评论

学校读者我要写书评

暂无评论

distributed databases: Security, consistency, and replication

Distributed databases: Security, consistency, and replicatio...

引用

16th International-Business-Information-Management-Association Conference

作者： Lungu, Ion Ghencea, Adrian Acad Econ Studies Bucharest Romania

ISBN: (纸本)9780982148952

In the last decade there have been significant changes in the computer industry. In database systems, we have seen a widespread acceptance of the management of relational databases for traditional business applications such as order tasking, inventory control, banking operations and flight bookings. However, the management of existing relational databases have proven inadequate for applications whose requirements are quite different from those of the database type applications to traditional business. These applications include: computer aided design (CAD), computer aided manufacturing (CAM), computer aided software engineering, information systems and office and multimedia systems, digital editing, geographical information systems.

关键词： distributed databases replication architecture security SGBD

来源：评论

学校读者我要写书评

暂无评论

EVALUATING RECURSIVE QUERIES IN distributed databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1993年第1期5卷 104-121页

作者： NEJDL, W CERI, S WIEDERHOLD, G STANFORD UNIV DEPT COMP SCISTANFORDCA 94305 POLITECN MILAN DIPARTIMENTO ELETTR & INFORMAZI-20133 MILANITALY VIENNA TECH UNIV A-1040 VIENNAAUSTRIA UNIV MODENA I-41100 MODENAITALY

In this paper, we study the execution of logic queries in a distributed database environment. We assume that each local database system can execute logic queries, and we design methods for the efficient execution or queries requiring data from multiple sites. Conventional optimization strategies which are well known in the field of distributed databases, such as the early evaluation of selection conditions and the clustering of processing to manipulate and exchange large sets of tuples, are redefined in view of the additional difficulties due to logic queries, in particular to recursive rules. In order to allow efficient processing of these logic queries we present several program transformation techniques which attempt to minimize distribution costs based on the idea of semi-joins and generalized semi-joins in conventional databases. Although local computation of semi-joins is not possible for the general case, we indicate classes of programs for which these transformations succeed in producing set-oriented computation. We describe processes evaluating the recursive program in a distributed network and develop an efficient method for testing the termination of the computation. Finally, we compare our approach with sequential as well as dataflow-oriented evaluation. Datalog is assumed as logic programming language and paradigm.

关键词： DEDUCTIVE databases distributed databases distributed QUERY PROCESSING QUERY OPTIMIZATION RECURSIVE QUERY PROCESSING SEMI-JOIN

来源：评论

学校读者我要写书评

暂无评论

Renovating blockchain with distributed databases: An open source system

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2019年 90卷 105-117页

作者： Muzammal, Muhammad Qu, Qiang Nasrulin, Bulat Chinese Acad Sci Shenzhen Inst Adv Technol Shenzhen Peoples R China Bahria Univ Dept Comp Sci Islamabad Pakistan Univ Chinese Acad Sci Shenzhen Coll Adv Technol Shenzhen Peoples R China

A blockchain is a decentralised linked data structure that is characterised by its inherent resistance to data modification, but it is deficient in search queries primarily due to its inferior data formatting. A distributed database is also a decentralised data structure which features quick query processing and well-designed data formatting but suffers from data reliability. In this work, we showcase CHAINSQL, an open-source system developed by integrating the blockchain with the database, i.e. we present a blockchain database application platform that has the decentralised, distributed and audibility features of the blockchain and quick query processing and well-designed data structure of the distributed databases. CHAINSQL features a tamper-resistant and consistent multi-active database, a reliable and cost effective data-level disaster recovery backup and an auditable transaction log mechanism. The system is presented as an operational multi-active database along with the data-level disaster recovery backup and audibility features. A comprehensive experimental evaluation is performed to demonstrate the effectiveness of the system. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Blockchain distributed databases Blockchain application

来源：评论

学校读者我要写书评

暂无评论

An object replication algorithm for real-time distributed databases

引用

distributed AND PARALLEL databases 2006年第2-3期19卷 125-146页

作者： Lin, Wujuan Veeravalli, Bharadwaj Data Storage Inst Network Storage Technol Div Singapore 117608 Singapore Natl Univ Singapore Comp Networks & Distributed Syst Lab Dept Elect & Comp Engn Singapore 117576 Singapore

A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding.

关键词： distributed databases real-time processing object replication communication cost competitiveness

来源：评论

学校读者我要写书评

暂无评论

Checking causal consistency of distributed databases

引用

COMPUTING 2022年第10期104卷 2181-2201页

作者： Zennou, Rachid Biswas, Ranadeep Bouajjani, Ahmed Enea, Constantin Erradi, Mohammed Mohammed V Univ ENSIAS Rabat Morocco Univ Paris CNRS IRIF F-75013 Paris France

The CAP Theorem shows that (strong) consistency, availability, and partition tolerance are impossible to be ensured together. Causal consistency is one of the weak consistency models that can be implemented to ensure availability and partition tolerance in distributed systems. In this work, we propose a tool to check automatically the conformance of distributed/concurrent systems executions to causal consistency models. Our approach consists in reducing the problem of checking if an execution is causally consistent to solving datalog queries. The reduction is based on complete characterizations of the executions violating causal consistency in terms of the existence of cycles in suitably defined relations between the operations occurring in these executions. We have implemented the reduction in a testing tool for distributed databases, and carried out several experiments on real case studies, showing the efficiency of the suggested approach.

关键词： Causal consistency Causal memory Causal convergence distributed databases Formal verification Testing

来源：评论

学校读者我要写书评

暂无评论

Collusion-resistant protocols for private processing of aggregated queries in distributed databases

引用

distributed AND PARALLEL databases 2021年第1期39卷 97-127页

作者： Rylands, Leanne Seberry, Jennifer Yi, Xun Kelarev, Andrei Ryan, Joe Lin, Yuqing Western Sydney Univ Ctr Res Math & Data Sci Locked Bay 1797 Penrith NSW 2751 Australia Univ Wollongong Sch Comp & Informat Technol Northfields Ave Wollongong NSW 2522 Australia RMIT Univ Sch Sci GPO Box 2476 Melbourne Vic 3001 Australia Univ Newcastle Sch Elect Engn & Comp Callaghan NSW 2308 Australia

Private processing of database queries protects the confidentiality of sensitive data when queries are answered. It is important to design collusion-resistant protocols ensuring that privacy remains protected even when a certain number of honest-but-curious participants collude to share their knowledge in order to gain unauthorised access to sensitive information. A novel setting arises when aggregated queries need to be answered for a large distributed database, but legal requirements or commercial interests forbid making access to records in each subdatabase available to other counterparts. For example, a very large number of medical records may be stored in a distributed database, which is a union of several separate databases from different hospitals, or even from different countries. The present article introduces and investigates two protocols for collusion-resistant private processing of aggregated queries in this novel setting: Accelerated Multi-round Iterative Protocol (AMIP) and Restricted Multi-round Iterative Protocol (RMIP). We define a large collection of query functions and show that AMIP and RMIP protocols can answer all queries in this collection. Our experiments demonstrate that the AMIP protocol outperforms all other applicable algorithms, and this achievement is especially significant in terms of the communication complexity.

关键词： Aggregated queries Multi-round iterative protocol Privacy protection Private query processing distributed databases

来源：评论

学校读者我要写书评

暂无评论

Allocating fragments in distributed databases

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2005年第7期16卷 577-585页

作者： Menon, S Univ Texas Sch Management Richardson TX 75083 USA

For a distributed database system to function efficiently, the fragments of the database need to be located judiciously at various sites across the relevant communications network. The problem of allocating these fragments to the most appropriate sites is a difficult one to solve, however, with most approaches available relying on heuristic techniques. Optimal approaches are usually based on mathematical programming, and formulations available for this problem are based on the linearization of nonlinear binary integer programs and have been observed to be ineffective except on very small problems. This paper presents new integer programming formulations for the nonredundant version of the fragment allocation problem. This formulation is extended to address problems which have both storage and processing capacity constraints;the approach is observed to be particularly effective in the presence of capacity restrictions. Extensive computational tests conducted over a variety of parameter values indicate that the reformulations are very effective even on relatively large problems, thereby reducing the need for heuristic approaches.

关键词： distributed databases nonredundant allocation reformulation

来源：评论

学校读者我要写书评

暂无评论

Enabling Encrypted Boolean Queries in Geographically distributed databases

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2020年第3期31卷 634-646页

作者： Yuan, Xu Yuan, Xingliang Zhang, Yihe Li, Baochun Wang, Cong Univ Louisiana Lafayette Sch Comp & Informat Lafayette LA 70504 USA Monash Univ Fac Informat Technol Clayton Vic 3800 Australia Univ Toronto Dept Elect & Comp Engn Toronto ON M5S Canada City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

The persistent growth of big data applications has being raising new challenges in managing large volumes of datasets with high scalability, confidentiality protection, and flexible types of search queries. In this paper, we propose a secure design to disassemble the private dataset with the aim to store them across geographically distributed servers while supporting secure multi-client Boolean queries. In this design, the data owner encrypts the private database with the searchable index attributes. The encrypted dataset will be disassembled and distributed evenly across multiple servers by leveraging the property of a distributed index framework. By constructing an encryption structure, generating search tokens, and enabling parallel query, we show how the proposed design performs the secure while efficient Boolean search. These queries are not only limited to those initiated by the data owner but also can be extended to support multiple authorized clients, where each client is allowed to access a necessary part of the private database. In this stage, we advocate a non-interactive authorization scheme where data owner is not required to stay online to process the query request. Moreover, the query operation can be executed in parallel, which significantly improves the search efficiency. We formally characterize the leakage profile, which allow us to follow the existing security analysis method to demonstrate that our system can guarantee data confidentiality and query privacy. To validate our protocol, we implement a system prototype and evaluate the efficiency of our construction. Through experimental results, we demonstrate the effectiveness of our protocol in terms of data outsourcing time and Boolean query time.

关键词： Servers distributed databases Cloud computing Indexes Encryption Data privacy Searchable symmetric encryption multi-client data access key-value stores Boolean query

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：