Floris Geerts

According to our database1, Floris Geerts
  • authored at least 98 papers between 1997 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
First-order under-approximations of consistent query answers.
Int. J. Approx. Reasoning, 2017

On the expressive power of query languages for matrices.
CoRR, 2017

Cleaning Data with Forbidden Itemsets.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016
Capturing Missing Tuples and Missing Values.
ACM Trans. Database Syst., 2016

Algebraic Structures for Capturing the Provenance of SPARQL Queries.
J. ACM, 2016

Bounded correlation clustering.
I. J. Data Science and Analytics, 2016

Bounded Query Rewriting Using Views.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Scale Independence: Using Small Data to Answer Queries on Big Data (Invited Talk).
Proceedings of the 19th International Conference on Database Theory, 2016

2015
On recommendation problems beyond points of interest.
Inf. Syst., 2015

Cell-based Causality for Data Repairs.
Proceedings of the 7th USENIX Workshop on the Theory and Practice of Provenance, 2015

First-Order Under-Approximations of Consistent Query Answers.
Proceedings of the Scalable Uncertainty Management - 9th International Conference, 2015

Querying Big Data by Accessing Small Data.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

Space-Bounded Query Approximation.
Proceedings of the Advances in Databases and Information Systems, 2015

2014
That's All Folks! LLUNATIC Goes Open Source.
PVLDB, 2014

Conflict resolution with data currency and consistency.
J. Data and Information Quality, 2014

On the data complexity of relative information completeness.
Inf. Syst., 2014

Detecting Errors in Numeric Attributes.
Proceedings of the Web-Age Information Management - 15th International Conference, 2014

An Overview of the Llunatic System.
Proceedings of the 22nd Italian Symposium on Advanced Database Systems, 2014

On scale independence for querying big data.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Mapping and cleaning.
Proceedings of the IEEE 30th International Conference on Data Engineering, Chicago, 2014

Interactive correlation clustering.
Proceedings of the International Conference on Data Science and Advanced Analytics, 2014

2013
On the Complexity of Package Recommendation Problems.
SIAM J. Comput., 2013

The LLUNATIC Data-Cleaning Framework.
PVLDB, 2013

Making Queries Tractable on Big Data with Preprocessing.
PVLDB, 2013

Generating, Sampling and Counting Subclasses of Regular Tree Languages.
Theory Comput. Syst., 2013

Algebraic structures for capturing the provenance of SPARQL queries.
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Inferring data currency and consistency for conflict resolution.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

Looking at the World Thru Colored Glasses.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

Data Quality Problems beyond Consistency and Deduplication.
Proceedings of the In Search of Elegance in the Theory and Practice of Computation, 2013

2012
Foundations of Data Quality Management
Synthesis Lectures on Data Management, Morgan & Claypool Publishers, 2012

Determining the Currency of Data.
ACM Trans. Database Syst., 2012

On the Complexity of View Update Analysis and Its Application to Annotation Propagation.
IEEE Trans. Knowl. Data Eng., 2012

View determinacy for preserving selected information in data transformations.
Inf. Syst., 2012

On the complexity of package recommendation problems.
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012

2011
Discovering Conditional Functional Dependencies.
IEEE Trans. Knowl. Data Eng., 2011

Foreword.
Theory Comput. Syst., 2011

Relational completeness of query languages for annotated databases.
J. Comput. Syst. Sci., 2011

Uniform Dependency Language for Improving Data Quality.
IEEE Data Eng. Bull., 2011

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

Generating, sampling and counting subclasses of regular tree languages.
Proceedings of the Database Theory, 2011

2010
Relative information completeness.
ACM Trans. Database Syst., 2010

On database query languages for K-relations.
J. Applied Logic, 2010

Capturing missing tuples and missing values.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Static analysis of schema-mappings ensuring oblivious termination.
Proceedings of the Database Theory, 2010

Detecting inconsistencies in distributed data.
Proceedings of the 26th International Conference on Data Engineering, 2010

2009
Constraint Query Languages.
Proceedings of the Encyclopedia of Database Systems, 2009

Constraint Databases.
Proceedings of the Encyclopedia of Database Systems, 2009

Relative information completeness.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

Discovering Conditional Functional Dependencies.
Proceedings of the 25th International Conference on Data Engineering, 2009

Conditional Dependencies: A Principled Approach to Improving Data Quality.
Proceedings of the Dataspace: The Final Frontier, 2009

2008
Expressiveness and complexity of XML publishing transducers.
ACM Trans. Database Syst., 2008

