Filters








12 Hits in 5.8 sec

Join Geometries. A Theory of Convex Sets and Linear Geometry

Robert E. Jamison-Waldner, Walter Prenowitz, James Jantosciak
1984 The American mathematical monthly  
Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ...  NPRR's analysis makes a link from database theory to a pair of beautiful inequalities: one due to Atserias, Grohe, and Marx from computer science [2] and one due to Bollobás and Thomason from geometry  ... 
doi:10.2307/2322130 fatcat:mpodherwufabnlhlcc7r5schiq

On counting database repairs

Dany Maslowski, Jef Wijsen
2011 Proceedings of the 4th International Workshop on Logic in Databases - LID '11  
General Terms Theory, Algorithms Keywords Conjunctive queries; consistent query answering; database repairing; primary keys; probabilistic databases 10.5441/002/icdt.2014.18 157  ...  A repair (or possible world) of an uncertain database is obtained by selecting exactly one tuple from each block.  ...  Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ... 
doi:10.1145/1966357.1966361 dblp:conf/lid/MaslowskiW11 fatcat:jgrqhv244zb4joyaoxks45yvoa

Covering the Relational Join [article]

Shi Li and Sai Vikneshwar Mani Jayaraman and Atri Rudra
2020 arXiv   pre-print
The join covering problem captures both computing the natural join from database theory and constructing a covering code with covering radius Δ - 1 from coding theory, as special cases.  ...  One obvious approach to upper bound |T_Q, Δ| is to exploit a distance property (of Hamming distance) from coding theory and combine it with the worst-case bounds on output size of natural joins (AGM bound  ...  In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 4-14, 2014.  ... 
arXiv:2003.09537v1 fatcat:47gthdfjrjf5blxln3bwscvzsu

Datalog Rewritings of Regular Path Queries using Views

Nadime Francis, Luc Segoufin, Cristina Sirangelo, Maurizio Lenzerini
2015 Logical Methods in Computer Science  
We consider query answering using views on graph databases, i.e. databases structured as edge-labeled graphs. We mainly consider views and queries specified by Regular Path Queries (RPQ).  ...  We say that a view V determines a query Q if for all graph databases D, the view image V(D) always contains enough information to answer Q on D.  ...  Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ... 
doi:10.2168/lmcs-11(4:14)2015 fatcat:z6kpoibjbfekhe5vthqxv75sie

Deciding Determinism with Fairness for Simple Transducer Networks

Tom J. Ameloot
2015 ACM Transactions on Database Systems  
Acknowledgments The author thanks Jan Van den Bussche for his thoughtful comments on an earlier draft of this paper.  ...  Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ...  PRELIMINARIES Database Basics We first recall some basic notions from database theory [2] .  ... 
doi:10.1145/2757215 fatcat:6h5uvbjo4vg5zdrxrzostcydpi

Dynamic conjunctive queries

Thomas Zeume, Thomas Schwentick
2017 Journal of computer and system sciences (Print)  
It studies the impact of union, atomic negation and quantification on the dynamic expressiveness of CQ, for the standard semantics as well as for ∆-semantics.  ...  Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ...  (c) 2014 , 2014 Copyright is with the authors.  ... 
doi:10.1016/j.jcss.2017.03.014 fatcat:3ohiovmsmbhq5dnzijyb2uzdju

Knowledge Graphs: New Directions for Knowledge Representation on the Semantic Web (Dagstuhl Seminar 18371)

Piero Andrea Bonatti, Stefan Decker, Axel Polleres, Valentina Presutti, Michael Wagner
2019 Dagstuhl Reports  
More than two decades of Semantic Web research provides a solid basis and a promising technology and standards stack to interlink data, ontologies and knowledge on the Web.  ...  The increasingly pervasive nature of the Web, expanding to devices and things in everyday life, along with new trends in Artificial Intelligence call for new paradigms and a new look on Knowledge Representation  ...  Aidan Hogan is funded by the Millennium Institute for Foundational Research on Data (IMFD) and Fondecyt Grant No. 1181896.  ... 
doi:10.4230/dagrep.8.9.29 dblp:journals/dagstuhl-reports/BonattiDPP18 fatcat:z4lkmofnavf67c5v2sye2x2zle

Consistent Query Answering for Primary Keys

Paraschos Koutris, Jef Wijsen
2016 SIGMOD record  
In this setting, the relations in a database violate the key constraints and we are interested in maximal subsets of the database that satisfy the constraints, which we call repairs.  ...  It has been conjectured that there exists a dichotomy on the complexity of CERTAINTY(Q) for conjunctive queries: it is either in PTIME or coNP-complete.  ...  Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ... 
doi:10.1145/2949741.2949746 fatcat:saw55soha5dobds4lgol7lnfe4

Reasoning About XML Constraints Based on XML-to-Relational Mappings

Matthias Niewerth, Thomas Schwentick
2018 Theory of Computing Systems  
simple framework for the specification of constraints for XML documents in which constraints are specified by (1) a mapping that extracts a relation from every XML document and (2) a relational constraint on  ...  Published in Proc. 17th International Conference on Database Theory (ICDT), March 24-28, 2014, Athens, Greece: ISBN 978-3-89318066-1, on OpenProceedings.org.  ...  (c) 2014 , 2014 Copyright is with the authors.  ... 
doi:10.1007/s00224-018-9846-5 fatcat:gwtqaaahz5e3he3sbyosfnukui

Belief Change and Argumentation in Multi-Agent Scenarios (Dagstuhl Seminar 13231) Virtual Realities (Dagstuhl Seminar 13241)

Jürgen Dix, Sven Hansson, Gabriele Kern-Isberner, Guillermo Simari, Sebastian Maneth, Gonzalo Navarro, Guido Brunnett, Sabine Coquillart, Robert Van Liere, Gregory, Andreas Harth, Craig Knoblock (+2 others)
2013 unpublished
The author firmly believes in the applicability of the current web architecture in the extended industrial enterprise, and is looking forward to discuss and exchange views on the current trends, challenges  ...  , Athens, Greece, A.D.  ...  Noeth, "XML compression via DAGs," in Proc. of the 16th Int'l Conf. on Database Theory (ICDT'13), pp. 69-80, ACM, 2013.  ... 
fatcat:25ea45pfqjfgxarobtzhs6llnu

Dagstuhl Reports, Volume 8, Issue 9, September 2018, Complete Issue [article]

2019
Aidan Hogan is funded by the Millennium Institute for Foundational Research on Data (IMFD) and Fondecyt Grant No. 1181896.  ...  Aidan Hogan is funded by the Millennium Institute for Foundational Research on Data (IMFD) and Fondecyt Grant No. 1181896.  ...  In Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015., 2015. URL: http://ceur-ws.org/Vol-1350/ paper-44.pdf. 7 Piero A. Bonatti and Luigi Sauro.  ... 
doi:10.4230/dagrep.8.9 fatcat:5qvmtdru7banpoucejfabfjqdu

Dagstuhl Reports, Volume 9, Issue 5, May 2019, Complete Issue [article]

2019
This talk will describe how discrete Morse theory and persistent homology provide the foundations for simplified skeletonisation and partitioning of grayscale images.  ...  . of the 21st International Conference on Database Theory, ICDT 2018, March 26-29, 2018, Vienna, Austria, LIPIcs, Vol. 98, pp. 19:1-19:21, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2018.  ...  . of the Graph Drawing and Network Visualization -24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science, Vol. 9801, pp  ... 
doi:10.4230/dagrep.9.5 fatcat:b3zb7ot6zvcgfaa3awtv4zr3oa