2 citations · 2 across the 3 of their papers we have counts for
3 papers · 1 filter
An experimental comparison of tree-data structures for connectivity queries on fully-dynamic undirected graphs (Extended Version)
Qing Chen, Michael H. Böhlen, Sven Helmer
During the past decades significant efforts have been made to propose data structures for answering connectivity queries on fully dynamic graphs, i.e., graphs with frequent inserti…
Robust and Scalable Content-and-Structure Indexing (Extended Version)
Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer +2
Frequent queries on semi-structured hierarchical data are Content-and-Structure (CAS) queries that filter data items based on their location in the hierarchical structure and their…
Dynamic Interleaving of Content and Structure for Robust Indexing of Semi-Structured Hierarchical Data (Extended Version)
Kevin Wellenzohn, Michael H. Böhlen, Sven Helmer
We propose a robust index for semi-structured hierarchical data that supports content-and-structure (CAS) queries specified by path and value predicates. At the heart of our approa…