Frank Neven

SIGMOD Rec., March, 2024

When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control.

[BibT_eX]

[DOI]

Brecht Vandevoort

Proc. ACM Manag. Data, 2024

Schema Matching with Large Language Models: an Experimental Study.

[BibT_eX]

[DOI]

Proceedings of Workshops at the 50th International Conference on Very Large Data Bases, 2024

Measuring Approximate Functional Dependencies: A Comparative Study.

[BibT_eX]

[DOI]

Proceedings of the 40th IEEE International Conference on Data Engineering, 2024

2023

When is it safe to run a transactional workload under Read Committed?

[BibT_eX]

[DOI]

SIGMOD Rec., 2023

CM-Explorer: Dissecting Data Ingestion Problems.

[BibT_eX]

[DOI]

Niels Bylois

Proc. VLDB Endow., 2023

Robustness against Read Committed for Transaction Templates with Functional Constraints.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2023

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2023.

[BibT_eX]

[DOI]

Marcelo Arenas

Wenfei Fan

Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Detecting Robustness against MVRC for Transaction Programs with Predicate Reads.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 26th International Conference on Extending Database Technology, 2023

Data Ingestion Validation through Stable Conditional Metrics with Ranking and Filtering.

[BibT_eX]

[DOI]

Niels Bylois

Proceedings of the Advances in Databases and Information Systems, 2023

2022

Concurrency control for database theorists.

[BibT_eX]

[DOI]

SIGMOD Rec., December, 2022

Deciding Robustness for Lower SQL Isolation Levels.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2022

Robustness Against Read Committed: A Free Transactional Lunch.

[BibT_eX]

[DOI]

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021

Robustness against Read Committed for Transaction Templates.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2021

2020

Distribution Constraints: The Chase for Distributed Data.

[BibT_eX]

[DOI]

Gaetano Geck

Proceedings of the 23rd International Conference on Database Theory, 2020

2019

Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2019

Split-Correctness in Information Extraction.

[BibT_eX]

[DOI]

Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Parallel-Correctness and Parallel-Boundedness for Datalog Programs.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Database Theory, 2019

2018

XML Types.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, Second Edition, 2018

Finite-State Map-Reduce Computation and Relational Algebra Queries.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2018

Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).

[BibT_eX]

[DOI]

Dagstuhl Manifestos, 2018

Chisel: Sculpting Tabular and Non-Tabular Data on the Web.

[BibT_eX]

[DOI]

Proceedings of the Companion of the The Web Conference 2018 on The Web Conference 2018, 2018

Parallel-Correctness and Transferability for Conjunctive Queries under Bag Semantics.

[BibT_eX]

[DOI]

Brecht Vandevoort

Proceedings of the 21st International Conference on Database Theory, 2018

Satisfiability for SCULPT-Schemas for CSV-Like Data.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Database Theory, 2018

2017

BonXai: Combining the Simplicity of DTD with the Expressiveness of XML Schema.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2017

Datalog Queries Distributing over Components.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2017

Optimal Broadcasting Strategies for Conjunctive Queries over Distributed Data.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Parallel-Correctness and Transferability for Conjunctive Queries.

[BibT_eX]

[DOI]

J. ACM, 2017

Reasoning on data partitioning for single-round multi-join evaluation in massively parallel systems.

[BibT_eX]

[DOI]

Commun. ACM, 2017

2016

Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2016

Data partitioning for single-round multi-join evaluation in massively parallel systems.

[BibT_eX]

[DOI]

SIGMOD Rec., 2016

Research Directions for Principles of Data Management (Abridged).

[BibT_eX]

[DOI]

SIGMOD Rec., 2016

Parallel Evaluation of Multi-Semi-Joins.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2016

Logical Aspects of Massively Parallel and Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015

Deciding Twig-definability of Node Selecting Tree Automata.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

SCULPT: A Schema Language for Tabular Data on the Web.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web, 2015

The ACM PODS Alberto O. Mendelzon Test-of-Time Award 2015.

