EDBT 2026 Demo / reviewers in the wild / expert
Petra Selmer
dblp:50/7441
· DBLP profile ↗
9ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0008-9395-3770ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 8 · 3 since 2021Artificial intelligence and machine learning · 2Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Towards Hybrid Graphs: Unifying Property Graphs and Time Series
Mouna Ammar, Christopher Rost, Riccardo Tommasini 0001, Shubhangi Agarwal 0001, Angela Bonifati, Petra Selmer, Evgeny Kharlamov, Erhard Rahm |
EDBT | 6 |
| 2024 | Seraph: Continuous Queries on Property Graph StreamsabstractInternational audience Christopher Rost, Riccardo Tommasini 0001, Angela Bonifati, Emanuele Della Valle, Erhard Rahm, Keith W. Hare, Stefan Plantikow, Petra Selmer, Hannes Voigt |
EDBT | 8 |
| 2022 | Graph Pattern Matching in GQL and SQL/PGQabstractAs graph databases become widespread, the International Organization for Standardization (ISO) and International Electrotechnical Commission (IEC) have approved a project to create GQL, a standard property graph query language. This complements the SQL/PGQ project, which specifies how to define graph views over a SQL tabular schema, and to run read-only queries against them. Alin Deutsch, Nadime Francis, Alastair Green, Keith W. Hare, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Wim Martens, Jan Michels, Filip Murlak, Stefan Plantikow, Petra Selmer, Oskar van Rest, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Fred Zemke |
SIGMOD Conference | 13 |
| 2019 | Approximate Querying for the Property Graph Language CypherabstractGraph databases are well-suited to managing large, complex, dynamically evolving datasets. However, for data that is irregular and heterogeneous, it may be difficult to formulate queries that precisely capture a user's information seeking requirements. This points to the need for approximate query processing capabilities that can automatically make changes to a query so as to aid in the incremental discovery of relevant information. In this paper we motivate and explore techniques for providing such capabilities for the Cypher query language. This is the first time that query approximation has been investigated in the context of the property graph data model, which is becoming increasingly prevalent in research and industry. George Fletcher 0001, Alexandra Poulovassilis, Petra Selmer, Peter T. Wood |
IEEE BigData | 3 |
| 2019 | Updating Graph Databases with CypherabstractThe paper describes the present and the future of graph updates in Cypher, the language of the Neo4j property graph database and several other products. Update features include those with clear analogs in relational databases, as well as those that do not correspond to any relational operators. Moreover, unlike SQL, Cypher updates can be arbitrarily intertwined with querying clauses. After presenting the current state of update features, we point out their shortcomings, most notably violations of atomicity and non-deterministic behavior of updates. These have not been previously known in the Cypher community. We then describe the industry-academia collaboration on designing a revised set of Cypher update operations. Based on discovered shortcomings of update features, a number of possible solutions were devised. They were presented to key Cypher users, who were given the opportunity to comment on how update features are used in real life, and on their preferences for proposed fixes. As the result of the consultation, a new set of update operations for Cypher were designed. Those led to a streamlined syntax, and eliminated the unexpected and problematic behavior that original Cypher updates exhibited. Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Martin Schuster, Petra Selmer, Hannes Voigt |
Proc. VLDB Endow. | 8 |
| 2018 | openCypher: New Directions in Property Graph Querying
Alastair Green, Martin Junghanns, Max Kießling, Tobias Lindaaker, Stefan Plantikow, Petra Selmer |
EDBT | 6 |
| 2018 | Cypher: An Evolving Query Language for Property GraphsabstractThe Cypher property graph query language is an evolving language, originally designed and implemented as part of the Neo4j graph database, and it is currently used by several commercial database products and researchers. We describe Cypher 9, which is the first version of the language governed by the openCypher Implementers Group. We first introduce the language by example, and describe its uses in industry. We then provide a formal semantic definition of the core read-query features of Cypher, including its variant of the property graph data model, and its ASCII Art graph pattern matching mechanism for expressing subgraphs of interest to an application. We compare the features of Cypher to other property graph query languages, and describe extensions, at an advanced stage of development, which will form part of Cypher 10, turning the language into a compositional language which supports graph projections and multiple named graphs. Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer, Andrés Taylor |
SIGMOD Conference | 9 |
| 2016 | Approximation and relaxation of semantic web path queries
Alexandra Poulovassilis, Petra Selmer, Peter T. Wood |
J. Web Semant. | 2 |
| 2009 | Minimal Module Extraction from DL-Lite Ontologies Using QBF Solvers
Roman Kontchakov, Luca Pulina, Ulrike Sattler, Thomas Schneider 0002, Petra Selmer, Frank Wolter, Michael Zakharyaschev |
IJCAI | 5 |