Henning Köhler

Orcid: 0000-0002-4688-920X

According to our database1, Henning Köhler authored at least 53 papers between 2005 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
BatchHL<sup>+</sup>: batch dynamic labelling for distance queries on large-scale networks.
VLDB J., January, 2024

2023
Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks.
Proc. ACM Manag. Data, December, 2023

Cardinality constraints and functional dependencies in SQL: Taming data redundancy in logical database design.
Inf. Syst., May, 2023

2022
Possibilistic Data Cleaning.
IEEE Trans. Knowl. Data Eng., 2022

BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
Possible Keys and Functional Dependencies.
J. Data Semant., 2021

Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks.
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021

2019
Possibilistic keys.
Fuzzy Sets Syst., 2019

A characterization of maximal 2-dimensional subgraphs of transitive graphs.
CoRR, 2019

2018
SQL schema design: foundations, normal forms, and normalization.
Inf. Syst., 2018

An SQL Data Summarization Tool for the Acquisition of Meaningful Cardinality Constraints and Functional Dependencies.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

Extremal Combinatorics of SQL Keys.
Proceedings of the Models: Concepts, Theory, Logic, Reasoning and Semantics, 2018

2017
Inclusion dependencies and their interaction with functional dependencies in SQL.
J. Comput. Syst. Sci., 2017

Modular decomposition of transitive graphs and transitively orienting their complements.
CoRR, 2017

2016
Possible and certain keys for SQL.
VLDB J., 2016

Discovering Meaningful Certain Keys from Incomplete and Inconsistent Relations.
IEEE Data Eng. Bull., 2016

Keys with Probabilistic Intervals.
Proceedings of the Conceptual Modeling - 35th International Conference, 2016

Qualitative Cleaning of Uncertain Data.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2015
Possible and Certain SQL Key.
Proc. VLDB Endow., 2015

Cardinality constraints on qualitatively uncertain data.
Data Knowl. Eng., 2015

Constructing Armstrong tables for general cardinality constraints and not-null constraints.
Ann. Math. Artif. Intell., 2015

Inclusion Dependencies Reloaded.
Proceedings of the 24th ACM International Conference on Information and Knowledge Management, 2015

2014
Saturated Conditional Independence with Fixed and Undetermined Sets of Incomplete Random Variables.
Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, 2014

Logical Foundations of Possibilistic Keys.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Logics for Approximating Implication Problems of Saturated Conditional Independence.
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014

Cardinality Constraints for Uncertain Data.
Proceedings of the Conceptual Modeling - 33rd International Conference, 2014

2012
Armstrong Databases and Reasoning for Functional Dependencies and Cardinality Constraints over Partial Bags.
Proceedings of the Foundations of Information and Knowledge Systems, 2012

Efficient provenance storage for relational queries.
Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2012

Foundations for a Fourth Normal Form over SQL-Like Databases.
Proceedings of the Conceptual Modelling and Its Theoretical Foundations, 2012

2011
Flexible Provenance Tracing.
Int. J. Syst. Serv. Oriented Eng., 2011

Autonomous sets for the hypergraph of all canonical covers.
Ann. Math. Artif. Intell., 2011

The Boyce-Codd-Heath Normal Form for SQL.
Proceedings of the Logic, Language, Information and Computation, 2011

Efficient parallel skyline processing using hyperplane projections.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2011

Storage and Use of Provenance Information for Relational Database Queries.
Proceedings of the Database Systems for Advanced Applications, 2011

2010
Armstrong axioms and Boyce-Codd-Heath Normal Form under bag semantics.
Inf. Process. Lett., 2010

Providing Flexible Tradeoff for Provenance Tracking.
Proceedings of the Web Information Systems Engineering - WISE 2010 Workshops, 2010

Rebuilding the World from Views.
Proceedings of the Web-Age Information Management, 11th International Conference, 2010

Sampling dirty data for matching attributes.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

On the Existence of Armstrong Data Trees for XML Functional Dependencies.
Proceedings of the Foundations of Information and Knowledge Systems, 2010

Transitivity-Preserving Skylines for Partially Ordered Domains.
Proceedings of the Database Systems for Advanced Applications, 2010

Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation.
Proceedings of the Advances in Web Technologies and Applications, 2010

Ontology consolidation in bioinformatics.
Proceedings of the Conceptual Modelling 2010, 2010

Estimating set intersection using small samples.
Proceedings of the Computer Science 2010, 2010

2009
Dynamic Data Warehouse Design with Abstract State Machines.
J. Univers. Comput. Sci., 2009

Global Database Design based on Storage Space and Update Time Minimization.
J. Univers. Comput. Sci., 2009

2008
On the Notion of an XML Key.
Proceedings of the Semantics in Data and Knowledge Bases, Third International Workshop, 2008

Lossless Decompositions in Complex-Valued Databases.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

Autonomous Sets - A Method for Hypergraph Decomposition with Applications in Database Theory.
Proceedings of the Foundations of Information and Knowledge Systems, 2008

2007
Full hierarchical dependencies in fixed and undetermined universes.
Ann. Math. Artif. Intell., 2007

Dynamic Data Warehouse Design as a Refinement in ASM-based Approach.
Proceedings of the Conceptual Modelling 2007, Proceedings of the Fourth Asia-Pacific Conference on Conceptual Modelling (APCCM2007), Ballarat, Victoria, Australia, January 30, 2007

Domination Normal Form - Decomposing Relational Database Schemas.
Proceedings of the Computer Science 2007. Proceedings of the Thirtieth Australasian Computer Science Conference (ACSC2007). Ballarat, Victoria, Australia, January 30, 2007

2006
Finding Faithful Boyce-Codd Normal Form Decompositions.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
A Contraction Algorithm for finding Minimal Feedback Sets.
Proceedings of the Computer Science 2005, 2005


  Loading...