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

13th IEEE International Conference on Joint Cloud Computing (JCC)

作者： Fang, Xiang Zou, Yi Fang, Yange Tang, Zhen Li, Hui Wang, Wei Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Univ Chinese Acad Sci Beijing Peoples R China Nanjing Inst Software Technol Nanjing Peoples R China Univ Chinese Acad Sci Nanjing Coll Beijing Beijing Peoples R China

ISBN: (数字)9781665462853

ISBN: (纸本)9781665462853

Knob tuning is important to improve the performance of database management system. However, the traditional manual tuning method by DBA is time-consuming and error-prone, and can not meet the requirements of different database instances. In recent years, the research on automatic knob tuning using machine learning algorithm has gradually sprung up, but most of them only support workload-level knob tuning, and the studies on query-level tuning is still in the initial stage. Furthermore, few works are focus on the knob tuning for distributed database. In this paper, we propose a query-level tuning system for distribute database with the machine learning method. This system can efficiently recommend knobs according to the feature of the query. We deployed our techniques onto CockroachDB, a distribute database, and experimental results show that our system achieves higher performance under typical OLAP workload. For all categories of queries, our system reduces the latency by 9.2% on average, and for some categories of queries, this system reduces the latency by more than 60%.

关键词： query-level knob tuning distributed database machine learning

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL QUERY-PROCESSING FOR distributed database-SYSTEMS

引用

IEEE TRANSACTIONS ON COMPUTERS 1982年第9期31卷 835-850页

作者： CHU, WW HURLEY, P Department of Computer Science School of Engineering and Applied Science University of California

A model is developed for determining the optimal policy for processing a given relational model query. The model is based on operating cost (processing cost and communication cost), which is a function of selection of sites for processing query operations, sequence of operations, file size, and data reduction functions. The optimal policy specifies the site selection and sequence of operations that yield minimum operating cost.

关键词： distributed database local operation group optimal query processing query operating cost query processing graph query tree relational algebra relational database

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach for Data Replication in distributed database Systems

An Efficient Approach for Data Replication in Distributed Da...

引用

International Conference on Advances in Information Technology and Mobile Communication (AIM 2011)

作者： Yadav, Arun Kumar Agarwal, Ajay Rahmatkar, S. BMAS Engn Coll Dept Comp Sci Agra Uttar Pradesh India Krishna Inst Engn & Tech Dept MCA Ghaziabad Uttar Pradesh India Nagpur Inst Technol Dept Comp Sci Nagpur Maharashtra India

ISBN: (纸本)9783642205729

To increase the availability of data and fault tolerance in distributed database, it is better to add a backup server for each primary server in the system. So, the primary server and backup server must be connected to each other. To connect these computers to each other when they are at a long distance, it is necessary to use a leased line which needs to be charged as data is transferred. When packets are transferred between primary and backup server, more money need to be paid for charging this line. So if number of transferred packets between these computers can be reduced, the company can economize in its expenditures. Moreover, the number of transactions which should be performed in the backup server reduces. In order to achieve this, a new method is introduced which will reduce the number of transferred packets between primary and backup server. In this method, the replicated data of primary server on other computers is used as its backup.

关键词： distributed database Remote backup Data replication Load balancing filtering

来源：评论

学校读者我要写书评

暂无评论

A distributed database Query Optimization Method Based on Genetic Algorithm and Immune Theory 8

A Distributed Database Query Optimization Method Based on Ge...

引用

8th IEEE International Conference on Software Engineering and Service Science (ICSESS)

作者： Yao, Ming Univ Elect Sci Technol China Res Inst Elect Sci & Technol Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538604977

distributed database query optimization is very important in business field. This paper proposes an optimization based on genetic algorithm and immune theory. distributed database query is optimized by genetic coding and immune vaccine construction. Then, through the experimental data test, it proves that the algorithm has 13% higher efficiency than the standard genetic algorithm, which shows that the algorithm has better performance.

关键词： distributed database genetic algorithm immune theory

来源：评论

学校读者我要写书评

暂无评论

