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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
574 篇 期刊文献
20 篇 学位论文
1 篇 资讯

馆藏范围

1,234 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,183 篇 工学
- 1,162 篇 计算机科学与技术...
- 870 篇 软件工程
- 82 篇 电气工程
- 45 篇 信息与通信工程
- 40 篇 控制科学与工程
- 20 篇 土木工程
- 18 篇 建筑学
- 11 篇 交通运输工程
- 10 篇 电子科学与技术（可...
- 9 篇 机械工程
- 7 篇 仪器科学与技术
- 6 篇 林业工程
- 6 篇 安全科学与工程
- 5 篇 冶金工程
- 5 篇 测绘科学与技术
- 5 篇 化学工程与技术
- 5 篇 生物工程
- 5 篇 网络空间安全
288 篇 理学
- 239 篇 数学
- 23 篇 物理学
- 19 篇 统计学（可授理学、...
- 15 篇 系统科学
- 10 篇 生物学
- 8 篇 化学
115 篇 管理学
- 64 篇 图书情报与档案管...
- 57 篇 管理科学与工程(可...
- 21 篇 工商管理
33 篇 法学
- 31 篇 社会学
9 篇 医学
7 篇 文学
- 4 篇 新闻传播学
5 篇 教育学
- 5 篇 教育学
4 篇 农学
3 篇 经济学

主题

1,234 篇 graph databases
36 篇 neo4j
20 篇 query languages
19 篇 knowledge graphs
15 篇 nosql
13 篇 regular path que...
12 篇 big data
12 篇 graph theory
12 篇 databases
11 篇 rdf
10 篇 relational datab...
9 篇 cypher
9 篇 sparql
9 篇 distributed data...
8 篇 graph query lang...
8 篇 social networks
8 篇 property graphs
7 篇 query processing
7 篇 worst-case optim...
7 篇 pattern matching

机构

11 篇 school of mathem...
10 篇 department of ma...
8 篇 univ bayreuth ba...
7 篇 department of ma...
7 篇 univ chile dept ...
6 篇 neo4j
6 篇 puc chile santia...
6 篇 university of wa...
6 篇 univ chile dcc s...
5 篇 univ waterloo wa...
5 篇 nanyang technol ...
5 篇 imfd santiago
5 篇 dipartimento di ...
5 篇 fakultät für inf...
4 篇 school of mathem...
4 篇 eindhoven univer...
4 篇 technion haifa
4 篇 sobolev institut...
4 篇 department of ma...
4 篇 saint petersburg...

作者

19 篇 martens wim
15 篇 bonifati angela
14 篇 libkin leonid
11 篇 vrgoc domagoj
11 篇 voigt hannes
10 篇 fletcher george
9 篇 niewerth matthia...
9 篇 barcelo pablo
9 篇 morris joy
9 篇 salihoglu semih
8 篇 zhou sanming
8 篇 angles renzo
8 篇 yakovets nikolay
8 篇 hogan aidan
8 篇 dayarathna miyur...
7 篇 berdinsky dmitry
7 篇 vrgoč domagoj
7 篇 xia binzhou
7 篇 navarro gonzalo
7 篇 feng yan-quan

语言

1,200 篇 英文
30 篇 其他
1 篇 德文
1 篇 西班牙文
1 篇 葡萄牙文
1 篇 俄文

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

共 1234 条记录，以下是71-80 订阅

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

详细简洁

排序：

Correlation Search in graph databases

Correlation Search in Graph Databases

引用

13th International Conference on Knowledge Discovery and Data Mining

作者： Ke, Yiping Cheng, James Ng, Wilfred Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781595936097

Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation mining from graph databases is still lacking despite the fact that graph data, especially in various scientific domains, proliferate in recent years. In this paper, we propose a new problem of correlation mining from graph databases, called Correlated graph Search (CGS). CGS adopts Pearson's correlation coefficient as a correlation measure to take into consideration the occurrence distributions of graphs. However, the problem poses significant challenges, since every subgraph of a graph in the database is a candidate but the number of subgraphs is exponential. We derive two necessary conditions which set bounds on the occurrence probability of a candidate in the database. With this result, we design an efficient algorithm that operates on a much smaller projected database and thus we are able to obtain a significantly smaller set of candidates. To further improve the efficiency, we develop three heuristic rules and apply them on the candidate set to further reduce the search space. Our extensive experiments demonstrate the effectiveness of our method on candidate reduction. The results also justify the efficiency of our algorithm in mining correlations from large real and synthetic datasets.

关键词： Correlation graph databases Pearson's Correlation Coefficient

来源：评论

学校读者我要写书评

暂无评论

AURORA: Data-driven Construction of Visual graph Query Interfaces for graph databases 20

AURORA: Data-driven Construction of Visual Graph Query Inter...

引用

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Bhowmick, Sourav S. Huang, Kai Chua, Huey Eng Yuan, Zifeng Choi, Byron Zhou, Shuigeng Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore Fudan Univ Sch Comp Sci Shanghai Key Lab Intelligent Informat Proc Shanghai Peoples R China Hong Kong Baptist Univ Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9781450367356

Several commercial and academic frameworks for querying a large collection of small- or medium-sized data graphs (e.g., chemical compounds) provide visual graph query interfaces (a.k.a GUI) to facilitate non-programmers to query these sources. However, construction of these visual interfaces is not data-driven. That is, it does not exploit the underlying data graphs to automatically generate the contents of various panels in a GUI. Such data-driven construction has several benefits such as facilitating efficient subgraph query formulation and portability of the interface across different application domains and sources. In this demonstration, we present a novel data-driven visual subgraph query interface construction engine called AURORA. Specifically, given a graph repository D containing a collection of small- or medium-sized data graphs, it automatically generates the GUI for D by populating various components of the interface. We demonstrate various innovative features of AURORA.

关键词： graph databases data-driven construction portability visual graph query interface usability

来源：评论

学校读者我要写书评

暂无评论

Combining System Modelling and graph databases to Improve Access and Analysis in Data-Intensive Engineering Tasks 18

Combining System Modelling and Graph Databases to Improve Ac...

引用

18th Annual IEEE International Systems Conference (SysCon)

作者： Laukotka, Fabian N. Krause, Dieter Hamburg Univ Technol Inst Prod Dev & Mech Engn Design Hamburg Germany

ISBN: (纸本)9798350358810;9798350358803

System Modelling and graph databases have evolved as the means of choice for handling information in many tasks in engineering and data science respectively. While each technique has its individual background and strengths in either the visually assisted creation or the easy integration into external processes, data-intensive engineering tasks like the planning of new aircraft cabins for the cabin-retrofit in aviation would greatly benefit from an approach that facilitates both aspects. Generic information of the domain and information specific to the individual aircraft need to be easily documented but also quickly tracked down and accessed to ensure a proper fit between the new cabin and the existing aircraft. Hence, this paper will present an approach to combine System Modelling techniques with graph databases to improve the access and analysis of the occurring information in these data-intensive tasks. As part of that, the required fundamentals of the respective techniques are described and compared. Benefits and limitations as well as the potential of the combination are presented and result in a methodology that facilitates improved handling of information under the given circumstances. While the general idea can also be applied to other scenarios, the aforementioned use case of cabin-retrofit in aviation will be used as the case study of the presented methodology.

关键词： System Modelling graph databases Data Handling Access Analysis Aircraft Cabin-Retrofit

来源：评论

学校读者我要写书评

暂无评论

Creating Triggers with Trigger-By-Example in graph databases 8

Creating Triggers with Trigger-By-Example in Graph Databases

引用

8th International Conference on Data Science, Technology and Applications (DATA)

作者： Rabuzin, Kornelije Sestak, Martina Univ Zagreb Fac Org & Informat Pavlinska 2 Varazhdin 42000 Croatia

ISBN: (纸本)9789897583773

In recent years, NoSQL graph databases have received an increased interest in the research community. Various query languages have been developed to enable users to interact with a graph database (e.g. Neo4j), such as Cypher or Gremlin. Although the syntax of graph query languages can be learned, inexperienced users may encounter learning difficulties regardless of their domain knowledge or level of expertise. For this reason, the Query-By-Example approach has been used in relational databases over the years. In this paper, we demonstrate how a variation of this approach, the Trigger-By-Example approach, can be used to define triggers in graph databases, specifically Neo4j, as database mechanisms activated upon a given event. The proposed approach follows the Event-Condition-Action model of active databases, which represents the basis of a trigger. To demonstrate the proposed approach, a special graphical interface has been developed, which enables users to create triggers in a short series of steps. The proposed approach is tested on several sample scenarios.

关键词： Trigger-By-Example graph databases Triggers Active databases

来源：评论

学校读者我要写书评

暂无评论

Conceptual Data Normalisation from the Practical View of Using graph databases 1

引用

36th International Conference on Advanced Information Systems Engineering (CAiSE)

作者： Merunka, Vojtech Wijekoon, Himesha Beranek, Pavel Czech Univ Life Sci Prague Fac Econ & Management Dept Informat Engn Prague Czech Republic Czech Tech Univ Fac Nucl Sci & Engn Dept Software Engn Prague Czech Republic Jan Evangelista Purkyne Univ Usti Nad Labem Fac Sci Dept Informat Usti Nad Labem Czech Republic

ISBN: (数字)9783031610035

ISBN: (纸本)9783031610028;9783031610035

This article deals with a practical and synthetic view of conceptual modelling. It suggests four graph database normal forms organised into two levels of conceptual modelling: data and metadata, with room for yet one conceivable graph normal form based on old approaches, such as object-oriented class normalisation and the idea of conceptual symmetry. Attention is also paid to bridging the semantic gap between a database on the server side and a programming language on the client side, which argues for using graph databases as better data sources for business intelligence systems and working with machine learning language models. The authors applied their practical experience in teaching database modelling at a university and many years of experience in software development in Smalltalk, Python, Java, and C#.

关键词： graph database normal forms graph databases conceptual modelling large language models business intelligence

来源：评论

学校读者我要写书评

暂无评论

Nautilus: Implementation of an Evolution Approach for graph databases 24

Nautilus: Implementation of an Evolution Approach for Graph ...

引用

ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings (MODELS)

作者： Hausler, Dominique Klettke, Meike Univ Regensburg Regensburg Bavaria Germany

ISBN: (纸本)9798400706226

Equivalent to relational databases, there is a need for an evolution language for graph databases that describes how evolution operations such as add, rename, delete, copy, move, split and merge are specified domain independent. Previous work proposes the graph evolution language called GEO, which we build upon. In this paper, we present our program called Nautilus, implementing this formal language, used to define evolution and intuitively easing the usage of graph database systems. GEO can also be used to update implicit structures in the graph data. Users benefit not only from an easy-to-use interface to minimize syntax errors and to reduce the necessary knowledge of the evolution language, but also from additional statistics on database structures which are visualized in the tool. This visualization allows initial data exploration as well as identifying the effects of the development by comparing data versions. Consequently, Nautilus is capable of widening the range of users and accessibility of graph databases for interdisciplinary research projects. Illustrating schema changes and performing schema evolution transparently builds the core of Nautilus. Complex operations like split and transform are part of the available evolution language, thus avoiding programming workarounds. An additional feature of the tool is a logging components that offers the traceability of all performed evolution operations.

关键词： graph databases Property graph Evolution Language graph Database Statistics Profiles Neo4j

来源：评论

学校读者我要写书评

暂无评论

Use of graph databases in Tourist Navigation Application

Use of Graph Databases in Tourist Navigation Application

引用

14th International Conference on Computational Science and Its Applications (ICCSA)

作者： Basiri, Anahid Amirian, Pouria Winstanley, Adam Univ Nottingham Nottingham Geospatial Inst Nottingham NG7 2RD England Natl Univ Ireland Dept Comp Sci Maynooth Kildare Ireland

ISBN: (纸本)9783319091563;9783319091556

Navigation services, such as car navigation services, are widely used nowadays. However current car navigation systems are not fully suitable for the navigational needs of tourists. In contrast with drivers, tourists are not constrained by road networks and can walk in places where vehicles are not allowed to move. As current turn-by-turn navigational instructions to be given to vehicle's derivers are mostly based on street network-based algorithms, this way of navigating is not fully suitable for tourists as they do not only move on streets. In addition, Tourists want to see important feature of the area, no matter they take longer path rather than shortest. They want to get navigated through the most touristic path. In order to provide such tourist-specific navigation services, a landmark-based solution was considered. it calculates a route passing more landmarks. This may help user to visit attractive part of a place. It is possible to provide users with the navigational instructions landmark-by-landmark rather than turn-by-turn. In this application, a graph database is used because of having highly connected data and also need to remove the mapping layer between physical storage layer and application logic layer to have more availability and responsiveness.

关键词： Landmark-based navigation graph databases Tourist navigation Location Based Services (LBS)

来源：评论

学校读者我要写书评

暂无评论

Refactoring Rules for graph databases

Refactoring Rules for Graph Databases

引用

World Conference on Information Systems and Technologies (WorldCIST)

作者： Fonseca, Adriane M. Camolesi, Luiz, Jr. Univ Estadual Campinas UNICAMP Sch Technol FT Paschoal Marmo St 1888 BR-13484332 Limeira SP Brazil

ISBN: (纸本)9783319164861;9783319164854

The information generated nowadays is growing in volume and complexity, representing a technological challenge which demands more than the relational model for databases can currently offer. This situation stimulates the use of different forms of storage, such as graph databases. Current graph databases allow automatic database evolution, but do not provide adequate resources for the information organization. This is mostly left under the responsibility of the applications which access the database, compromising the data integrity and reliability. The goal of this work is the definition of refactoring rules to support the management of the evolution of graph databases by adapting and extending existent refactoring rules for relational databases to meet the requirements of the graph databases features. These refactoring rules can be used by developers of graph database management tools to guarantee the integrity of the operations of database evolution.

关键词： graph databases Data Refactoring Evolutionary databases

来源：评论

学校读者我要写书评

暂无评论

Schema Validation and Evolution for graph databases 38th

Schema Validation and Evolution for Graph Databases

引用

38th International Conference on Conceptual Modeling (ER)

作者： Bonifati, Angela Furniss, Peter Green, Alastair Harmer, Russ Oshurko, Eugenia Voigt, Hannes Lyon 1 Univ Villeurbanne France CNRS Liris Villeurbanne France Neo4j London England UCBL1 ENS Lyon CNRS UdL Lyon France

ISBN: (纸本)9783030332235;9783030332228

Despite the maturity of commercial graph databases, little consensus has been reached so far on the standardization of data definition languages (DDLs) for property graphs (PG). Discussion on the characteristics of PG schemas is ongoing in many standardization and community groups. Although some basic aspects of a schema are already present in most commercial graph databases, full support is missing allowing to constraint property graphs with more or less flexibility. In this paper, we show how schema validation can be enforced through homomorphisms between PG schemas and PG instances by leveraging a concise schema DDL inspired by Cypher syntax. We also briefly discuss PG schema evolution that relies on graph rewriting operations allowing to consider both prescriptive and descriptive schemas.

关键词： graph databases graph schema modelling graph schema validation

来源：评论

学校读者我要写书评

暂无评论

Modal Schema graphs for graph databases 38th

Modal Schema Graphs for Graph Databases

引用

38th International Conference on Conceptual Modeling (ER)

作者： Mennicke, Stephan Tech Univ Carolo Wilhelmina Braunschweig Inst Informat Syst Muhlenpfordtstr 23 D-38106 Braunschweig Germany

ISBN: (纸本)9783030332235;9783030332228

Although graph databases are conceived schema-less, additional knowledge about the data's structure and/or semantics is beneficial in many graph database management tasks, from efficient storage, over query optimization, up to data integration. Today's commonly used graph data models do not represent primal suspects regarding their lack of schema prior to data population. More than 20 years ago, also semistructured data has been introduced without an a-priori conceptual modeling phase. Neat models, called schema graphs, have been proposed and proven useful, yet heavily relying on the employed data model, which had been rooted labeled graphs. We generalize schema graphs in two respects: (1) Our notions are based on labeled graphs because the root node assumption is invalid in the spirit of modern graph data models. (2) We propose and study modal schema graphs to increase the expressive power of the original model. Modal schema graphs allow for (conditional) structural requirements without an otherwise necessary logical device. Furthermore, we elaborate on the consequences of our expressiveness enhancement with respect to applications and algorithmic complexity.

关键词： graph databases Schema graphs Modal specifications

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共124页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：