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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

294 篇 会议
209 篇 期刊文献
9 篇 学位论文
4 册 图书

馆藏范围

516 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

414 篇 工学
- 335 篇 计算机科学与技术...
- 129 篇 电气工程
- 93 篇 软件工程
- 74 篇 信息与通信工程
- 31 篇 控制科学与工程
- 8 篇 仪器科学与技术
- 7 篇 机械工程
- 7 篇 材料科学与工程（可...
- 5 篇 生物医学工程（可授...
- 5 篇 网络空间安全
- 4 篇 电子科学与技术（可...
- 4 篇 石油与天然气工程
- 2 篇 力学（可授工学、理...
76 篇 管理学
- 66 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 7 篇 工商管理
- 3 篇 公共管理
32 篇 理学
- 15 篇 数学
- 6 篇 物理学
- 4 篇 化学
- 3 篇 地球物理学
- 3 篇 统计学（可授理学、...
- 2 篇 天文学
- 2 篇 生物学
12 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
- 3 篇 公共卫生与预防医...
5 篇 经济学
- 5 篇 应用经济学
5 篇 教育学
- 5 篇 教育学
2 篇 法学
- 2 篇 社会学
2 篇 文学
1 篇 农学
1 篇 艺术学

主题

516 篇 distributed data...
25 篇 query optimizati...
21 篇 blockchain
19 篇 concurrency cont...
19 篇 consistency
18 篇 transaction
16 篇 cloud computing
14 篇 data mining
14 篇 genetic algorith...
13 篇 query processing
12 篇 replication
12 篇 big data
11 篇 nosql
10 篇 database
9 篇 load balancing
9 篇 security
9 篇 synchronization
8 篇 clustering
8 篇 data replication
8 篇 transaction proc...

机构

6 篇 coll charleston ...
3 篇 e.e.department t...
3 篇 jaypee inst info...
2 篇 univ illinois de...
2 篇 department of in...
2 篇 transnat univ li...
2 篇 univ adelaide sc...
2 篇 logicblox inc at...
2 篇 northwestern pol...
2 篇 tsinghua univ de...
2 篇 tokyo univ agr &...
2 篇 ulm univ inst in...
2 篇 shandong univ sc...
2 篇 hunan univ coll ...
2 篇 univ chinese aca...
2 篇 univ minnesota d...
2 篇 shizuoka inst sc...
2 篇 zhejiang univ pe...
2 篇 narl natl ctr hi...
2 篇 univ san francis...

作者

7 篇 olmsted aspen
4 篇 shojiro nishio
4 篇 jia-song sun
4 篇 qiao sun
4 篇 leguizamo cp
4 篇 masahiko tsukamo...
4 篇 takahiro hara
3 篇 wakahara y
3 篇 lan-mei fu
3 篇 ketsman bas
3 篇 neven frank
3 篇 wiese lena
3 篇 kaname harumoto
3 篇 seybold daniel
3 篇 mori k
3 篇 bu-qiao deng
3 篇 domaschka joerg
3 篇 ameloot tom j.
3 篇 sharma aditi
2 篇 lin zhu

语言

478 篇 英文
19 篇 其他
19 篇 中文

检索条件"主题词=distributed Database"

共 516 条记录，以下是51-60 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Query Optimization of distributed database Based on Parallel Genetic Algorithm and Max-Min Ant System 8

Query Optimization of Distributed Database Based on Parallel...

引用

8th International Symposium on Computational Intelligence and Design (ISCID)

作者： Ban, Wenjiao Lin, Jiming Tong, Jichao Li, Shiwen Guilin Univ Elect Technol Coll Informat & Commun Guilin 541004 Peoples R China

ISBN: (纸本)9781467395878

Since the era of big data is coming, the first important problem is how to enhance the speed of database query. For the query optimization of distributed database, the speed of query depends on the data transfer and order of join. The cost model minimizing communication cost is the emphasis of research. Parallel Genetic Algorithm-Max-Min Ant System was proposed to seek a best query execution plan, which combines faster convergence of Genetic Algorithm, globally search ability of Max-Min Ant System and parallel property of both them. The experiment results show that the proposed algorithm is effective for query processing of multi-join, and plays important role in improving the performance of distributed database.

关键词： distributed database Genetic Algorithm Max-Min Ant System query execution plan parallel

来源：评论

学校读者我要写书评

暂无评论

Optimal Placements in Ring Network for Data Replicas in distributed database with Majority Voting Protocol

Optimal Placements in Ring Network for Data Replicas in Dist...

引用

28th International Conference on distributed Computing Systems

作者： Zhang, Zhao Wu, Weili Shekhar, Shashi Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Xinjiang Peoples R China Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA Univ Minnesota Dept Comp Sci Minneapolis MN 55455 USA

ISBN: (纸本)9781424431748

