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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是251-260 订阅

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

详细简洁

排序：

Integrating relational databases with support for updates 88

引用

proceedings of the first international symposium on databases in parallel and distributed systems

作者： M. Samy Gamal-Eldin G. Thomas R. Elmasri MCS Department Clarkson University Potsdam NY Bellcore 444 Hoes Lane Piscataway NJ Computer Science Department University of Houston at University Park Houston TX

ISBN: (纸本)9780818608933

Most work on database integration has considered only support for data retrieval, not support for updates, and often the use of a special semantically rich data model has been required. In this paper we present an approach to database integration which supports updates and which uses only the standard relational data model. Many of the ideas used in this approach are applicable to database integration in the context of other data models as well.

关键词：

来源：评论

学校读者我要写书评

暂无评论

What can partitioning do for your data warehouses and data marts?

What can partitioning do for your data warehouses and data m...

引用

international symposium on Database Engineering and Applications (IDEAS)

作者： L. Bellatreche K. Karlapalem M. Mohania M. Schneider Department of Computer Science University of Science and Technology (HKUST) Hong Kong China Department of Computer Science Western Michigan University Kalamazoo MI USA LIMOS Universite Blaise Pascal Aubiere France

Efficient query processing is a critical requirement for data warehousing systems as decision support applications often require minimum response times to answer complex, ad-hoc queries having aggregations, multi-ways joins over vast repositories of data. This can be achieved by fragmenting warehouse data. The data fragmentation concept in the context of distributed databases aims to reduce query execution time and facilitates the parallel execution of queries. In this paper, we propose a methodology for applying the fragmentation technique in a data warehouse star schema to reduce the total query execution cost. We present an algorithm for fragmenting the tables of a star schema. During the fragmentation process, we observe that the choice of the dimension tables used in fragmenting the fact table plays an important role on overall performance. Therefore, we develop a greedy algorithm in selecting "best" dimension tables. We propose an analytical cost model for executing a set of OLAP queries on a fragmented star schema. Finally, we conduct some experiments to evaluate the utility of the fragmentation for efficiently executing OLAP queries.

关键词： Data warehouses Costs Computer science Query processing Application software Delay distributed databases Warehousing Greedy algorithms Analytical models

来源：评论

学校读者我要写书评

暂无评论

parallel join algorithms on a network of workstations 88

引用

proceedings of the first international symposium on databases in parallel and distributed systems

作者： X. Wang W. S. Luk School of Computing Science Simon Fraser University Bumaby B.C. V5A lS6 Canada

ISBN: (纸本)9780818608933

We propose a non-traditional system architecture for backend database processing, i.e., a network of workstations. By moving data dynamically to otherwise idle workstations over a local area network, a high degree of processing parallelism could be achieved through load sharing. In this paper, three load sharing join algorithms are developed and implemented on a network of Sun workstations. These join algorithms are designed on the basis of different assumptions, e.g., whether indices are available and whether join result is required to be sorted. Based on the analyical results and empirical performance data for each algorithm, we are able to show that the load sharing strategy in each case is an effective method to achieve processing speedups. However, the network bandwidth of 10Mbits/second becomes a bottleneck, when more than a dozen or so workstations are deployed, which indicates that a higher bandwidth network is needed for further improvement in performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Fault tolerance protocols for parallel programs based on tasks replication

Fault tolerance protocols for parallel programs based on tas...

引用

international symposium on Modeling, Analysis and Simulation of Computer and Telecommunication systems (MASCOTS)

作者： J. Aguilar M. Hernandez CEMISID. Dpto. de Computación. University de Los Andes Merida Venezuela PRISM. University de Versailles Versailles France

In this paper we propose a fault-tolerant mechanism for parallel programs based on task replication. We use a sequential discrete-event simulator of a distributed system subject to failures to compare a semi-active approach and a passive approach of the protocol. In our model, each time a task of a given parallel program is allocated, a copy of it is stored in a second processor, called the buddy processor. If the original processor fails, the copies of the tasks at the buddy processor will be processed, providing fault tolerance. Some performance measures, such as program execution times and processor utilization factors, are given for the different versions of the mechanism. The performance has been studied as a function of processor degradation, and program and system sizes.