Conditional functional dependencies for capturing data inconsistencies.
ACM Trans. Database Syst., 2008

First-order complete and computationally complete query languages for spatio-temporal databases.
ACM Trans. Comput. Log., 2008

A revival of integrity constraints for data cleaning.
PVLDB, 2008

Semandaq: a data quality system based on conditional functional dependencies.
PVLDB, 2008

XPath satisfiability in the presence of DTDs.
J. ACM, 2008

Complexity and composition of synthesized web services.
Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

Increasing the Expressivity of Conditional Functional Dependencies without Extra Complexity.
Proceedings of the 24th International Conference on Data Engineering, 2008

2007
Real Algebraic Geometry and Constraint Databases.
Proceedings of the Handbook of Spatial Logics, 2007

Improving Data Quality: Consistency and Accuracy.
Proceedings of the 33rd International Conference on Very Large Data Bases, 2007

Expressiveness and complexity of xml publishing transducers.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Rewriting Regular XPath Queries on XML Views.
Proceedings of the 23rd International Conference on Data Engineering, 2007

Conditional Functional Dependencies for Data Cleaning.
Proceedings of the 23rd International Conference on Data Engineering, 2007

Relational Completeness of Query Languages for Annotated Databases.
Proceedings of the Database Programming Languages, 11th International Symposium, 2007

2006
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases.
SIAM J. Comput., 2006

On-line topological simplification of weighted graphs
CoRR, 2006

HaploRec: efficient and accurate large-scale reconstruction of haplotypes.
BMC Bioinformatics, 2006

SMOQE: A System for Providing Secure Access to XML.
Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

MONDRIAN: Annotating and Querying Databases through Colors and Blocks.
Proceedings of the 22nd International Conference on Data Engineering, 2006

On-line maintenance of simplified weighted graphs for efficient distance queries.
Proceedings of the 14th ACM International Symposium on Geographic Information Systems, 2006

iMONDRIAN: A Visual Tool to Annotate and Query Scientific Databases.
Proceedings of the Advances in Database Technology, 2006

Annotation propagation revisited for key preserving views.
Proceedings of the 2006 ACM CIKM International Conference on Information and Knowledge Management, 2006

2005
Tight upper bounds on the number of candidate patterns.
ACM Trans. Database Syst., 2005

On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases.
Theor. Comput. Sci., 2005

First-order Complete and Computationally Complete Query Languages for Spatio-Temporal Databases
CoRR, 2005

N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets.
Acta Inf., 2005

XPath satisfiability in the presence of DTDs.
Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Satisfiability of XPath Queries with Sibling Axes.
Proceedings of the Database Programming Languages, 10th International Symposium, 2005

2004
Topological formulation of termination properties of iterates of functions.
Inf. Process. Lett., 2004

Frequent Knot Discovery
CoRR, 2004

Relational link-based ranking.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, August 31, 2004

A Markov Chain Approach to Reconstruction of Long Haplotypes.
Proceedings of the Biocomputing 2004, 2004

Tiling Databases.
Proceedings of the Discovery Science, 7th International Conference, 2004

Moving Objects and Their Equations of Motion.
Proceedings of the Constraint Databases, 2004

2003
Expressing the box cone radius in the relational calculus with real polynomial constraints.
Discrete & Computational Geometry, 2003

Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets
CoRR, 2003

What You Store is What You Get.
Proceedings of the Second International Workshop on Inductive Databases, 2003

Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases.
Proceedings of the Database Theory, 2003

2001
A Tight Upper Bound on the Number of Candidate Patterns
CoRR, 2001

Expressing the cone radius in the relational calculus with real polynomial constraints
CoRR, 2001

A Tight Upper Bound on the Number of Candidate Patterns.
Proceedings of the 2001 IEEE International Conference on Data Mining, 29 November, 2001

A Theory of Spatio-Temporal Database Queries.
Proceedings of the Database Programming Languages, 8th International Workshop, 2001

Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension.
Proceedings of the Database Programming Languages, 8th International Workshop, 2001

2000
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic.
Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2000

1999
Expressing Topological Connectivity of Spatial Databases.
Proceedings of the Research Issues in Structured and Semistructured Database Programming, 1999

1998
Topological Canonization of Planar Spatial Data and Its Incremental Maintenance.
Proceedings of the Fundamentals of Information Systems, 1998

Superposition of Markov sources and long range dependence.
Proceedings of the Broadband Communications: The future of telecommunications, 1998

1997
The Correlation Structure of the Output of an ATM Multiplexer.
Proceedings of the Performance Analysis of ATM Networks, 1997


  Loading...