36 citations · 60 across the 10 of their papers we have counts for
10 papers
Rewriting Ontology-Mediated Property Graph Queries into GQL
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus +1
Ontology-based data access is intended for graph data, but practical support remains limited to SQL-like languages lacking the navigational and path-matching features fundamental t…
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus +1
Despite the many advantages that ontology-based data access (OBDA) has brought to a range of application domains, state-of-the-art OBDA systems still do not support popular graph d…
KOIOS: Top-k Semantic Overlap Set Search
Pranay Mundra, Jianhao Zhang, Fatemeh Nargesian +1
We study the top-k set similarity search problem using semantic overlap. While vanilla overlap requires exact matches between set elements, semantic overlap allows elements that ar…
FINEX: A Fast Index for Exact & Flexible Density-Based Clustering (Extended Version with Proofs)*
Konstantin Emil Thiel, Daniel Kocher, Nikolaus Augsten +3
Density-based clustering aims to find groups of similar objects (i.e., clusters) in a given dataset. Applications include, e.g., process mining and anomaly detection. It comes with…
How to reduce the search space of Entity Resolution: with Blocking or Nearest Neighbor search?
George Papadakis, Marco Fisichella, Franziska Schoger +3
Entity Resolution suffers from quadratic time complexity. To increase its time efficiency, three kinds of filtering techniques are typically used for restricting its search space:…
JEDI: These aren't the JSON documents you're looking for... (Extended Version*)
Thomas Hütter, Nikolaus Augsten, Christoph M. Kirsch +2
The JavaScript Object Notation (JSON) is a popular data format used in document stores to natively support semi-structured data. In this paper, we address the problem of JSON simil…
Statistics of Knowledge Graphs Based On The Conceptual Schema
Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski +1
In this paper, we propose a new approach for the computation of the statistics of knowledge graphs. We introduce a schema graph that represents the main framework for the computati…
A Relational Matrix Algebra and its Implementation in a Column Store
Oksana Dolmatova, Nikolaus Augsten, Michael H. Boehlen
Analytical queries often require a mixture of relational and linear algebra operations applied to the same data. This poses a challenge to analytic systems that must bridge the gap…
SWOOP: Top-k Similarity Joins over Set Streams
Willi Mann, Nikolaus Augsten, Christian S. Jensen
We provide efficient support for applications that aim to continuously find pairs of similar sets in rapid streams of sets. A prototypical example setting is that of tweets. A twee…
RTED: A Robust Algorithm for the Tree Edit Distance
Mateusz Pawlik, Nikolaus Augsten
We consider the classical tree edit distance between ordered labeled trees, which is defined as the minimum-cost sequence of node edit operations that transform one tree into anoth…