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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,668 篇 会议
194 篇 期刊文献
27 册 图书

馆藏范围

4,889 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,499 篇 工学
- 2,385 篇 计算机科学与技术...
- 1,470 篇 软件工程
- 419 篇 信息与通信工程
- 385 篇 电气工程
- 193 篇 控制科学与工程
- 159 篇 电子科学与技术（可...
- 75 篇 网络空间安全
- 33 篇 材料科学与工程（可...
- 33 篇 生物医学工程（可授...
- 26 篇 机械工程
- 26 篇 安全科学与工程
- 21 篇 光学工程
- 21 篇 动力工程及工程热...
- 21 篇 生物工程
- 20 篇 建筑学
- 19 篇 土木工程
- 17 篇 力学（可授工学、理...
- 17 篇 环境科学与工程（可...
- 15 篇 交通运输工程
792 篇 理学
- 669 篇 数学
- 103 篇 统计学（可授理学、...
- 89 篇 系统科学
- 66 篇 物理学
- 29 篇 生物学
- 19 篇 化学
451 篇 管理学
- 322 篇 管理科学与工程(可...
- 229 篇 工商管理
- 153 篇 图书情报与档案管...
51 篇 经济学
- 51 篇 应用经济学
18 篇 法学
- 17 篇 社会学
15 篇 医学
9 篇 教育学
9 篇 农学
5 篇 文学
4 篇 军事学

主题

564 篇 distributed comp...
540 篇 computer science
490 篇 parallel process...
485 篇 concurrent compu...
410 篇 parallel process...
379 篇 application soft...
342 篇 distributed data...
335 篇 distributed comp...
310 篇 databases
288 篇 computer archite...
249 篇 database systems
222 篇 computational mo...
220 篇 delay
215 篇 hardware
211 篇 costs
188 篇 processor schedu...
172 篇 protocols
170 篇 computer network...
162 篇 large-scale syst...
152 篇 parallel program...

机构

20 篇 ibm thomas j. wa...
11 篇 department of co...
10 篇 department of co...
8 篇 school of comput...
8 篇 department of co...
8 篇 department of co...
7 篇 ieee
7 篇 department of co...
7 篇 department of ee...
7 篇 department of co...
7 篇 college of compu...
7 篇 hewlett packard ...
7 篇 northwestern uni...
6 篇 department of co...
6 篇 syracuse univ sy...
6 篇 department of co...
6 篇 department of co...
6 篇 lawrence berkele...
6 篇 college of compu...
6 篇 univ of californ...

作者

20 篇 a. choudhary
16 篇 a. boukerche
10 篇 s.k. das
10 篇 boukerche azzedi...
10 篇 choudhary a
10 篇 li keqin
9 篇 j. saltz
9 篇 sun xian-he
9 篇 choudhary alok
9 篇 k. schwan
9 篇 das sajal k.
8 篇 l.r. welch
8 篇 a. makinouchi
8 篇 chen haibo
8 篇 anon
8 篇 a.a. chien
7 篇 c. katsinis
7 篇 t. kurc
7 篇 d.k. panda
7 篇 keqin li

语言

4,876 篇 英文
11 篇 其他
2 篇 中文

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

共 4889 条记录，以下是4611-4620 订阅

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

详细简洁

排序：

A hardware and software architectural model for the manipulation of genetic databases

A hardware and software architectural model for the manipula...

引用

international Conference on parallel and distributed Information systems

作者： R.G. Marshall Department of Computer Science Florida Institute of Technology Melbourne FL USA

Summary form only given. The authors describe a hardware and software architectural model for the characterization and analysis of genomes of select organisms. The data for research is obtained by semantically relating existing heterogeneous genetic databases. The authors have developed an architectural model based on associative memory structures at the hardware level and an object-oriented model at the software level. Simulation studies are under way to establish the appropriateness of a system based on a set of tagged associative processors operating in parallel which can be used for gene sequencing and analysis. They have identified primitive instructions on the machine which are consonant with biologists' map manipulation and usage requirements.< >

关键词： Hardware Object oriented modeling Biological system modeling Genomics Bioinformatics Organisms Genetics Object oriented databases Associative memory Analytical models

来源：评论

学校读者我要写书评

暂无评论

Adaptive parallel hash join in main-memory databases

Adaptive parallel hash join in main-memory databases

引用

international Conference on parallel and distributed Information systems

作者： A.M. Keller S. Roy Stanford University and Advanced Decision Systems USA Computer Science Department Shell Development Company

Presents an algorithm for parallel hash-join computation on main-memory databases that adapts to data skew, and its implementation on the IBM RP3 multiprocessor. The algorithm exploits the random access capabilities of main memory databases to detect and counteract skew on the fly. Data skew is detected at run time by monitoring the observed frequencies of values of the join attribute and applying to them a threshold function that takes account of the distribution of workload among processors. If and when this threshold is reached for certain values of the join attribute, the computation corresponding to it is fragmented among an appropriate number of processors. Fragmentation requires some replication of input tuples-modestly increasing the total workload, but reduces the completion time significantly by reducing workload at the overloaded processor. A simplified analysis is supplemented by experiments. The description and analysis of the algorithm are based on the shared-nothing model. The implementation uses hierarchical shared memory providing non-uniform memory access.< >

关键词： databases Concurrent computing Scheduling algorithm Computer science Processor scheduling Load management Monitoring Frequency Algorithm design and analysis Degradation

来源：评论

学校读者我要写书评

暂无评论

Load balancing algorithms for parallel database processing on shared memory multiprocessors

Load balancing algorithms for parallel database processing o...

引用

international Conference on parallel and distributed Information systems

作者： Y. Hirano T. Satoh U. Inoue K. Teranaka NTT Network Information Systems Laboratories Yokosuka Kanagawa Japan

This paper describes new load balancing algorithms for parallel database processing on shared memory multiprocessors. The goal of load balancing is to reduce overhead as well as load imbalance, but there is a tradeoff between them in ordinary algorithms. Unfortunately, optimum performance can hardly be obtained using ordinary algorithms because their performances depend on several factors such as database size, the number of processors and data distribution. The proposed algorithms solve these problems by varying the number of tasks allocated at a time ( which was fixed in ordinary algorithms ) according to the number of remaining tasks and the maximum and minimum processing times of a task. Performance evaluations show that the proposed algorithms achieve fair load balancing with lower overhead independent of the above factors.< >

关键词： Load management Relational databases Information systems Laboratories Management information systems Acceleration distributed databases System performance

来源：评论

学校读者我要写书评

暂无评论

Populating databases from multiple sources-the Hubble space telescope paradigm

Populating databases from multiple sources-the Hubble space ...

引用

international Conference on parallel and distributed Information systems

作者： D.P. Silberberg Space Telescope Science Institute Baltimore MD USA

Summary form only given. The Hubble space telescope (HST) Ingest program reads files representing external database tables of any topology, normalizes or joins the tables to the HST catalog database topology, parses and converts data values, and writes the tuples to the HST catalog. Ingest is driven by translation tables defining the interdatabase mapping and can be altered on-the-fly. Ingest has proven to be a powerful tool in an environment where multiple databases rapidly evolve.< >

关键词： Telescopes Topology Optical design Database systems Optical recording Writing Production Power system management Conference management

来源：评论

学校读者我要写书评

暂无评论

Incremental evaluation of rules and its relationship to parallelism 91

Incremental evaluation of rules and its relationship to para...

引用

1991 ACM SIGMOD international Conference on Management of Data, SIGMOD 1991

作者： Wolfson, Ouri Dewan, Hasanat M. Stolfo, Salvatore J. Yemini, Yechiam Distributed Computing and Communications Laboratory 450 Computer Science Building Columbia University New YorkNY10027 United States

ISBN: (纸本)0897914252

Rule interpreters usually start with an initial database and perform the inference procedure in cycles, ending with a final database. In a real time environment it is possible to receive updates to the initial database after the inference procedure has started or even after it has ended. We present an algorithm for incremental maintenance of the deductive database in the presence of such updates. Interestingly, the same algorithm is useful for parallel and distributed rule processing in the following sense. When the processors evaluating a program operate asynchronously, then they may have different views of the database. The incremental maintenance procedure we present can be used to synchronize these views. © 1991 ACM.

关键词： Intelligent databases

来源：评论

学校读者我要写书评

暂无评论

Multiple wavefront algorithms for pattern-based processing of object-oriented databases

Multiple wavefront algorithms for pattern-based processing o...

引用

international Conference on parallel and distributed Information systems

作者： S.Y.W. Su Y.-H. Chen H. Lam Database Systems Research and Development Center Department of Computer and Information Sciences University of Florida Gainesville FL USA

The authors have show previously (1989, 1991) that processing OODBs can be viewed as the manipulation of patterns of object associations. parallel, multiple wavefront algorithms based on an identification approach for verifying association patterns have been introduced. The current paper presents an elimination approach for processing OODBs. The new approach allows more processors to operate concurrently on a query, thus allowing a higher degree of parallelism in query processing. A formal proof of the correctness of the new approach is given, and a parallel elimination algorithm for processing tree queries is presented. Some simulation results are also provided to compare the performance of the identification approach with the elimination approach.< >

关键词： Object oriented databases Database systems Object oriented modeling Research and development Research and development management parallel algorithms parallel processing Query processing Design automation Computer aided manufacturing

来源：评论

学校读者我要写书评

暂无评论

An efficient data organization for parallel algorithmic design of cartographic database

An efficient data organization for parallel algorithmic desi...

引用

international Conference on parallel and distributed Information systems

作者： R. Dasgupta S. Bhattacharya Department of Computer Science University of Calcutta Calcutta India

Summary form only given. The authors propose an efficient data organization for the storage and subsequent retrieval of large volume of cartographic data. The concept of address squares has been used extensively. The inherent parallelism in the data has been explored in order to improve computational efficiency. Several parallel algorithms related to the analysis of the cartographic data based on the proposed data organisation, have also been presented.< >

关键词： Algorithm design and analysis Spatial databases parallel algorithms Shape measurement Computer science Information analysis Geographic Information systems Data mining Geometry Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Data skew and the scalability of parallel joins

Data skew and the scalability of parallel joins

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： C.B. Walton A.G. Dale Department of Computer Sciences University of Texas Austin Austin TX USA

When data are uniformly distributed, parallel join algorithms scale up well. However, scalability is curtailed by data skew-nonuniform distribution of data between processors. Investigation of this problem has been hampered by incomplete understanding of data skew as well as inadequate analytic performance models. The authors use a new model of data skew that addresses these shortcomings to examine the effects of skewed workloads on the scalability of the hybrid hash, scheduling hash, and sort-merge parallel join algorithms. Results indicate that the extent to which data skew degrades scalability varies with the join algorithm, the workload and the type of data skew. None of the three algorithms has the best scalability and response time in all cases.< >

关键词： Scalability Partitioning algorithms Delay Taxonomy Concurrent computing distributed computing Performance analysis Processor scheduling Degradation Relational databases

来源：评论

学校读者我要写书评

暂无评论

An O(N log/sub 2//sup 2/N) fault-tolerant decentralized commit protocol

An O(N log/sub 2//sup 2/N) fault-tolerant decentralized comm...

引用

Pacific Rim international symposium on Fault Tolerant systems

作者： Shyan-Ming Yuan Department of Computer & Information Science National Chiao Tung University Hsinchu Taiwan

ISBN: (纸本)081862275X

A new decentralized commit protocol is proposed for distributed database systems. This protocol can be applied to any size of systems and is (log/sub 2/N)-2 resilient to site failures where N is the number of sites in the system. In addition, the number of messages sent among N sites is O(N log/sub 2//sup 2/N) which is only a factor of log/sub 2/ N over the message complexity lower bound O(N ln N).< >

关键词： Fault tolerance Protocols Delay Fault tolerant systems Database systems distributed databases Transaction databases

来源：评论

学校读者我要写书评

暂无评论

parallel hierarchical evaluation of transitive closure queries

Parallel hierarchical evaluation of transitive closure queri...

引用

international Conference on parallel and distributed Information systems

作者： M.A.W. Houtsma F. Cacace S. Ceri Department of Computer Science University of Twente Dipartimento di Elettronica Politechnico di Milano

Presents a new approach to parallel computation of transitive closure queries using a semantic data fragmentation. Tuples of a large base relation denote edges in a graph, which models a transportation network. A fragmentation algorithm is proposed which produces a partitioning of the base relation into several fragments such that any fragment corresponds to a subgraph. One fragment, called high-speed fragment, collects all edges which guarantee maximum speed. Thus, the fragmentation algorithm induces a hierarchical relationship between the high-speed fragment and all other fragments. With this fragmentation, any query about paths connecting two nodes can be answered by using just the fragments in which nodes are located and the high-speed fragment. In general, if each fragment is managed by a distinguished processor, then the query can be answered by three processors working in parallel. This schema can be applied recursively to generate an arbitrary number of hierarchical levels.< >

关键词： parallel processing Deductive databases Logic functions Computer science Road transportation Joining processes Bridges Relational databases Art Algebra

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共489页 << < 458 459 460 461 462 463 464 465 466 467 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：