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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

8 篇 工学
- 8 篇 计算机科学与技术...
- 2 篇 电气工程
- 1 篇 软件工程
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

8 篇 database operato...
2 篇 query processing
2 篇 sql
2 篇 fpga
1 篇 overlay architec...
1 篇 temporal text co...
1 篇 graph modeling
1 篇 operator fusion
1 篇 regular expressi...
1 篇 hash join algori...
1 篇 near-data proces...
1 篇 heuristic
1 篇 apriori
1 篇 lambda functions
1 篇 high performance...
1 篇 query algebra
1 篇 dbscan
1 篇 k-means
1 篇 conceptual histo...
1 篇 many-core proces...

机构

2 篇 tech univ munich...
1 篇 swiss fed inst t...
1 篇 fed inst parana ...
1 篇 nanyang technol ...
1 篇 swiss fed inst t...
1 篇 fed rural univ s...
1 篇 otto von guerick...
1 篇 otto von guerick...
1 篇 karlsruhe inst t...
1 篇 karlsruhe inst t...
1 篇 natl univ def te...
1 篇 karlsruhe inst t...
1 篇 natl univ singap...
1 篇 nanyang technol ...

作者

2 篇 sidler david
2 篇 kemper alfons
2 篇 alonso gustavo
2 篇 schuele maximili...
2 篇 neumann thomas
1 篇 gurumurthy bala
1 篇 schaeler martin
1 篇 hubig nina
1 篇 vorona dimitri
1 篇 saake gunter
1 篇 istvan zsolt
1 篇 boehm klemens
1 篇 broneske david
1 篇 owaida muhsen
1 篇 joseph jan morit...
1 篇 cheng xuntao
1 篇 pionteck thilo
1 篇 santos sairo
1 篇 passing linnea
1 篇 du xiaoli

语言

8 篇 英文

检索条件"主题词=database operators"

共 8 条记录，以下是1-10 订阅

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

详细简洁

排序：

Improved Computation of database operators via Vector Processing Near-Data 35

Improved Computation of Database Operators via Vector Proces...

引用

35th IEEE International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Santos, Sairo Kepe, Tiago R. Alves, Marco A. Z. Fed Rural Univ Semiarid Angicos Brazil Fed Inst Parana Curitiba Parana Brazil

ISBN: (纸本)9798350305487

Data-centric applications are increasingly more common, causing issues brought on by the discrepancy between processor and memory technologies to be increasingly more apparent. Near-Data Processing (NDP) is an approach to mitigate this issue. It proposes moving some of the computation close to the memory, thus allowing for reduced data movement and aiding data-intensive workloads. Analytical database queries are very commonly used in NDP research due to their intrinsics usage of very large volumes of data. In this paper, we investigate the migration of most time-consuming database operators to VIMA, a novel 3D-stacked memory-based NDP architecture. We consider the selection, projection, and bloom join database query operators, commonly used by data analytics applications, comparing Vector-In-Memory Architecture (VIMA) to a highperformance x86 baseline. We pitch VIMA against both a single-thread baseline and a modern 16-thread x86 system to evaluate its performance. Against a single-thread baseline, our experiments show that VIMA is able to speed up execution by up to 5x for selection, 2.5x for projection, and 16x for join while consuming up to 99% less energy. When considering a multi-thread baseline, VIMA matches the execution time performance even at the largest dataset sizes considered. In comparison to existing state-of-the-art NDP platforms, we find that our approach achieves superior performance for these operators.

关键词： near-data processing high performance computing database operators

来源：评论

学校读者我要写书评

暂无评论

Optimising Operator Sets for Analytical database Processing on FPGAs 16th

Optimising Operator Sets for Analytical Database Processing ...

引用

16th International Symposium on Applied Reconfigurable Computing

作者： Drewes, Anna Joseph, Jan Moritz Gurumurthy, Bala Broneske, David Saake, Gunter Pionteck, Thilo Otto von Guericke Univ Inst Informat Technol & Commun D-39106 Magdeburg Germany Otto von Guericke Univ Inst Tech & Business Informat Syst D-39106 Magdeburg Germany

ISBN: (纸本)9783030445331;9783030445348

The high throughput and partial reconfiguration capabilities of modern FPGAs make them an attractive hardware platform for query processing in analytical database systems using overlay architectures. The design of existing systems is often solely based on hardware characteristics and thus does not account for all requirements of the application. In this paper, we identify two design issues impeding system integration of low-level database operators for runtime-reconfigurable overlay architectures on FPGAs: First, the granularity of operator sets within each processing pipeline;Second, the mapping of query (sub-)graphs to complex hardware operators. We solve these issues by modeling them as variants of the subgraph isomorphism problem. Via optimised operator fusion guided by a heuristic we reduce the number of required reconfigurable regions between 30% and 85% for relevant TPC-H database benchmark queries. This increase in area efficiency is achieved without performance penalties. In 86% of iterations of the operator fusion process, the proposed heuristic finds optimal candidates, which is 3.6x more often than for a naive greedy approach.