Research Load Balancing Technology of distributed database Based on Consistent Hash 19

Research Load Balancing Technology of Distributed Database B...

引用

3rd International Conference on High Performance Compilation, Computing and Communications (HP3C)

作者： Gong, Wenbo Guilin Univ Elect Technol Sch Comp & Informat Secur Guilin Guangxi Peoples R China

ISBN: (纸本)9781450366380

Consistent hash algorithm is applied to build a distributed database load balancing model, but this model should deal with thousands of user requests, handle 10 billion data information, along with low-latency response scenarios, all of this is a grim challenge. When load balancing control mechanism is built by the consistency hash, some nodes in the database cluster are overloaded, but some are idle. These load imbalances can seriously do great damage to the overall performance of distributed database system. This paper proposes a detailed description of variance mathematics model about dynamic load balancing, the core is to track system load, evaluation, classification and storage of each node in distributed cluster. This algorithm controls mutual feedback between node load states, idle data node allots the item of overload node, overall suppression of single point overload. After by experimental simulation, compared with the auxiliary loop hash model, this algorithm improves load balancing efficiency by 30% and settles disputes about distributed database load imbalance based on consistent hashing.

关键词： Load balancing consistent hashing distributed database dynamic variance screening model load analysis auxiliary loop hash model concurrent processing

来源：评论

学校读者我要写书评

暂无评论

The Application of distributed database on Spectrum Big Data 4th

The Application of Distributed Database on Spectrum Big Data

引用

4th International Conference on Cloud Computing and Security (ICCCS)

作者： Chen, Zhenjia Zhang, Yonghui Guo, Xia Hainan Univ Coll Informat Sci & Technol Haikou 570228 Hainan Peoples R China

ISBN: (纸本)9783030000097;9783030000080

The management and utilization of spectrum resources has always been an important issue. The data of radio signals from the time domain, frequency domain, and space domain is tremendous. The current spectrum databases are mainly centralized and the disaster recovery capacity of centralized database is insufficient. In the future, cognitive radio network (CRN) will be the development trend of mobile communications. The access to the spectrum database by a large number of cognitive radio (CR) terminals and the uploading of spectrum detection data by the spectrum detection terminal in real time will exert tremendous pressure on CRN. This paper proposes use of distributed spectrum databases instead of centralized database architectures in the spectrum big data to improve the fault tolerance of spectrum databases. Multi-node collaborative electromagnetic detection method with source parameter is proposed to replace the traditional wide-band energy detection method. The traditional spectrum database stores spectrum data with energy values, and the redundancy of data is really high. We propose to store the instantaneous parameters of signal source with the structure of blockchain. The timestamp is used as the link ID of the block to connect each block end-to-end, and a distributed spectrum database is established. With the timestamp as a unique identifier, the nodes locally interact with real-time detection data. Secondary user (SU) achieve the complete electromagnetic spectrum data by access each node. SUs can analyze the electromagnetic spectrum environment, and formulate appropriate strategies for rapid dynamic spectrum access (DSA).

关键词： distributed database Spectrum big data Cooperative detection Blockchain Spectrum visualization

来源：评论

学校读者我要写书评

暂无评论

GraphChain - A distributed database with Explicit Semantics and Chained RDF Graphs 18

GraphChain - A Distributed Database with Explicit Semantics ...

引用

27th World Wide Web (WWW) Conference

作者： Sopek, Mirek Gradzki, Przemyslaw Kosowski, Witold Kuzinski, Dominik Trojczak, Rafal Trypuz, Robert MakoLab SA Lodz Poland DC Lublin MakoLab SA R&D Team Lublin Poland MakoLab SA R&D Team Lublin Poland Fac Philosophy KUL Lublin Poland

ISBN: (纸本)9781450356404

