Querying Graphs

Bonifati, Angela; Fletcher, George H. L.; Voigt, Hannes; Yakovets, Nikolay

doi:10.2200/s00873ed1v01y201808dtm051

Cited by 55 publications

(42 citation statements)

References 180 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…As such, we design a novel query-driven graph summarization approach tailored for property graphs. These significantly differ from RDF and relational data models, as they attach data values to property lists on both nodes and edges [7].…”

Section: Fig 2: Targeted Advertising Queriesmentioning

confidence: 99%

“…Graph Model. We take the property graph model (PGM) [7] as our foundation. Graph instances are multi-edge digraphs; its objects are represented by typed, data vertices and their relationships, by typed, labeled edges.…”

Section: Preliminariesmentioning

confidence: 99%

“…A tremendous amount of information stored in the LOD can be inspected, by leveraging the already mature query capabilities of SPARQL, relational, and graph databases [14]. However, arbitrarily complex queries [2,3,7], entailing rather intricate, possibly recursive, graph patterns prove difficult to evaluate, even on small-sized graph datasets [4,5]. On the other hand, the usage of these queries has radically increased in real-world query logs, as shown by recent empirical studies on SPARQL queries from large-scale Wikidata and DBPedia corpuses [8,17].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Approximate Querying on Property Graphs

Dumbrava

Bonifati

Diaz

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Property graphs are becoming widespread when modeling data with complex structural characteristics and enriching edges and nodes with a list of properties. In this paper, we focus on the approximate evaluation of counting queries involving recursive paths on property graphs. As such queries are already difficult to evaluate over pure RDF graphs, they require an ad-hoc graph summary for their approximate evaluation on property graphs. We prove the intractability of the optimal graph summarization problem, under our algorithm's conditions. We design and implement a novel property graph summary suitable for the above queries, along with an approximate query evaluation module. Finally, we show the compactness of the obtained summaries as well as the accuracy of answering counting recursive queries on them.

show abstract

Section: Fig 2: Targeted Advertising Queriesmentioning

confidence: 99%

Section: Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Approximate Querying on Property Graphs

Dumbrava

Bonifati

Diaz

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…The data in these applications are typically modeled as multi-relation graphs capturing the heterogeneous multiple correlations among real-world entities as entity-connecting edges. Compared to other emerging graph models, e.g., the property graph model [4,3], which allows multiple attributes and values to be associated with vertices and edges, the multi-relation model is simplified to focus on the correlation of vertices. This graph model has been attracting increasing research interest in graph analytics with most work focusing on structural graph characteristics, e.g., reachability between two vertices under given edge label constraints [46], or finding paths that have consecutive edge labels that satisfy a user-specified logical expression [36,23,17].…”

Section: Introductionmentioning

confidence: 99%

Correlation constraint shortest path over large multi-relation graphs

Zhang

Özsu

2019

Proc. VLDB Endow.

View full text Add to dashboard Cite

Multi-relation graphs intuitively capture the heterogeneous correlations among real-world entities by allowing multiple types of relationships to be represented as entity-connecting edges, i.e., two entities could be correlated with more than one type of relationship. This is important in various applications such as social network analysis, ecology, and bio-informatics. Existing studies on these graphs usually consider an edge label constraint perspective, where each edge contains only one label and each edge is considered independently. For example, there are lines of research focusing on reachability between two vertices under a set of edge label constraints, or finding paths whose consecutive edge labels satisfy a user-specified logical expression. This is too restricted in real graphs, and in this work, we define a generic correlation constraint on multi-relation graphs from the perspective of vertex correlations, where a correlation can be defined recursively. Specifically, we formalize and investigate the shortest path problem over large multi-relation graphs in the presence of both necessity and denial constraints, which have various real applications. We show that it is nontrivial to apply conventional graph traversal algorithms (e.g., BFS or DFS) to address the challenge. To effectively reduce the search space, we propose a Hybrid Relation Encoding method, a.k.a. HyRE, to encode both topological and relation information in a compact way. We conduct extensive experiments over large real-world graphs to validate the effectiveness and efficiency of the proposed solution.

show abstract

“…Precisely, in our development we focus on the following Cypher operations: create to create nodes and edges, merge to match and create edges, set to set the properties of nodes and edges, delete to delete nodes and edges, detach delete to force removal of nodes with incident edges 8. Leonid Libkin, private communication.…”

mentioning

confidence: 99%

Schema Validation and Evolution for Graph Databases

Bonifati¹,

Furniss²,

Green³

et al. 2019

Conceptual Modeling

Self Cite

View full text Add to dashboard Cite

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). The 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 Neo4j 3.5, like in most commercial graph databases, full support is missing allowing to constraint property graphs with more or less flexibility.In this paper, we focus on two different perspectives from which a PG schema should be considered, as being descriptive or prescriptive, and we show how it would be possible to switch from one to another as the application under development gains more stability. Apart from proposing concise schema DDL inspired by Cypher syntax, we show how schema validation can be enforced through homomorphisms between PG schemas and PG instances; and how schema evolution can be described through the use of graph rewriting operations. Our prototypical implementation demonstrates feasibility and shows the need of offering high-level query primitives to accommodate flexible graph schema requirements as showcased in our work. * Currently on leave at the University of Waterloo, Canada.

show abstract

Querying Graphs

Cited by 55 publications

References 180 publications

Approximate Querying on Property Graphs

Approximate Querying on Property Graphs

Correlation constraint shortest path over large multi-relation graphs

Schema Validation and Evolution for Graph Databases

Contact Info

Product

Resources

About