关键词： Query processing database operators Operator fusion Graph modeling Heuristic FPGA Overlay architecture

来源：评论

学校读者我要写书评

暂无评论

A Query Algebra for Temporal Text Corpora 18

A Query Algebra for Temporal Text Corpora

引用

18th ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL)

作者： Willkomm, Jens Schmidt-Petri, Christoph Schaeler, Martin Schefczyk, Michael Boehm, Klemens Karlsruhe Inst Technol Dept Informat Karlsruhe Germany Karlsruhe Inst Technol Dept Humanities Karlsruhe Germany Karlsruhe Inst Technol Dept Humanities & Social Sci Karlsruhe Germany

ISBN: (纸本)9781450351782

Researching the evolution of the concepts represented by words, like "peace" or "freedom", named conceptual history, is an important discipline in the humanities, but still a laborious task. It normally consists of reading and interpreting a large number of carefully selected texts, without however always having a comprehensive knowledge of all the potentially relevant material. Thus, our objective is to design a query algebra to access temporal text corpora. It shall comprehensively allow domain experts to formalize hypotheses on how concepts manifest in large-scale digital text corpora targeting at the complete works of Reinhart Koselleck, a highly prominent researcher in conceptual history. In cooperation with domain experts, we first determine the primary information types used in conceptual history, such as word usage frequency or sentiment. Based on this, we define database operators formalizing these types, which can be combined to formulate arbitrarily complex queries representing hypotheses. The result is a novel query algebra that enables researchers in conceptual history to access large text corpora and extensively analyze word behaviors over time in a comprehensive way. In a proof of concept, we demonstrate how to use our algebra resulting in the first novel insights. This proves the suitability of our algebra.

关键词： Query algebra temporal text corpora database operators conceptual history

来源：评论

学校读者我要写书评

暂无评论

A Study of Main-Memory Hash Joins on Many-core Processor: A Case with Intel Knights Landing Architecture 17

A Study of Main-Memory Hash Joins on Many-core Processor: A ...

引用

ACM Conference on Information and Knowledge Management (CIKM)

作者： Cheng, Xuntao He, Bingsheng Du, Xiaoli Lau, Chiew Tong Nanyang Technol Univ Joint NTU UBC Res Ctr Excellence Act Living Elder Singapore Singapore Natl Univ Singapore Singapore Singapore Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China Nanyang Technol Univ Singapore Singapore

ISBN: (纸本)9781450349185

Advanced processor architectures have been driving new designs, implementations and optimizations of main-memory hash join algorithms recently. The newly released Intel Xeon Phi many-core processor of the Knights Landing architecture (KNL) embraces interesting hardware features such as many low-frequency out-of-order cores connected on a 2D mesh, and high-bandwidth multi-channel memory (MCDRAM). In this paper, we experimentally revisit the state-of-the-art main-memory hash join algorithms to study how the new hardware features of KNL affect the algorithmic design and tuning as well as to identify the opportunities for further performance improvement on KNL. Our experiments show that, although many existing optimizations are still valid on KNL with proper timing, even the state-of-the-art algorithms have severely underutilized the memory bandwidth and other hardware resources.

关键词： database operators many-core processor hash join algorithms

来源：评论

学校读者我要写书评

暂无评论

HyPerInsight: Data Exploration Deep Inside HyPer 17

HyPerInsight: Data Exploration Deep Inside HyPer

引用

ACM Conference on Information and Knowledge Management (CIKM)

作者： Hubig, Nina Passing, Linnea Schuele, Maximilian E. Vorona, Dimitri Kemper, Alfons Neumann, Thomas Tech Univ Munich Munich Germany

ISBN: (纸本)9781450349185

Nowadays we are drowning in data of various varieties. For all these mixed types and categories of data there exist even more different analysis approaches, often done in single hand-written solutions. We propose to extend HyPer, a main memory database system to a uniform data agent platform following the "one system fits all" approach for solving a wide variety of data analysis problems. We achieve this by applying a flexible operator concept to a set of various important data exploration algorithms. With that, HyPer solves analytical questions using clustering, classification, association rule mining and graph mining besides standard HTAP (Hybrid Transaction and Analytical Processing) workloads on the same database state. It enables to approach the full variety and volume of HTAP extended for data exploration (HTAPx), and only needs knowledge of already introduced SQL extensions that are automatically optimized by the database's standard optimizer. In this demo we will focus on the benefits and flexibility we create by using the SQL extensions for several well-known mining workloads. In our interactive webinterface for this project named HyPerInsight we demonstrate how HyPer outperforms the best open source competitor Apache Spark in common use cases in social media, geo-data, recommender systems and several other.

关键词： HyPer database operators Query processing SQL Apriori k-Means DBscan

来源：评论

学校读者我要写书评

暂无评论

Centaur: A Framework for Hybrid CPU-FPGA databases 25

Centaur: A Framework for Hybrid CPU-FPGA Databases

引用

25th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Owaida, Muhsen Sidler, David Kara, Kaan Alonso, Gustavo Swiss Fed Inst Technol Dept Comp Sci Syst Grp Zurich Switzerland

ISBN: (纸本)9781538640371

Accelerating relational databases in general and SQL in particular has become an important topic given the challenges arising from large data collections and increasingly complex workloads. Most existing work, however, has been focused on either accelerating a single operator (e.g., a join) or in data reduction along the data path (e.g., from disk to CPU). In this paper we focus instead on the system aspects of accelerating a relational engine in hybrid CPU-FPGA architectures. In particular, we present Centaur, a framework running on the FPGA that allows the dynamic allocation of FPGA operators to query plans, pipelining these operators among themselves when needed, and the hybrid execution of operator pipelines running on the CPU and the FPGA. Centaur is fully compatible with relational engines as we demonstrate through its seamless integration with MonetDB, a popular column store database. In the paper, we describe how this integration is achieved, and empirically demonstrate the advantages of such an approach. The main contribution of the paper is to provide a realistic solution for accelerating SQL that is compatible with existing database architectures, thereby opening up the possibilities for further exploration of FPGA based data processing.

关键词： CPU-FPGA integration database operators FPGA

来源：评论

学校读者我要写书评

暂无评论

\Runtime Parameterizable Regular Expression operators for databases 24

\Runtime Parameterizable Regular Expression Operators for Da...

引用

24th IEEE International Symposium on Field-Programmable Custom Computing Machines (FCCM)

作者： Istvan, Zsolt Sidler, David Alonso, Gustavo Swiss Fed Inst Technol Syst Grp Dept Comp Sci Zurich Switzerland

ISBN: (纸本)9781509023561

Relational databases execute user queries through operator trees, where each operator has a well defined interface and a specific task (e.g., arithmetic function, pattern matching, aggregation, etc.). Hardware acceleration of compute intensive operators is a promising prospect but it comes with challenges. databases execute tens of thousands of different queries per second. Thus, if only one specific instantiation of an operator is supported by the accelerator, it will have little effect on the overall workload. In this paper we explore the tradeoff between resource efficiency and expression complexity for an FPGA accelerator targeting string-matching operators (LIKE and REGEXP LIKE in SQL). This tradeoff is complex. For instance, the FPGA not always wins: simple queries that can be answered from indexes run faster on the CPU. On complex regular expressions, the FPGA is faster but needs to be parametrized at runtime to be able to support different queries. For very long patterns, the entire expression might not fit into the FPGA circuit and a combined mode CPU-FPGA must be chosen. We evaluate our design on a heterogeneous multi-core machine in which the FPGA has cache coherent access to the CPU memory. In addition to the string matching circuit, we also show how to implement database page parsing logic so as to be able to work directly on the same memory data structures as the database engine.

关键词： database operators Regular expressions Runtime parametrization

来源：评论

学校读者我要写书评

暂无评论

Freedom for the SQL-Lambda Just-in-Time-Compiling User-Injected Functions in PostgreSQL 2020

Freedom for the SQL-Lambda Just-in-Time-Compiling User-Injec...

引用

32nd International Conference on Scientific and Statistical database Management (SSDBM)

作者： Schuele, Maximilian E. Huber, Jakob Kemper, Alfons Neumann, Thomas Tech Univ Munich Munich Germany

ISBN: (纸本)9781450388146

As part of the code-generating database system HyPer, SQL lambda functions allow user-defined metrics to be injected into data mining operators during compile time. Since version 11, PostgreSQL has supported just-in-time compilation with LLVM for expression evaluation. This enables the concept of SQL lambda functions to be transferred to this open-source database system. In this study, we extend PostgreSQL by adding two subquery types for lambda expressions that either pre-materialise the result or return a cursor to request tuples. We demonstrate the usage of these subquery types in conjunction with dedicated table functions for data mining algorithms such as PageRank, k-Means clustering and labelling. Furthermore, we allow four levels of optimisation for query execution, ranging from interpreted function calls to just-in-time-compiled execution. The latter-with some adjustments to the PostgreSQL's execution engine-transforms our lambda functions into real user-injected code. In our evaluation with the LDBC social network benchmark for PageRank and the Chicago taxi data set for clustering, optimised lambda functions achieved comparable performance to hard-coded implementations and HyPer's data mining algorithms.

关键词： database operators Lambda Functions SQL

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：