1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2023
ITR: Grammar-based Graph Compression Supporting Fast Triple Queries
Enno Adler, Stefan Böttcher, Rita Hartel
Neighborhood queries and triple queries are the most common queries on graphs; thus, it is desirable to answer them efficiently on compressed data structures. We present a compress…
cs.DB2013
Efficient XML Keyword Search based on DAG-Compression
Stefan Böttcher, Rita Hartel, Jonathan Rabe
In contrast to XML query languages as e.g. XPath which require knowledge on the query language as well as on the document structure, keyword search is open to anybody. As the size…