关键词： Fault tolerance Protocols Hardware Computer network reliability Computer networks Costs Software performance Redundancy Application software Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A robust protocol for parallel join operation in distributed data bases 88

引用

proceedings of the first international symposium on databases in parallel and distributed systems

作者： S. Bandyopadhyay A. Sengupta School of Computer Science University of Windsor Windsor Ont N9B 3P4 CANADA Dept of Computer Science University of South Carolina Columbia SC USA

ISBN: (纸本)9780818608933

Fault tolerant distributed databases use replicated data(e.g., record or relation) to handle failures of one or more nodes in a computer network. Efficient and economic access strategies for such data bases have not been investigated. In this paper, the binary hypercube, a popular model for fault tolerant interconnection networks, has been studied. It has been shown that, for a local area network based on a binary hypercube, having 2r nodes where every data is replicated r times, in the absence of faults, any query involving an arbitrary sequence of joins R1 @@@@ R2 @@@@ … @@@@ Rn, n ≤ r, may be performed by repeatedly executing joins in a distributed fashion using n node disjoint paths from n/2 distinct sites of database operations to n arbitrary sites containing a target relation each. This protocol also solves the problem of materialization of relations. In the presence of up to r-2 faults, the protocol still guarantees N node disjoint paths to arbitrary sites. The value of N is determined by the number of faulty nodes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust transaction routing in distributed database systems 88

引用

proceedings of the first international symposium on databases in parallel and distributed systems

作者： Y. H. Lee P. S. Yu A. Leff Computer Science Department University of Florida Gainesville FL IBM T. Watson Research Center P. 0. Box 704 Yorktown Heights NY Computer Science Department University of Columbia New York NY

ISBN: (纸本)9780818608933

In this paper, we examine the issue of robust transaction routing in distributed database systems. A class of dynamic routing strategies which use estimated response times to make routing decisions is studied in details. Since response time estimation and decision making depend on the assumed transaction model and parameters, it is important to examine the robustness or sensitivity to the inaccuracy in the assumptions and parameter values. Through simulations, we find that the dynamic routing strategy based strictly on response time is too aggressive in sharing loads and makes too many non-preferred system routings. It is robust with respect to change in the number of database calls per transaction, but is relatively sensitive to the distribution of database calls. Two refinements are proposed which improve system performance as well as robustness of routing decisions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

StreamJoin: a generic database approach to support the class of stream-oriented applications

StreamJoin: a generic database approach to support the class...

引用

international symposium on Database Engineering and Applications (IDEAS)

作者： C. Nippl R. Rantzau B. Mitschang Department of Computer Science Technical University Munich Munich Germany Institute of Parallel and Distributed High Performance Systems University of Stuttgart Stuttgart Germany

Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records. Analysis of this data requires stream processing techniques which differ in significant ways from what current database analysis and query techniques have been optimized for. In this paper we present a new operator, called StreamJoin, that can efficiently be used to solve stream-related problems of various applications, such as universal quantification, pattern recognition and data mining. Contrary to other approaches. StreamJoin processing provides rapid response times, a non-blocking execution as well as economical resource utilization. Adaptability to different application scenarios is realized by means of parameters. In addition, the StreamJoin operator can be efficiently embedded into the database engine, thus implicitly using the optimization and parallelization capabilities for the benefit of the application. The paper focuses on the applicability of StreamJoin to integrate application semantics into the DBMS.

关键词： databases Data analysis Proteins Itemsets Application software Data mining Sequences Decision support systems Computer science Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithms for distributed query processing 88

引用

proceedings of the first international symposium on databases in parallel and distributed systems

作者： P. Bodorik J. S. Riordon 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 KlS 5B6 Canada