In a distributed database system, data replicas are placed at different locations to achieve high data availability in the presence of link failures. With majority voting protocol, a location is survived for read/write operations if and only if it is accessible to more titan half of the replicas. The problem is to find out the optimal placements for a given number of data replicas in a ring network. When the number of replicas is odd, it was conjectured by Hu et al. that every uniform placement is optimal, which is proved by Shekhar and Wu later. However, when the number of replicas is even, it was pointed out by Hu el al. that uniform placements are not optimal and the optimal placement problem may be very complicated. In this paper we study the optimal placement problem in a ring network, with majority voting protocol and even number of replicas, and give a complete characterization of optimal placements when the number of replicas is not too large compared with the number of locations.

关键词： distributed database data replica majority voting protocol ring network

来源：评论

学校读者我要写书评

暂无评论

Research on Query Optimization Technology in distributed database

Research on Query Optimization Technology in Distributed Dat...

引用

International Conference on Materials Science and Information Technology (MSIT 2011)

作者： Wu Bozhu Chongqing Ind Polytech Coll Chongqing Peoples R China

ISBN: (纸本)9783037853191

Through the in-depth study of the existing distributed database query processing technology, this paper proposes a distributed database query processing program. This program optimizes the existing query processing, stores the commonly used query results according to the query frequency, to be directly used by the subsequent queries or used as intermediate query results, thus avoiding possible transmission of a large number of data, thereby reducing the query time and improving query efficiency.

关键词： distributed database query optimization data dictionary

来源：评论

学校读者我要写书评

暂无评论

A Tree-based Genetic Algorithm for distributed database

A Tree-based Genetic Algorithm for Distributed Database

引用

IEEE International Conference on Automation and Logistics

作者： Li, Hongxing Luo, Bingzhang Beijing Union Univ Automat Coll Beijing 100101 Peoples R China Shanghai Pudong Int Airport Co Ltd AOC Dept Shanghai 201202 Peoples R China

ISBN: (纸本)9781424425020

The successful application of genetic algorithms in distributed database greatly depends on appropriate coding method for query optimization because the coding method of parameters can directly affect the construction of genetic operators and performance of the algorithms. Considering a combinatorial optimum with the restriction of both the position and the condition to include a lot of messages, this paper aims to devise a new coding method with tree structure based on the position and the value. Besides, the genetic operators, i.e. reproduction, crossover and mutation are designed for this coding. The improved crossover needs to be implemented by two steps and the improved mutation is composed of the value mutation and the position mutation. The proposed algorithm is used to implement query of distributed database, the experiment results showed that it is very effective for optimization.

关键词： genetic algorithm coding method genetic operators distributed database

来源：评论

学校读者我要写书评

暂无评论

Security and Efficient Data Verification Protocol for distributed database based on Zero-knowledge Proof 27

Security and Efficient Data Verification Protocol for Distri...

引用

27th International Conference on Computer Supported Cooperative Work in Design (CSCWD)

作者： Liu, Han Bai, YunXu Cent South Univ Sch Mech & Elect Engn Changsha Peoples R China

ISBN: (纸本)9798350349184;9798350349191

Recently, distributed databases have achieved tremendous realistic performances and developed one of the most essentially utilized tools in society communication applications. However, the existing distributed databases often contain users' sensitive information and are vulnerable to web attackers, which may cause severe privacy issues and economic loss. In this paper, we first attempt to propose a novel protocol to dispose of the potential verification risks in distributed databases. Compared with currently distributed databases, the requester can steal important data without any payment. Therefore, our model faces two primary challenges including guaranteeing the efficiency and security of the distributed databases, the data verification procedure may lead to data leakage. To address the above problems, we utilize zero-knowledge proof to dispose of the data verification issue for the requester. Moreover, a secure and effective proof protocol is established to achieve database responses the privacy data access. From our extensive experimental results, we can conclude that our developed framework can achieve an effective performance with reasonable communication costs.

关键词： distributed database Data Verification Security Zero-knowledge Proof

来源：评论

学校读者我要写书评

暂无评论

Fuzzy c-Lines for Vertically distributed database with Missing Values 12

Fuzzy c-Lines for Vertically Distributed Database with Missi...

引用

Joint 12th International Conference on Soft Computing and Intelligent Systems / 23rd International Symposium on Advanced Intelligent Systems (SCIS and ISIS)

作者： Kunisawa, Kohei Honda, Katsuhiro Ubukata, Seiki Notsu, Akira Osaka Prefecture Univ Grad Sch Engn Sakai Osaka 5998531 Japan Osaka Metropolitan Univ Grad Sch Informat Sakai Osaka 5998531 Japan Osaka Metropolitan Univ Grad Sch Sustainable Syst Sci Sakai Osaka 5998531 Japan

ISBN: (纸本)9781665499248

Privacy preserving data clustering is a useful method for extracting intrinsic cluster structures from distributed databases keeping personal privacy. In a previous research, a model of performing Fuzzy c-Lines clustering was proposed, where a privacy preserving scheme of k-means-type model was adopted with cryptographic calculation. This paper further improves the model for handling incomplete data ignoring the influences of missing values. The element-wise clustering criterion enables to derive local principal component vectors in each data sources by considering minimization of low-rank approximation of observed elements only. Then, fuzzy memberships of each object are calculated in a collaborative manner among organizations, where partial distances between objects and prototypes are derived with cryptographic framework so that intra-organization information is kept secret. The characteristic features of the proposed method are demonstrated through numerical experiments.

关键词： Fuzzy clustering Linear clustering distributed database

来源：评论

学校读者我要写书评

暂无评论

Lock Violation for Fault-tolerant distributed database System 37

Lock Violation for Fault-tolerant Distributed Database Syste...

引用

37th IEEE International Conference on Data Engineering (IEEE ICDE)

作者： Guo, Hua Zhou, Xuan Cai, Le Renmin Univ China Sch Informat Beijing Peoples R China East China Normal Univ Shanghai Engn Res Ctr Big Data Management Shanghai Peoples R China Alibaba Grp San Mateo CA USA

ISBN: (纸本)9781728191843

Modern distributed database systems scale horizontally by partitioning their data across a large number of nodes. Most such systems build their transactional layers on a replication layer, employing a consensus protocol to ensure data consistency to achieve fault tolerance. Synchronization among replicated state machines thus becomes a significant overhead of transaction processing. Without careful design, synchronization could amplify transactions' lock duration and impair the system's scalability. Speculative techniques, such as Controlled Lock Violation (CLV) and Early Lock Release (ELR), prove useful in shortening lock's critical path and boosting transaction processing performance. To use these techniques to optimize geo-replicated distributed databases(GDDB) is an intuitive idea. This paper shows that a naive application of speculation is often unhelpful in a distributed environment. Instead, we introduce distributed Lock Violation (DLV), a specialized speculative technique for geo-replicated distributed databases. DLV can achieve good performance without incurring severe side effects.

关键词： distributed database Transaction Locking High Availability

来源：评论

学校读者我要写书评

暂无评论

Multilevel Policy Based Security in distributed database 1

引用

1st International Conference on Advances in Computing and Communications

作者： Batra, Neera Singh, Manpreet Department of Computer Engineering M. M. Engineering College M. M. University Mullana

ISBN: (数字)9783642227097

ISBN: (纸本)9783642227080

Addressing security demands under fixed budgets and tight time constraints are becoming extremely challenging, time consuming and resource intensive. Moreover, securing the distributed database in compliance with several security guidelines makes the system more complex. Mission critical systems, military, government and financial institutions have been under tremendous pressure to secure their databases. Such requirements mandate that each system passes a strict security scan before it is deemed suitable to go into operational mode. This paper presents a framework that embeds security capabilities into distributed database by replicating different predefined security policies at different sites using multilevel secure database management system.

关键词： Policy based security Replication Multilevel secure database Covert channel distributed database

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for mining global frequent itemsets based on distributed database

Fast algorithm for mining global frequent itemsets based on ...

引用

1st International Conference on Rough Sets and Knowledge Technology (RSKT 2006)

作者： He, Bo Wang, Yue Yang, Wu Chen, Yuan ChongQing Inst Technol Sch Comp Sci & Engn Chongqing 400050 Peoples R China

ISBN: (纸本)3540362975

There were some traditional algorithms for mining global frequent itemsets. Most of them adopted Apriori-like algorithm frameworks. This resulted a lot of candidate itemsets, frequent database scans and heavy communication traffic. To solve these problems, this paper proposes a fast algorithm for mining global frequent itemsets, namely the FMGFI algorithm. It can easily get the global frequency for any itemsets from the local FP-tree and require far less communication traffic by the searching strategies of top-down and bottom-up. It effectively reduces existing problems of most algorithms for mining global frequent itemsets. Theoretical analysis and experimental results suggest that the FMGFI algorithm is fast and effective.

关键词： global frequent itemsets distributed database FP-tree FP-growth

来源：评论

学校读者我要写书评

暂无评论

Cassandra-A distributed database System: An Overview

Cassandra-A Distributed Database System: An Overview

引用

Springer International Conference on Emerging Technologies in Data Mining and Information Security (IEMIS)

作者： Wahid, Abdul Kashyap, Kanupriya Natl Inst Technol Patna Dept Comp Sci & Engn Patna 800005 Bihar India Natl Inst Technol Kurukshetra Dept Comp Engn Kurukshetra 136119 Haryana India

ISBN: (纸本)9789811319518;9789811319501

In big data environment, apache Cassandra is a distributed database which offers very high availability. It is an open source database system and is designed to manage large transactional data across various server globally. Main feature of Cassandra is to provide high availability and very high fault tolerance, decentralized database system with zero downtime. A traditional relational database (RDBMSs) is used to storing data for various applications from many years, but some changes are required because application must be scale to levels that were unimaginable. But only scaling is not the main concern of changes, companies are also requires such type of applications that always available and running fast where RDBMS database fail. Apache Cassandra is a fully distributed database that has such type of architecture where it handles extreme data velocity with highly availability, scalability and recovers from fault tolerance easily. In Cassandra architecture, there is no master node to handle all the nodes in the ring or network. The data distribution among nodes in this architecture is in equal probation. Cassandra creates such type of environment where an entire datacenter can lose but still perform as if nothing happened. This paper provides a brief idea about Cassandra.

关键词： distributed database Cassandra Decentralized Fault tolerant

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共52页 << < 2 3 4 5 6 7 8 9 10 11 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：