Foundations of modern query languages for graph databases
We survey foundational features underlying modern graph query languages. We first
discuss two popular graph data models: edge-labelled graphs, where nodes are connected …
discuss two popular graph data models: edge-labelled graphs, where nodes are connected …
Research on knowledge graph data management: a survey
王鑫， 邹磊， 王朝坤， 彭鹏， 冯志勇 - Journal of Software, 2019 - jos.org.cn
知识图谱是人工智能的重要基石. 各领域大规模知识图谱的构建和发布对知识图谱数据管理提出
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
Real-time constrained cycle detection in large dynamic graphs
As graph data is prevalent for an increasing number of Internet applications, continuously
monitoring structural patterns in dynamic graphs in order to generate real-time alerts and …
monitoring structural patterns in dynamic graphs in order to generate real-time alerts and …
知识图谱数据管理研究综述
王鑫， 邹磊， 王朝坤， 彭鹏， 冯志勇 - 软件学报, 2019 - jos.org.cn
知识图谱是人工智能的重要基石. 各领域大规模知识图谱的构建和发布对知识图谱数据管理提出
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
Spacecraft autonomy challenges for next-generation space missions
JA Starek, B Açıkmeşe, IA Nesnas… - Advances in Control …, 2015 - Springer
In early 2011, NASA's Office of the Chief Technologist (OCT) released a set of technology
roadmaps with the aim of fostering the development of concepts and cross-cutting …
roadmaps with the aim of fostering the development of concepts and cross-cutting …
Answering billion-scale label-constrained reachability queries within microsecond
In this paper, we study the problem of label-constrained reachability (LCR) query which is
fundamental in many applications with directed edge-label graphs. Although the classical …
fundamental in many applications with directed edge-label graphs. Although the classical …
Reachability querying: Can it be even faster?
As an important graph operator, reachability query has been extensively studied over
decades, which is to check whether a vertex can reach another vertex over a large directed …
decades, which is to check whether a vertex can reach another vertex over a large directed …
TF-Label: A topological-folding labeling scheme for reachability querying in a large graph
Reachability querying is a basic graph operation with numerous important applications in
databases, network analysis, computational biology, software engineering, etc. Although …
databases, network analysis, computational biology, software engineering, etc. Although …
Landmark indexing for evaluation of label-constrained reachability queries
LDJ Valstar, GHL Fletcher, Y Yoshida - Proceedings of the 2017 ACM …, 2017 - dl.acm.org
Consider a directed edge-labeled graph, such as a social network or a citation network. A
fundamental query on such data is to determine if there is a path in the graph from a given …
fundamental query on such data is to determine if there is a path in the graph from a given …
Efficiently answering reachability and path queries on temporal bipartite graphs
Bipartite graphs are naturally used to model relationships between two different types of
entities, such as people-location, authorpaper, and customer-product. When modeling real …
entities, such as people-location, authorpaper, and customer-product. When modeling real …