ISBN: (纸本)9780818608933

This paper examines heuristic algorithms for processing distributed queries using generalized joins. As this optimization problem is NP-hard heuristic algorithms are deemed to be justified. A heuristic algorithm to form/formulate strategies to process queries is presented. It has a special property in that its overhead can be “controlled”: The higher its overhead the better the strategies it produces. Modeling on a test-bed of queries is used to demonstrate that there is a trade-off between the strategy's execution and formulation delays. The modeling results also support the notion that simple greedy heuristic algorithms such as are proposed by many researchers are sufficient in that they are likely to lead to near-optimal strategies and that increasing the overhead in forming strategies is only marginally beneficial. Both the strategy formulation and execution delays are examined in relation to the number of operations specified by the strategy and the total size of partial results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Coherence communication prediction in shared-memory multiprocessors

Coherence communication prediction in shared-memory multipro...

引用

IEEE symposium on High-Performance Computer Architecture

作者： S. Kaxiras C. Young Bell Laboratories Lucent Technologies Inc. USA

Sharing patterns in shared-memory multiprocessors are the key to performance: uniprocessor latency-tolerating techniques such as out-of-order execution and non-blocking caches have proved unable to completely hide the latency of remote memory access. Recently proposed prediction mechanisms accelerate coherence protocols by guessing where data will be used next and forwarding them to potential users before they are requested. Prior work in such shared-memory prediction schemes resulted in address-based and instruction-based predictors. Our work innovates in three areas. First, we present a taxonomy of prediction schemes that includes all previously-proposed prediction schemes in a uniform space. second, we show how statistical techniques from epidemiological screening and polygraph testing can be applied to better measure the effectiveness of sharing prediction schemes; earlier work had reported only the ratio of incorrect predictions to correct predictions but neglected the ratio of correct predictions to actual sharing. Third, we provide simulation results of the accuracy of a practical subset of the space of schemes in our taxonomy, then analyze which components of each scheme contribute the most to prediction accuracy. Through this process, we discovered prediction schemes more accurate than those previously proposed.

关键词： Delay Access protocols Taxonomy Logic testing Performance gain parallel machines distributed computing Time sharing computer systems Impedance

来源：评论

学校读者我要写书评

暂无评论

Piranha: a scalable architecture based on single-chip multiprocessing

Piranha: a scalable architecture based on single-chip multip...

引用

Annual international symposium on Computer Architecture, ISCA

作者： L.A. Barroso K. Gharachorloo R. McNamara A. Nowatzyk S. Qadeer B. Sano S. Smith R. Stets B. Verghese Western Research Laboratory Compaq Computer Corporation Palo Alto CA USA Systems Research Center Compaq Computer Corporation Palo Alto CA USA NonStop Hardware Development Compaq Computer Corporation Austin TX USA

This paper describes the Piranha system, a research prototype being developed at Compaq that aggressively exploits chip multiprocessing by integrating eight simple Alpha processor cores along with a two-level cache hierarchy onto a single chip. Piranha also integrates further on-chip functionality to allow for scalable multiprocessor configurations to be built in a glueless and modular fashion. The use of simple processor cores combined with an industry-standard ASIC design methodology allow us to complete our prototype within a short time-frame, with a team size and investment that are an order of magnitude smaller than that of a commercial microprocessor. Our detailed simulation results show that while each Piranha processor core is substantially slower than an aggressive next-generation processor, the integration of eight cores onto a single chip allows Piranha to outperform next-generation processors by up to 2.9 times (on a per chip basis) on important workloads such as OLTP. This performance advantage can approach a factor of five by using full-custom instead of ASIC logic. In addition to exploiting chip multiprocessing, the Piranha prototype incorporates several other unique design choices including a shared second-level cache with no inclusion, a highly optimized cache coherence protocol, and a novel I/O architecture.

关键词： parallel processing Computer aided instruction Concurrent computing Microprocessors Prototypes Process design Application specific integrated circuits Permission Out of order databases

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：