2015
DOI: 10.1007/978-3-319-24369-6_5
|View full text |Cite
|
Sign up to set email alerts
|

Graph Databases: Their Power and Limitations

Abstract: Part 1: Full Keynote and Invited PapersInternational audienceReal world data offers a lot of possibilities to be represented as graphs. As a result we obtain undirected or directed graphs, multigraphs and hypergraphs, labelled or weighted graphs and their variants. A development of graph modelling brings also new approaches, e.g., considering constraints. Processing graphs in a database way can be done in many different ways. Some graphs can be represented as JSON or XML structures and processed by their nativ… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
41
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
4
1

Relationship

3
7

Authors

Journals

citations
Cited by 61 publications
(41 citation statements)
references
References 11 publications
0
41
0
Order By: Relevance
“…They usually o®er a support for complex search expressions, full-text search, ranking and grouping of search results, geospatial search and distributed search for high scalability. More generally, NoSQL databases include also graph databases 8 and others, e.g. XML and RDF ones.…”
Section: Categories Of Nosql Databasesmentioning
confidence: 99%
“…They usually o®er a support for complex search expressions, full-text search, ranking and grouping of search results, geospatial search and distributed search for high scalability. More generally, NoSQL databases include also graph databases 8 and others, e.g. XML and RDF ones.…”
Section: Categories Of Nosql Databasesmentioning
confidence: 99%
“…Different approaches for structuring information in graph databases were considered for representing knowledge in our conversational agent [22]. One of them, the labeled-property graph model (used, for example, by the Neo4j Database Management System [20]) consists of adding properties to nodes or relationships to specify different metadata in a keyvalue fashion.…”
Section: Proceedings Of Rochi 2020mentioning
confidence: 99%
“…In this section, we focus on basics of graph querying (for more details see [11]). Its simplest type uses the index-free adjacency.…”
Section: Graph Queryingmentioning
confidence: 99%