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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

8,827 篇 会议
1,603 篇 期刊文献
22 册 图书
8 篇 学位论文

馆藏范围

10,459 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

3,184 篇 工学
- 2,195 篇 计算机科学与技术...
- 1,719 篇 电气工程
- 874 篇 信息与通信工程
- 489 篇 软件工程
- 274 篇 控制科学与工程
- 130 篇 仪器科学与技术
- 86 篇 电子科学与技术（可...
- 52 篇 机械工程
- 46 篇 交通运输工程
- 38 篇 网络空间安全
- 37 篇 测绘科学与技术
- 18 篇 生物医学工程（可授...
- 16 篇 航空宇航科学与技...
- 15 篇 动力工程及工程热...
- 14 篇 石油与天然气工程
- 12 篇 材料科学与工程（可...
- 12 篇 环境科学与工程（可...
401 篇 管理学
- 365 篇 管理科学与工程(可...
- 39 篇 图书情报与档案管...
- 19 篇 工商管理
- 14 篇 公共管理
233 篇 理学
- 94 篇 数学
- 50 篇 系统科学
- 29 篇 物理学
- 19 篇 地球物理学
- 17 篇 生物学
- 12 篇 化学
74 篇 医学
- 49 篇 临床医学
- 21 篇 基础医学(可授医学...
53 篇 文学
- 51 篇 新闻传播学
13 篇 农学
12 篇 经济学
7 篇 教育学
5 篇 艺术学
3 篇 法学
1 篇 哲学
1 篇 军事学

主题

10,460 篇 distributed data...
1,641 篇 data models
1,140 篇 servers
810 篇 computational mo...
726 篇 big data
714 篇 cloud computing
698 篇 computer archite...
656 篇 training
595 篇 protocols
546 篇 database systems
543 篇 computer science
517 篇 data privacy
492 篇 data mining
441 篇 scalability
363 篇 conferences
349 篇 query processing
345 篇 federated learni...
344 篇 monitoring
327 篇 optimization
314 篇 bandwidth

机构

18 篇 university of ch...
17 篇 tsinghua univers...
16 篇 department of co...
16 篇 institute of com...
15 篇 xidian univ stat...
14 篇 ibm thomas j. wa...
14 篇 nanyang technol ...
13 篇 school of comput...
13 篇 ibm research
12 篇 huazhong univers...
12 篇 argonne national...
12 篇 cent south univ ...
11 篇 city univ hong k...
11 篇 tsinghua univ de...
11 篇 south china univ...
11 篇 school of comput...
10 篇 department of co...
10 篇 huazhong univ sc...
10 篇 department of co...
10 篇 graz university ...

作者

15 篇 jun wang
14 篇 yong chen
12 篇 jing zhang
12 篇 liu yang
12 篇 hui li
12 篇 s.h. son
12 篇 hai jin
10 篇 alfredo cuzzocre...
10 篇 li li
10 篇 yang yang
10 篇 yijie wang
10 篇 fatos xhafa
9 篇 lei wang
9 篇 kalman graffi
9 篇 li bo
8 篇 li yang
8 篇 li zhang
8 篇 wei li
8 篇 gagan agrawal
8 篇 jeremy kepner

语言

10,363 篇 英文
55 篇 其他
40 篇 中文
2 篇 俄文

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

共 10460 条记录，以下是201-210 订阅

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

详细简洁

排序：

Adaptive protocols for managing replicated distributed databases

Adaptive protocols for managing replicated distributed datab...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： A. El Abbadi Department of Computer Science University of California Santa Barbara CA USA

The author proposes a family of adaptive protocols for managing replicated databases. Adaptive protocols use information about the system configuration to determine how operations are executed. Special system transactions are executed to maintain this information in view objects. The author proposes using static as well as dynamic methods to execute both system and user transactions. This results in a modular methodology for designing four different protocols. Two of these protocols are new and present the system designer with several alternatives when compared with the previously known protocols.< >

关键词： distributed databases Access protocols Costs Database systems Transaction databases Fault tolerant systems Concurrency control Control systems Computer science Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

The complexity of processing tree queries in distributed databases

The complexity of processing tree queries in distributed dat...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： Chihping Wang Department of Computer Sciences University of California Riverside CA USA

Semi-joins have been introduced to reduce the cost of processing distributed queries. The determine the optimal semi-join processing strategy, one must consider both the reduction effect and the transmission overhead. Researchers have studied the problem of finding the optimal semi-join strategies for processing tree queries. Although a number algorithms have been proposed, they either have a very high complexity or only solve special cases. It is conjectured that the tree query processing problem is inherently difficult. The author formally answers this question by proving it NP-hard.< >

关键词： distributed databases Query processing Costs Computer science Database systems distributed computing Data models Marine vehicles Computational complexity Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

Querying Web distributed databases for XML-based e-businesses: requirement analysis, design, and implementation

Querying Web distributed databases for XML-based e-businesse...

引用

Australasian Database Conference (ADC)

作者： H. Ishikawa M. Ohta Department of Electronics & Information Eng Tokyo Metropolitan University Japan

ISBN: (纸本)0769509665

Electronic commerce (EC) business models like e-brokers on the Web use XML databases such as product and customer data. To flexibly model such applications, we need a modeling language for EC businesses, that is, business processes. To this end, we have adopted a query language approach to modeling and have designed a query language for distributed XML databases called XBML suitable for EC businesses. We discuss the requirements for an XML query language for supporting EC business models and explain the functionality of XBML by specifying e-broker models and describe the implementation of the XBML server.

关键词： distributed databases XML Database languages Electronic commerce Data models Information analysis Information systems Bridges Context modeling HTML

来源：评论

学校读者我要写书评

暂无评论

Views and Updates over distributed databases

Views and Updates over Distributed Databases

引用

International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

作者： Elena V. Ravve Department of Software Engineering Ort Braude College Israel

This contribution deals with systematic exploitation of logical reduction techniques to databases. The particular applications are views and updates over distributed databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations, where a relational structure is pieced together from a set of sub-structures. The reduction describes how the queries over the structure can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to generalize the propagation technique for relational algebra and the incremental re-computation technique for some kinds of Data log programs to cases of definable sets of tuples to be deleted or inserted.

关键词： distributed databases Indexes Airports Silicon Calculus Complexity theory

来源：评论

学校读者我要写书评

暂无评论

An integrated method for mining association and sequential rules in distributed databases

An integrated method for mining association and sequential r...

引用

Joint World Congress of International Fuzzy Systems Association and International Conference on Soft Computing and Intelligent Systems (IFSA-SCIS)

作者： Jih-Jeng Huang Computer Science & Information Management Soochow University Chungcheng District Taipei City Taiwan

ISBN: (纸本)9781509049189

Association and sequential rules have received much attention in both academia and in practice for quite some time. A number of algorithms have been proposed to improve the efficiency of mining decision rules. However, these centralized algorithms have been criticized for their inapplicability to distributed environments. Although many sophisticated distributed algorithms for mining association and sequential rules have been proposed in recent years, they are not supported by most popular software programs; this decreases the possible applications of decision rules. In addition, past decision rules have only focused on the rules for which items exist. Some important decision rules might be lost if suitable items do not exist. In this paper, we propose an integrated framework to combine centralized algorithms, such as the Frequent Pattern Growth (FP-Growth), Sequential Pattern Discovery using Equivalence classes (SPADE), and rough set algorithms, to mine decision rules in a distributed environment. In addition, our method finds some significant rules that other algorithms cannot. The experiments also demonstrate that the proposed method is well suited to finding association and sequential rules in a distributed environment.

关键词： Algorithm design and analysis Data mining Itemsets distributed databases Software algorithms Rough sets

来源：评论

学校读者我要写书评

暂无评论

A new paradigm for high availability and efficiency in replicated distributed databases

A new paradigm for high availability and efficiency in repli...

引用

International Symposium on Parallel and distributed Processing (IPDPS)

作者： P. Triantafillou D. Taylor Department of Computer Sciences University of Waterloo Canada

The paper presents a new paradigm for replication. Its major goal is to achieve performance similar to systems that do not employ replication and, at the same time, to offer the availability benefits that result from replication. The paradigm contributes two mechanisms. The first mechanism is an extended location service, for which it uses a logically centralized implementation. In addition, it modifies the traditional transaction-processing mechanism to interact with the location service inexpensively during transaction execution. The second mechanism is a priority-based, preemptive concurrency control algorithm which allows locks to be synchronously acquired at only a single replica. In addition, the paradigm exhibits desirable availability characteristics, satisfies the one-copy serializability correctness criterion and is easy to implement. For these reasons it is presented as a basis for designing efficient and highly available distributed databases.< >

关键词： Availability distributed databases Costs Collaboration Computer science Concurrency control Context Computer networks distributed computing Communication networks

来源：评论

学校读者我要写书评

暂无评论

An indicator of robustness for distributed databases

An indicator of robustness for distributed databases

引用

Australian and New Zealand Conference on Intelligent Information Systems

作者： E. Yuen V.L. Narasimhan Information Technology Division Defence Science and Technology Organisation Australia

Wide area distributed databases (DDB) can increase their robustness by copying data at a number of sites around the network. This redundancy lets clients access the most convenient server site which holds the desired data. If a communication link to a particular server is lost or a server crashes, the client can access another server that holds the same data. We propose a simple measure of the robustness of data in a wide area network, probability of an isolated node, P/sub isol/. This indicator is dependent on the topology of the network and the number and position of data copies within the network. Due to the complexity of the algorithm for calculating this indicator, we investigate the method of /spl Delta/-Y transformations and how they can be applied to calculate P/sub isol/ and look at some simpler indicators of robustness such as the number of disjoint paths. P/sub isol/=0 if every site was a server. However the problem of replica control reduces the performance of this scenario. We discuss the concept of replica control and its relationship to robustness. We hope that this indicator can be used by designers of DDB systems and in DDB management algorithms to measure data availability.

关键词： Robustness distributed databases Network servers Computer crashes Area measurement Wide area networks Network topology Robust control Algorithm design and analysis Availability

来源：评论

学校读者我要写书评

暂无评论

Developing a pieces of data allocation method in distributed databases using Bayesian networks

Developing a pieces of data allocation method in distributed...

引用

International Congress on Technology, Communication and Knowledge (ICTCK)

作者： Soheil Pourhaji Mohammad Hossein Moattar Department of Software Engineering Neyshabur Branch Islamic Azad University Neyshabur Iran Department of Software Engineering Mashhad Branch Islamic Azad University Mashhad Iran

ISBN: (纸本)9781467397636

Determining the location of the storage of data on different nodes of a distributed system is called allocation of pieces of data and is considered as the most important factor influencing the cost of the implementation of distributed database. Allocation of piece of data is a NP-hard problem that needs heuristic solutions. The main purpose of the process is to allocate parts with the lowest cost to the node that has the most access to the data segment. In this article, in terms of a structural oriented learning method, using analysis of the factors influencing the process of allocating a piece of data to a node, (i.e. distance from apiece of data, cost, node loading, availability of data, etc), the dependence relations between adjacent nodes to target nodes was determined and the structure of Bayesian network was obtained. In the second stage, the obtained Bayesian network is trained using gradient method and tested using the data collected from the data collection x. The proposed model efficiency is compared with the results of Huang and Chen's method which have used a heuristic approach using the imperialist competitive algorithm. The results indicate that this model is an efficient tool in the optimization process of allocating Pieces of Data in the distributed systems.

关键词： Bayes methods distributed databases Resource management Heuristic algorithms Bandwidth Maximum likelihood estimation Data collection

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Concurrency Control Algorithm for Multilevel Secure distributed databases

Performance Evaluation of Concurrency Control Algorithm for ...

引用

Student Conference on Engineering, Sciences and Technology

作者： N. Kaur A.K. Sarje M. Misra Department of Electronics and Computer Engineering Indian Institute of Technology Roorkee Roorkee Uttarakhand India

Majority of the research in multilevel secure database management systems (MLS/DBMS) focuses primarily on centralized database systems. However, with the demand for higher performance and higher availability, database systems have moved from centralized to distributed architectures, and the research in distributed database management systems (MLS/DDBMS) is gaining more and more prominence. Concurrency control is an integral part of database systems. Secure concurrency control algorithms [15,17,18,29,] proposed in literature achieve correctness and security at the cost of declined performance of high security level transactions. These algorithms infringe the fairness in processing transactions at different security levels. Though the performance of different concurrency control algorithms have been explored extensively for centralized multilevel secure database management systems [11,31] but to the best of author’s knowledge the relative performance of transactions at different security levels using secure concurrency control algorithm for has not been reported yet. To fill this gap, this paper presents a detailed simulation model of a multilevel secure distributed database system and investigates the performance price paid for maintaining security in a MLS/DDBMS. The paper investigates the relative performance of transactions at different security levels.

关键词： Concurrency control distributed databases Data security Database systems Information security Multilevel systems Transaction databases Delay distributed computing Data engineering

来源：评论

学校读者我要写书评

暂无评论

An efficient transitive closure algorithm for distributed databases

An efficient transitive closure algorithm for distributed da...

引用

International Conference on Computing and Information (ICCI)

作者： I.H. Toroslu L. Henschen Department of EECS Northeastern University Evanston IL USA

Because most of the recognizable queries in deductive databases can be transformed into transitive-closure (TC) problem, the development of efficient algorithms to process the different forms of TC problems within the context of large database systems has recently attracted a large amount of research efforts. However, the parallelization of the computation of TC is still a new issue and there are only a few and recent parallel TC algorithms. Most of these parallel algorithms mere developed for shared-nothing architectures. We present a new efficient algorithm for full TC problem for shared-nothing architecture. Using simulation, we also study and examine the performance of the algorithm.< >

关键词： distributed databases Deductive databases distributed computing Operating systems Logic Tree graphs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：