In this paper we present a new idea of creating a Blockchain compliant distributed database which exposes its data with explicit semantics, is easily and natively accessible, and which applies Blockchain securitization mechanisms to the RDF graph data model directly, without additional packaging or specific serialisation. Essentially, the resulting database forms the linked chain of named RDF graphs and is given a name: GraphChain. Such graphs can then be published with the help of any standard mechanisms using triplestores or as linked data objects accessible via standard web mechanisms using the HTTP protocol to make them available on the web. They can also be easily queried using techniques like SPARQL or methods typical to available RDF graphs frameworks (like rdflib, Apache Jena, RDF4J, OWL API, RDF HDT, dotnetRDF and others). The GraphChain concept comes with its own, OWL-compliant ontology that defines all the structural, invariant elements of the GraphChain and defines their basic semantics. The paper describes also a few simple, prototypical GraphChain implementations with examples created using Java, .NET/C# and JavaScript/*** frameworks.

关键词： distributed database semantic blockchain GraphChain linked data

来源：评论

学校读者我要写书评

暂无评论

Research on Algorithm of Association Rules in distributed database System

Research on Algorithm of Association Rules in Distributed Da...

引用

2nd International Asia Conference on Informatics in Control, Automation and Robotics (CAR)

作者： Zhou, Lijuan Li, Shuang Xu, Mingsheng Capital Normal Univ Informat Engn Coll Beijing Peoples R China

ISBN: (纸本)9781424451944

This dissertation proposes a new algorithm of distributed mining association rules using the improved Apriori algorithm, based on analyses and introduction of the basic concepts and algorithms of mining association rules and mining association rules in distributed databases. Using improved Apriori algorithm to directly produce all of local frequent itemset in each crunode, rather than iteratively selecting candidate itemset. Then gather all of local multifarious itemset to broadcast to the general node, producing the global frequent itemset of association rules. In the process, the data is no longer saved with the affair ID as the key word. We take the item ID as the new key word. The performance of the improved Apriori algorithm has been improved through cutting down the store space. While the general node gathers all of local frequent itemset to select the global frequent itemset, it needs only a broadcast probably, needing three broadcasts worst. This raised the efficiency of the new algorithm of Association Rules in distributed database System.

关键词： Terms association rules distributed database data mining

来源：评论

学校读者我要写书评

暂无评论

Research on distributed database Stability Testing Platform based on Chaos Engineering 22

Research on Distributed Database Stability Testing Platform ...

引用

IEEE 22nd International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) / BigDataSE Conference / CSE Conference / EUC Conference / ISCI Conference

作者： Wang, Chaolun Yang, Jiaxing Han, Xiaolu Ma, Jianrui Liu, Siyuan Ma, Pengwei China Acad Informat & Commun Technol Beijing Peoples R China

ISBN: (纸本)9798350381993;9798350382006

With the fast development of information technology, the databases used as the fundamental storage and computing component of information system have to deal with much more complicated scenarios with high frequency and concurrency. distributed databases are becoming more and more common in data-intensive industries such as banking and telecommunications. The selection of distributed database products requires comprehensively consider the function, performance, security, ease of use and stability of the product. The stability of distributed database is known to be difficult in testing and product selection. The method widely used in database testing is TPC-DS (transaction processing performance council-decision support) benchmark, which is only suitable for functional and performance testing. To deal with this drawback, a distributed database stability testing platform based on chaos engineering methodology is developed Through the perturbation injection by using the stability testing platform, the performance fluctuation of the database under pressure condition can be observed, and the stability of the database can then be evaluated

关键词： database distributed database database testing database product selection big data chaos engineering

来源：评论

学校读者我要写书评

暂无评论

Online recovery of a distributed database from malicious attack

Online recovery of a distributed database from malicious att...

引用

10th International database Engineering and Applications Symposium (IDEAS 2006)

作者： Chakraborty, A. Garg, M. K. Majumdar, A. K. Sural, S. Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India Indian Inst Technol Sch Informat Technol Kharagpur 721302 W Bengal India

In this paper we consider the problem of recovery from committed malicious transactions in distributed databases. We define several useful dependency relations among transactions and based on them present an online re... 详细信息

ISBN: (纸本)9780769525778

关键词： distributed database Damage Assessment Online Recovery transaction dependency graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：