Filters








7,761 Hits in 3.9 sec

Database queries and constraints via lifting problems

DAVID I. SPIVAK
2013 Mathematical Structures in Computer Science  
In the present paper we build on that model, showing that certain queries and constraints correspond to lifting problems, as found in modern approaches to algebraic topology.  ...  We interpret constraints within the same formalism and then investigate some basic properties of queries and constraints.  ...  Constraints via lifting conditions In this section we introduce the lifting problem approach to database constraints.  ... 
doi:10.1017/s0960129513000479 fatcat:enmiwnrjofer7ou7v342xhdnsi

Database Aggregation [article]

Francesco Belardinelli, Umberto Grandi
2018 arXiv   pre-print
We also characterise languages for first-order queries on which the answer to queries on the aggregated database coincides with the aggregation of the answers to the query obtained on each individual database  ...  In the presence of an integrity constraint, we identify classes of aggregators that respect it in the aggregated database, provided all individual databases satisfy it.  ...  We first analyse the problem of lifting first-order formulas in database aggregation theoretically, comparing the results obtained with the literature on lifting propositional constraints in binary aggregation  ... 
arXiv:1802.08586v1 fatcat:k5fp4hgtsvccphueekkbib7kty

Spatiotemporal pattern queries

Mahmoud Attia Sakr, Ralf Hartmut Güting
2010 Geoinformatica  
Our design covers the language integration in SQL, the evaluation of the queries, and the integration with the query optimizer. We also propose a simple language for defining temporal constraints.  ...  We propose a complete design for spatiotemporal pattern queries in the context of spatiotemporal DBMSs. The design builds on the well established concept of lifted predicates.  ...  Conclusions We propose a novel approach for spatiotemporal pattern queries. It combines efficiency, expressiveness and a clean concept. It builds on other moving objects database concepts.  ... 
doi:10.1007/s10707-010-0114-3 fatcat:omhflxygzfeepnpdbiopuhw3vu

Social Choice Methods for Database Aggregation

Francesco Belardinelli, Umberto Grandi
2019 Electronic Proceedings in Theoretical Computer Science  
We also characterise languages for first-order queries on which the answer to a query on the aggregated database coincides with the aggregation of the answers to the query obtained on each individual database  ...  In the presence of integrity constraints, we identify classes of aggregators that respect them in the aggregated database, provided these are satisfied in all individual databases.  ...  query answering problem [10] .  ... 
doi:10.4204/eptcs.297.4 fatcat:smgxp46wjrezfisz2fb4uaywyy

10 Years of Probabilistic Querying – What Next? [chapter]

Martin Theobald, Luc De Raedt, Maximilian Dylla, Angelika Kimmig, Iris Miliaraki
2013 Lecture Notes in Computer Science  
Over the past decade, the two research areas of probabilistic databases and probabilistic programming have intensively studied the problem of making structured probabilistic inference scalable, but-so  ...  techniques based on knowledge compilation and lifted (first-order) inference.  ...  the intensional query predicate KnownFor via the views and the extensional relations.  ... 
doi:10.1007/978-3-642-40683-6_1 fatcat:lofuquzqgbb4hcjtjeqydyakbe

Using Expert Knowledge in Database-Oriented Problem Solving

Jiawei Han, Larry Travis
1985 International Conference on Information Systems  
merged into relational database systems and the compilation to answer queries and solve problems.  ...  Database-ori ented problem solving often involves the processing of deduction rules which may be recursive in relational database systems.  ...  Two recent research papers query provided by database user and the information &Hens 846 and &Ullm 856 deal with this problem from stored in the database. two differeni angles.  ... 
dblp:conf/icis/HanT85 fatcat:ossmsnv2qzgqdddtj4fq4ccruq

Descriptive Complexity Theory for Constraint Databases [chapter]

Erich Grädel, Stephan Kreutzer
1999 Lecture Notes in Computer Science  
Considering linear constraints, we show that there is a signi cant gap between the data complexity of rst-order queries on linear constraint databases over the real and the natural numbers.  ...  We consider the data complexity of various logics on two important classes of constraint databases: dense order and linear constraint databases.  ...  via the map^ .  ... 
doi:10.1007/3-540-48168-0_6 fatcat:3nqmsok4erc5zicshsruw27lqe

Exploiting Determinism to Scale Relational Inference

Mohamed Ibrahim, Christopher Pal, Gilles Pesant
2015 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
To avoid this, PR starts by relaxing preferences and performing inference with hard constraints only.  ...  Unfortunately, most real-world problems in SRL have expressive models that translate into large grounded networks, representing a bottleneck for any inference method and weakening its scalability.  ...  This work was funded by Natural Science and Engineering Research Council (NSERC) Discovery Grants Program and the Egyptian Cultural Affairs and Mission Sector. We sincerely thank these sponsors.  ... 
doi:10.1609/aaai.v29i1.9478 fatcat:t2vu67rk4ze25cfl5dmu6mmzbi

Scaling Lifted Probabilistic Inference and Learning Via Graph Databases

Mayukh Das, Yuqing Wu, Tushar Khot, Kristian Kersting, Sriraam Natarajan
2016 Proceedings of the 2016 SIAM International Conference on Data Mining  
This paper investigates whether 'Compilation to Graph Databases' could be a practical technique for scaling lifted probabilistic inference and learning methods.  ...  Over the past decade, exploiting relations and symmetries within probabilistic models has been proven to be surprisingly effective at solving large scale data mining problems.  ...  (computed by C-Fove) and the ones via approximation, for a given set of 10 query predicates.  ... 
doi:10.1137/1.9781611974348.83 dblp:conf/sdm/DasWKKN16 fatcat:6ng7pbllvva2vh3b2fcuqfeaaa

RockIt: Exploiting Parallelism and Symmetry for MAP Inference in Statistical Relational Models

Jan Noessner, Mathias Niepert, Heiner Stuckenschmidt
2013 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
MAP inference in graphical models is an optimization problem which can be compiled to integer linear programs (ILPs).We describe several advances in translating MAP queries to ILP instances and present  ...  CPA exploits local context-specific symmetries and bundles up sets of linear constraints.  ...  Cutting Plane Aggregation Each MAP query corresponds to an optimization problem with linear constraints and a linear objective function and, hence, we can formulate the problem as an instance of integer  ... 
doi:10.1609/aaai.v27i1.8579 fatcat:avdqtkgoe5e45blamtdnodfwvi

Personalization of XML Text Search via Search Histories

George A. Chernishev
2008 Spring Young Researchers Colloquium on Databases and Information Systems  
Full-Text XML search is a difficult problem due to its structural and textual constrains. The latter being individually well explored topics, lack mechanisms of integration with each other.  ...  Different approaches were proposed to cope with this problem. A technique of personalization usage to enhance one of these methods is given.  ...  These are concentrating on different aspects of the problem. One of these methods refines the quality of results via methods of per-user personalization [5] .  ... 
dblp:conf/syrcodis/George08 fatcat:zzx4223ro5fi3lh5auyyvxs5ja

Recognizing Determinism in Prioritized Repairing of Inconsistent Databases

Benny Kimelfeld, Ester Livshits, Liat Peterfreund
2016 Alberto Mendelzon Workshop on Foundations of Data Management  
a priority relation between consistent databases, and repairs are restricted to ones that are optimal in the lifted sense.  ...  As there are often reasons to prefer one repair over another, researchers have introduced and investigated the framework of preferred repairs, where a priority relation between facts is lifted towards  ...  Arenas, Bertossi and Chomicki [3] introduced a principled approach to managing inconsistency, via the notions of repairs and consistent query answering.  ... 
dblp:conf/amw/KimelfeldLP16 fatcat:yfnm5izef5fadbawb3c7gkoq7y

Ontology-Mediated Queries for Probabilistic Databases

Stefan Borgwardt, Ismail Ceylan, Thomas Lukasiewicz
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We show that the dichotomy between P and PP in (Open)PDBs can be lifted to the case of first-order rewritable positive programs (without negative constraints); and that the problem can become NP^PP-complete  ...  In this paper, we extend OpenPDBs by Datalog+/- ontologies, under which both upper and lower probabilities of queries become even more informative, enabling us to distinguish queries that were indistinguishable  ...  EP/J008346/1, EP/L012138/1, EP/M025268/1, and EP/N510129/1.  ... 
doi:10.1609/aaai.v31i1.10680 fatcat:o6f5sgqqvfd7tabooreh5doid4

Counting Answers to Existential Questions

Holger Dell, Marc Roth, Philip Wellnitz, Michael Wagner
2019 International Colloquium on Automata, Languages and Programming  
Conjunctive queries select and are expected to return certain tuples from a relational database. We study the potentially easier problem of counting all selected tuples, rather than enumerating them.  ...  and Marx (FOCS 2014) for the subgraph counting problem.  ...  Acknowledgements We thank Cornelius Brand, Karl Bringmann, Radu Curticapean, Reinhard Diestel, Joshua Erde, Stephan Kreutzer, Stefan Mengel, Daniel Weißauer, and an anonymous reviewer for discussions and  ... 
doi:10.4230/lipics.icalp.2019.113 dblp:conf/icalp/DellRW19 fatcat:xfnlsag2bbefvnavyok634g46e

RockIt: Exploiting Parallelism and Symmetry for MAP Inference in Statistical Relational Models [article]

Jan Noessner, Mathias Niepert, Heiner Stuckenschmidt
2013 arXiv   pre-print
CPA exploits local context-specific symmetries and bundles up sets of linear constraints.  ...  We describe several advances in translating MAP queries to ILP instances and present the novel meta-algorithm cutting plane aggregation (CPA).  ...  Cutting Plane Aggregation Each MAP query corresponds to an optimization problem with linear constraints and a linear objective function and, hence, we can formulate the problem as an instance of integer  ... 
arXiv:1304.4379v2 fatcat:iaptdtlzevc5jmw7wpiv4q47n4
« Previous Showing results 1 — 15 out of 7,761 results