Demystifying graph databases: Analysis and taxonomy of data organization, system designs, and graph queries
Numerous irregular graph datasets, for example social networks or web graphs, may contain
even trillions of edges. Often, their structure changes over time and they have domain …
even trillions of edges. Often, their structure changes over time and they have domain …
A survey towards an integration of big data analytics to big insights for value-creation
Abstract Big Data Analytics (BDA) is increasingly becoming a trending practice that
generates an enormous amount of data and provides a new opportunity that is helpful in …
generates an enormous amount of data and provides a new opportunity that is helpful in …
The nexus between big data and decision-making: A study of big data techniques and technologies
Big Data (BD) has shifted the paradigm of conventional data analysis with the exploitation of
emerging technologies. Analysis using BD contributes to foreseeing and pulling out value …
emerging technologies. Analysis using BD contributes to foreseeing and pulling out value …
Research on knowledge graph data management: a survey
王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇 - Journal of Software, 2019 - jos.org.cn
知识图谱是人工智能的重要基石. 各领域大规模知识图谱的构建和发布对知识图谱数据管理提出
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
In-memory big data management and processing: A survey
Growing main memory capacity has fueled the development of in-memory big data
management and processing. By eliminating disk I/O bottleneck, it is now possible to support …
management and processing. By eliminating disk I/O bottleneck, it is now possible to support …
Emptyheaded: A relational engine for graph processing
CR Aberger, A Lamb, S Tu, A Nötzli… - ACM Transactions on …, 2017 - dl.acm.org
There are two types of high-performance graph processing engines: low-and high-level
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …
Optimizing subgraph queries by combining binary and worst-case optimal joins
A Mhedhbi, S Salihoglu - Proceedings of the VLDB Endowment, 2019 - dl.acm.org
We study the problem of optimizing subgraph queries using the new worst-case optimal join
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …
G-CORE: A core for future graph query languages
We report on a community effort between industry and academia to shape the future of
graph query languages. We argue that existing graph database management systems …
graph query languages. We argue that existing graph database management systems …
知识图谱数据管理研究综述
王鑫, 邹磊, 王朝坤, 彭鹏, 冯志勇 - 软件学报, 2019 - jos.org.cn
知识图谱是人工智能的重要基石. 各领域大规模知识图谱的构建和发布对知识图谱数据管理提出
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
了新的挑战. 以数据模型的结构和操作要素为主线, 对目前的知识图谱数据管理理论, 方法 …
Optimizing one-time and continuous subgraph queries using worst-case optimal joins
A Mhedhbi, C Kankanamge, S Salihoglu - ACM Transactions on …, 2021 - dl.acm.org
We study the problem of optimizing one-time and continuous subgraph queries using the
new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching …
new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching …