Results 11 to 20 of about 130,993 (295)
Performance Introspection of Graph Databases [PDF]
Proceedings of the 6th International Systems and Storage Conference on - SYSTOR '13, 2013 The explosion of graph data in social and biological networks, recommendation systems, provenance databases, etc. makes graph storage and processing of paramount importance. We present a performance introspection framework for graph databases, PIG, which
Daniel Margo +5 more
core +4 more sources
CoRR, 2022 Graph databases (GDBs) enable processing and analysis of unstructured, complex, rich, and usually vast graph datasets. Despite the large significance of GDBs in both academia and industry, little effort has been made into integrating them with the ...
Besta, Maciej +7 more
core +3 more sources
GRAPH DATABASES AND GRAPH VIZUALIZATION [PDF]
, 2013 The thesis presents graph databases. Graph databases are a part of NoSQL databases, which is why this thesis presents basics of NoSQL databases as well. We have focused on advantages of graph databases compared to rela- tional databases.
Klančar, Jure
core +2 more sources
An Empirical Comparison of Graph Databases [PDF]
, 2013 -In recent years, more and more companies provide services that can not be anymore achieved efficiently using relational databases. As such, these companies are forced to use alternative database models such as XML databases, objectoriented databases ...
Valentin Vansteenberghe, Salim Jouili
exaly +1 more source
Graph Computing Systems and Partitioning Techniques: A Survey
IEEE Access, 2022 Graphs are a tremendously suitable data representations that model the relationships of entities in many application domains, such as recommendation systems, machine learning, computational biology, social network analysis, and other application domains.
Tewodros Alemu Ayall +6 more
doaj +1 more source
Semantic acyclicity on graph databases [PDF]
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems, 2013 Summary: It is known that unions of acyclic conjunctive queries (CQs) can be evaluated in linear time, as opposed to arbitrary CQs, for which the evaluation problem is NP-complete. It follows from techniques in the area of constraint-satisfaction problems that semantically acyclic unions of CQs -- i.e., unions of CQs that are equivalent to a union of ...
Pablo Barceló Baeza +2 more
openaire +8 more sources
A Graph DB-Based Solution for Semantic Technologies in the Future Internet
Future Internet, 2023 With the progressive improvements in the power, effectiveness, and reliability of AI solutions, more and more critical human problems are being handled by automated AI-based tools and systems.
Stefano Ferilli +3 more
doaj +1 more source
Context-free path querying with all-path semantics using matrices with sets of intermediate vertices [PDF]
Научно-технический вестник информационных технологий, механики и оптики, 2021 The study considers the problem of context-free path querying with all-path query semantics. This problem consists in finding all paths of the graph, the labels on the edges of which form words from the language generated by the input context-free ...
Rustam Sh. Azimov, Semyon V. Grigorev
doaj +1 more source
Journal of Open Humanities Data, 2023 This paper attempts to develop a pipeline designed to convert graphical PDF files of the newspaper Zviazda into usable text data in the Belarusian language with search and visualization options.
Loïc Boizou
doaj +1 more source
IEEE Access, 2020 Blockchains are being recently used as a supporting technology framework for decentralized applications requiring functionalities such as exchange of value through tokens, cryptocurrency and smart contracts.
Konstantinos Tsoulias +4 more
doaj +1 more source