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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

497 篇 会议
10 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

197 篇 工学
- 185 篇 计算机科学与技术...
- 96 篇 软件工程
- 37 篇 信息与通信工程
- 26 篇 电气工程
- 13 篇 控制科学与工程
- 10 篇 材料科学与工程（可...
- 9 篇 电子科学与技术（可...
- 4 篇 网络空间安全
- 3 篇 安全科学与工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 土木工程
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 冶金工程
54 篇 理学
- 48 篇 数学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 2 篇 生物学
- 1 篇 地质学
34 篇 管理学
- 28 篇 管理科学与工程(可...
- 14 篇 工商管理
- 8 篇 图书情报与档案管...
4 篇 经济学
- 4 篇 应用经济学
2 篇 法学
- 2 篇 社会学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
1 篇 军事学

主题

93 篇 computer science
79 篇 concurrent compu...
71 篇 distributed comp...
67 篇 application soft...
65 篇 database systems
62 篇 parallel process...
59 篇 databases
57 篇 distributed data...
43 篇 transaction data...
42 篇 delay
39 篇 computer archite...
37 篇 algorithm design...
36 篇 costs
36 篇 relational datab...
35 篇 hardware
30 篇 processor schedu...
30 篇 large-scale syst...
27 篇 computational mo...
27 篇 performance anal...
27 篇 computer network...

机构

7 篇 ibm thomas j. wa...
4 篇 department of co...
3 篇 ieee
3 篇 king saud univer...
3 篇 school of comput...
3 篇 department of co...
2 篇 department of co...
2 篇 toyohashi univer...
2 篇 center for paral...
2 篇 department of co...
2 篇 school of comput...
2 篇 computer science...
2 篇 department of el...
2 篇 university of el...
2 篇 school of comput...
2 篇 department of bi...
2 篇 school of comput...
2 篇 eth zurich
2 篇 computer science...
2 篇 computer science...

作者

6 篇 a. choudhary
5 篇 j. saltz
4 篇 t. kurc
4 篇 a. boukerche
4 篇 a. el abbadi
3 篇 f. dehne
3 篇 p.s. yu
3 篇 wan maseri wan m...
3 篇 a. bar-noy
3 篇 s. kipnis
3 篇 g. gupta
3 篇 jasni mohamad za...
3 篇 eyas el-qawasmeh
3 篇 d. agrawal
2 篇 a. burger
2 篇 a. rau-chaplin
2 篇 a. ghafoor
2 篇 s. bandyopadhyay
2 篇 hoefler torsten
2 篇 o. wolfson

语言

512 篇 英文
1 篇 其他

检索条件"任意字段=Proceedings of the Second International Symposium on Databases in Parallel and Distributed Systems"

共 513 条记录，以下是421-430 订阅

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

详细简洁

排序：

CONCEPTS AND METHODS FOR THE OPTIMIZATION OF distributed DATA-PROCESSING 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： JABLONSKI, S RUF, T WEDEKIND, H Department of Computer Science VI (Data Base Systems) University of Erlangen-Nuernberg Martensstrasse 3 D-8520 Erlangen

ISBN: (纸本)0818620528

In this paper we introduce and discuss a model of distributed data processing. For this purpose, a typical application system is analyzed and divided into sub-applications. To fulfill the task of the global application, the sub-applications have to communicate in an appropriate manner by exchanging data resp. information. In our model the communication between sub-applications is split up into two steps: the offering of information by sending sub-applications, and its acceptance by receiving sub-applications. For both communication steps synchronous and asynchronous processing modes are defined. Supporting those different communication modes the cooperation between sub-applications can be defined very closely to the specific demands of the application system. This optimizes distributed data processing. At last we demonstrate the prototype implementation of a distributed data management system, which is based on the flexible communication mechanism described in the paper.

关键词： Data processing

来源：评论

学校读者我要写书评

暂无评论

USING JOIN OPERATIONS AS REDUCERS IN distributed QUERY-PROCESSING 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： CHEN, MS YU, PS IBM Thomas J. Watson Research Center P.O. Box 704 Yorktown Heights New York

ISBN: (纸本)0818620528

Semijoin has traditionally been relied upon for reducing the communication cost required for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the communication cost. In view of this fact, we explore in this paper the approach of using join operations, in addition to semijoins, as reducers in distributed query processing. We first show that the problem of determining a sequence of join operations for a query graph can be transformed to that of finding a set of cuts to that graph, where a cut to a graph is a partition of the nodes in that graph. In light of the mapping we develop an efficient heuristic algorithm to determine an effective sequence of join reducers for a query. The algorithm using the concept of divide-and-conquer is shown to have polynomial time complexity. Examples are also given to illustrate our results.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

JOYCE+ - MODEL AND LANGUAGE FOR MULTISITE distributed systems 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： FRANKY, MC SINBAD Research Group Computer Science Department University of Los Andes Apartado Aéreo Bogotá Colombia

ISBN: (纸本)0818620528

The models and languages most widely used for distributed systems programming (such as ADA, CSP, and OCCAM) do not explicitly consider the process execution site, they assume a synchronous communication scheme of “rendezvous” style, and require that each process recognize the names of their interlocutors. JOYCE+ is a modification of the JOYCE language defined by Brinch Hansen [Brinch 87, Brinch 89]. In the JOYCE+ model each process is executed in a specific site, it is assumed that the communication between processes at the same site is much more faster than between processes at different sites, and it is also assumed that the communication between processes is not always reliable. For this multi-site environment an asynchronous communication scheme is considered, eliminating waiting states for a process that sends a message to another process. Furthermore, modelling communication between processes through “channel” objects, the spaces for process names become *** this paper the JOYCE+ model for multi-site distributed systems is presented and the operational semantic of the asynchronous communication between processes is illustrated with Petri Nets. The syntax of the JOYCE+ language is presented in terms of the Guarded Commands language [Dijkstra 75]. The expressive power of the JOYCE+ language in distributed synchronization problems with timeout handling is illustrated through examples. Finally, we discuss about software development environments (based on JOYCE+) for distributed systems over multi- and mono-process computer *** Terms - Languages for distributed systems, Tools and methodologies for distributed systems.

关键词： tools and methodologies for distributed systems languages for distributed systems

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT parallel ALGORITHMS FOR FUNCTIONAL DEPENDENCY MANIPULATIONS 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： SRIDHAR, R IYENGAR, SS Department of Computer Science Louisiana State University Baton Rouge LA

ISBN: (纸本)0818620528

Given a set of functional dependencies Σ and a single dependency σ, we show that the algorithm to test whether Σ implies σ is log-space complete in P. The functional dependencies Σ are represented as a directed hypergraph HΣ [1]. We first present a parallel algorithm which solves the above implication problem using P processors on a EREW-PRAM in Ο(e/P + ***) time and on a CRCW-PRAM in Ο(e/P + n) time, where e and n are the number of arcs and nodes of the graph HΣ. For graphs HΣ with fixed degree and diameter, we show that the closure HΣ+ can be computed in NC. We present NC algorithms to obtain a non-redundant and a LR-Minimum cover for the set of functional dependencies Σ. All our algorithms on a n-node directed hypergraph with fixed degree and diameter can be implemented to run in Ο(log2n) time with M(n) processors on a CREW-PRAM model, where M(n) is the cost of multiplying two binary matrices. The algorithms are efficient based on the transitive closure bottleneck phenomenon [7] that is, any improvement in the time and processor complexity of the transitive closure algorithm will result in an improvement by the same amount for the algorithms presented here.

关键词： functional dependency processor complexity minimal cover directed hyper-graph parallel algorithm log-space reduction NC algorithm time complexity non-redundant cover relational databases minimum cover

来源：评论

学校读者我要写书评

暂无评论

CORRECTING EXECUTION OF distributed QUERIES 90

引用

2ND international SYMP ON databases IN parallel AND distributed systems ( DPDS 90 )

作者： BODORIK, P PYRA, J RIORDON, JS School of Computer Science Technical University of Nova Scotia P.O. Box 1000 Halifax Nova Scotia B3J 2X4 Canada Dept. of Systems and Computer Engineering Carleton University Ottawa Ontario K1S 5B6 Canada

ISBN: (纸本)0818620528

Algorithms for processing distributed queries require a priori estimates of the size of intermediate relations. Most such algorithms take a “static” approach in which the algorithm is completely determined before processing begins. If size estimates are found to be inaccurate at some intermediate stage, there is no opportunity to re-schedule, and the result may be far from optimal. Adaptive query execution may be used to alleviate the problem. Care is necessary, though, to ensure that the delay associated with re-scheduling does not exceed the time saved through the use of a more efficient strategy. This paper presents a low overhead delay method to decide when to correct a strategy. Sampling is used to estimate the size of relations, and alternative heuristic strategies prepared in a background mode are used to decide when to correct. Correction is made only if lower overall delay is achieved, including correction time. Evaluation using a model of a distributed data base indicates that the heuristic strategies are near optimal. Moreover, it also suggests that it is usually correct to abort creation of an intermediate relation which is much larger than predicted.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

2nd IEEE symposium on parallel and distributed Processing, SPDP 1990

作者： Triantafillou, Peter Taylor, David Department of Computer Science University of Waterloo Canada

ISBN: (纸本)0818620870

This 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 data bases. © 1990 IEEE.

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Type inference and the Algebra of qualified relations

Type inference and the Algebra of qualified relations

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： D. Eichmann Department of Statistics and Computer Science West Virginia University Morgantown WV USA

The algebra of qualified relations proposed by Ceri and Pelagatti supports pruning of distributed database queries, minimizing the number of sites involved in evaluation. Domain interval typing in the framework of formal type inference subsumes this approach, pruning not only unsatisfiable subqueries involving fragmentation predicates, but also unsatisfiable subqueries mentioning any relation attribute.< >

关键词： Algebra distributed databases Database systems Relational databases Query processing Statistical distributions Computer science Application software Inference mechanisms Data models

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimizing connectionist datasets with ConSTrainer

Optimizing connectionist datasets with ConSTrainer

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： A.N. Refenes Department of Computer Sciences University College London London UK

In many connectionist applications training datasets lie usually selected randomly from databases. Such datasets are not guaranteed to represent the entire task domain fairly, and there is often a requirement to pre-process the dataset for compression and normalization. ConSTrainer is a window-based toolkit dedicated to the task of collecting and optimizing datasets for training connectionist networks. One of the most important features of ConSTrainer is its support for optimizing and validating training datasets. Two types of optimization features are examined in this paper: malicious training vector detection, and dataset compression. This paper describes ConSTrainer's facilities for optimizing connectionist datasets and demonstrates their utilization in a non-trivial application for diagnostic decision support in Histopathology.< >

关键词： Constraint optimization Diagnostic expert systems Knowledge engineering Computer science Application software Spatial databases Data mining Decision support systems Laboratories Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：