[BibT_eX]

[DOI]

Foto N. Afrati

Dan Suciu

Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Distributed Streaming with Finite Memory.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Database Theory, 2015

Gumbo: Guarded Fragment Queries over Big Data.

[BibT_eX]

[DOI]

Jonny Daenen

Tony Tan

Proceedings of the 18th International Conference on Extending Database Technology, 2015

2014

Discovering XSD Keys from XML Data.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2014

Remaining CALM in Declarative Networking.

[BibT_eX]

[DOI]

Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

2013

Mining Minimal Motif Pair Sets Maximally Covering Interactions in a Protein-Protein Interaction Network.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Making Queries Tractable on Big Data with Preprocessing.

[BibT_eX]

[DOI]

Wenfei Fan

Floris Geerts

Proc. VLDB Endow., 2013

Generating, Sampling and Counting Subclasses of Regular Tree Languages.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2013

Simplifying XML Schema: Single-type approximations of regular tree languages.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Relational transducers for declarative networking.

[BibT_eX]

[DOI]

Tom J. Ameloot

J. ACM, 2013

Definability problems for graph query languages.

[BibT_eX]

[DOI]

Timos Antonopoulos

Frédéric Servais

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Succinctness of the Complement and Intersection of Regular Expressions.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2012

Developing and Analyzing XSDs through BonXai.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2012

2011

SLIDER: A Generic Metaheuristic for the Discovery of Correlated Motifs in Protein-Protein Interaction Networks.

[BibT_eX]

[DOI]

Peter Boyen

Dries Van Dyck

Roeland C. H. J. van Ham

Aalt D. J. van Dijk

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

30 Years of PODS in facts and figures.

[BibT_eX]

[DOI]

SIGMOD Rec., 2011

Succinctness of pattern-based schema languages for XML.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2011

The complexity of text-preserving XML transformations.

[BibT_eX]

[DOI]

Timos Antonopoulos

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

2010

Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data.

[BibT_eX]

[DOI]

ACM Trans. Web, 2010

Inference of concise regular expressions and DTDs.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2010

Optimizing the Region Algebra is PSPACE-complete.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Simplifying XML schema: single-type approximations of regular tree languages.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009

XML Types.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Database Systems, 2009

Complexity of Decision Problems for XML Schemas and Chain Regular Expressions.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Optimizing Schema Languages for XML: Numerical Constraints and Interleaving.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Simplifying XML schema: effortless handling of nondeterministic regular expressions.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009

SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks.

[BibT_eX]

[DOI]

Roeland C. H. J. van Ham

Proceedings of the ICDM 2009, 2009

2008

Expressiveness and complexity of XML publishing transducers.

[BibT_eX]

[DOI]

Wenfei Fan

Floris Geerts

Anastasios Kementsietsidis

ACM Trans. Database Syst., 2008

Scalable multi-query optimization for exploratory queries over federated scientific databases.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2008

Typechecking top-down XML transformations: Fixed input or output schemas.

[BibT_eX]

[DOI]

Marc Gyssens

Inf. Comput., 2008

SchemaScope: a system for inferring and cleaning XML schemas.

[BibT_eX]

[DOI]

Anastasios Kementsietsidis

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Complexity and composition of synthesized web services.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

BioScout: a life-science query monitoring system.

[BibT_eX]

[DOI]

Proceedings of the EDBT 2008, 2008

Deterministic top-down tree automata: past, present, and future.

[BibT_eX]

Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007

Logical definability and query languages over ranked and unranked trees.

[BibT_eX]

[DOI]

Michael Benedikt

Leonid Libkin

ACM Trans. Comput. Log., 2007

Simple off the shelf abstractions for XML schema.

[BibT_eX]

[DOI]

SIGMOD Rec., 2007

Frontiers of tractability for typechecking simple XML transformations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2007

Inferring XML Schema Definitions from XML Data.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

2006

Expressiveness and complexity of XML Schema.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2006

On the complexity of XPath containment in the presence of disjunction, DTDs, and variables.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas

[BibT_eX]

[DOI]

Marc Gyssens

CoRR, 2006

Inference of Concise DTDs from XML Data.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

Optimizing Monitoring Queries over Distributed Data.

[BibT_eX]

[DOI]

Proceedings of the Advances in Database Technology, 2006

An Extensible Light-Weight XML-Based Monitoring System for Sequence Databases.

[BibT_eX]

[DOI]

Kerstin Koch

Proceedings of the Data Integration in the Life Sciences, Third International Workshop, 2006

2005

On the complexity of typechecking top-down XML transformations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Attribute grammars for unranked trees as a query language for structured documents.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2005

Expressiveness of XSDs: from practice to theory, there and back again.

[BibT_eX]

[DOI]

Proceedings of the 14th international conference on World Wide Web, 2005

Which XML Schemas Admit 1-Pass Preorder Typing?

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2005

05061 Summary - Foundations of Semi-structured Data.

[BibT_eX]

[DOI]

Dan Suciu

Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

05061 Abstracts Collection - Foundations of Semistructured Data.

[BibT_eX]

[DOI]

Dan Suciu

Proceedings of the Foundations of Semistructured Data, 6.-11. February 2005, 2005

2004

Finite state machines for strings over infinite alphabets.

[BibT_eX]

[DOI]

Victor Vianu

ACM Trans. Comput. Log., 2004

DTDs versus XML Schema: A Practical Study.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Workshop on the Web and Databases, 2004

Complexity of Decision Problems for Simple Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Typechecking XML views of relational databases.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2003

Reminiscences on Influential Papers.

[BibT_eX]

[DOI]

Kenneth A. Ross

Beng Chin Ooi

SIGMOD Rec., 2003

XML with data values: typechecking revisited.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2003

On the power of tree-walking automata.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Logical Definability and Query Languages over Unranked Trees.

[BibT_eX]

[DOI]

Leonid Libkin

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

XPath Containment in the Presence of Disjunction, DTDs, and Variables.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2003

Typechecking Top-Down Uniform Unranked Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2003

2002

Query automata over finite trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Automata Theory for XML Researchers.

[BibT_eX]

[DOI]

SIGMOD Rec., 2002

Expressiveness of structured document query languages based on attribute grammars.

[BibT_eX]

[DOI]

J. ACM, 2002

A formal model for an expressive fragment of XSLT.

[BibT_eX]

[DOI]

Sebastian Maneth

Inf. Syst., 2002

On the Power of Walking for Querying Tree-Structured Data.

[BibT_eX]

[DOI]

Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

Automata, Logic, and XML.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Adding For-Loops to First-Order Logic.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Automata-and Logic-Based Pattern Languages for Tree-Structured Data.

[BibT_eX]

[DOI]

Proceedings of the Semantics in Databases, 2001

Towards Regular Languages over Infinite Alphabets.

[BibT_eX]

[DOI]

Victor Vianu

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Expressive and Efficient Pattern Languages for Tree-Structured Data.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

1999

Typed Query Languages for Databases Containing Queries.

[BibT_eX]

[DOI]

Inf. Syst., 1999

Query Automata.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31, 1999

Automata for Unary Queries on Trees.

[BibT_eX]

Proceedings of the 11. Workshop Grundlagen von Datenbanken, 1999

Extensions of Attribute Grammars for Structured Document Queries.

[BibT_eX]

[DOI]

Proceedings of the Research Issues in Structured and Semistructured Database Programming, 1999

Structured Document Transformations Based on XSL.

[BibT_eX]

[DOI]

Sebastian Maneth

Proceedings of the Research Issues in Structured and Semistructured Database Programming, 1999

1998

Structured Document Query Languages Based on Attribute Grammars: Locality and Non-Determinism.

[BibT_eX]

Proceedings of the Fundamentals of Information Systems, 1998

1997

On Implementing Structured Document Query Facilities on Top of a DOOD.

[BibT_eX]

[DOI]