3 citations · 5 across the 6 of their papers we have counts for
6 papers
Schema Matching with Large Language Models: an Experimental Study
Marcel Parciak, Brecht Vandevoort, Frank Neven +2
Large Language Models (LLMs) have shown useful applications in a variety of tasks, including data wrangling. In this paper, we investigate the use of an off-the-shelf LLM for schem…
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control
Brecht Vandevoort, Bas Ketsman, Frank Neven
A DBMS allows trading consistency for efficiency through the allocation of isolation levels that are strictly weaker than serializability. The robustness problem asks whether, for…
Detecting Robustness against MVRC for Transaction Programs with Predicate Reads
Brecht Vandevoort, Bas Ketsman, Christoph Koch +1
The transactional robustness problem revolves around deciding whether, for a given workload, a lower isolation level than Serializable is sufficient to guarantee serializability. T…
Parallel-Correctness and Transferability for Conjunctive Queries
Tom J. Ameloot, Gaetano Geck, Bas Ketsman +2
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round mul…
SCULPT: A Schema Language for Tabular Data on the Web
Wim Martens, Frank Neven, Stijn Vansummeren
Inspired by the recent working effort towards a recommendation by the World Wide Web Consortium (W3C) for tabular data and metadata on the Web, we present in this paper a concept f…
Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data
Geert Jan Bex, Wouter Gelade, Frank Neven +1
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of p…