16,287 Hits in 4.1 sec

The complexity of reverse engineering problems for conjunctive queries [article]

Pablo Barcelo, Miguel Romero
2016 arXiv   pre-print
Reverse engineering problems for conjunctive queries (CQs), such as query by example (QBE) or definability, take a set of user examples and convert them into an explanatory CQ.  ...  We also study the complexity of these problems for conjunctive regular path queries over graph databases, showing them to be no more difficult than for CQs.  ...  Acknowledgements: We are grateful to Leonid Libkin for their helpful comments in earlier versions of the paper and to Timos Antonopoulos for enlightening discussions about the notion of definability.  ... 
arXiv:1606.01206v2 fatcat:bkejptrinzdrza2nvlb4sjopmi

The Complexity of Reverse Engineering Problems for Conjunctive Queries

Pablo Barceló, Miguel Romero
2017 17 Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum für Informatik   unpublished
We also study the complexity of these problems for conjunctive regular path queries over graph databases, showing them to be no more difficult than for CQs. 1 Introduction Reverse engineering is the general  ...  Reverse engineering problems for conjunctive queries (CQs), such as query by example (QBE) or definability, take a set of user examples and convert them into an explanatory CQ.  ...  We are grateful to Leonid Libkin for their helpful comments in earlier versions of the paper and to Timos Antonopoulos for enlightening discussions about the notion of definability.  ... 

A Theoretical View on Reverse Engineering Problems for Database Query Languages

Pablo Barceló
2019 International Workshop on Description Logics  
In this talk I will present a family of tests that solve the reverse engineering problem described above for several query languages of interest, e.g., FO, CQ, UCQs, RPQs, CRPQs, etc.  ...  Applications of reverse engineering problems include database explanations, data exploration, data security, relational classifier engineering, and the study of the expressiveness of query languages.  ...  The study of theoretical issues related to reverse engineering problems has received quite some attention in different contexts; e.g., for first-order logic and the class of conjunctive queries over relational  ... 
dblp:conf/dlog/Barcelo19 fatcat:njioppv77fedfiwcff6krs7zy4

Reverse Engineering SPARQL Queries

Marcelo Arenas, Gonzalo I. Diaz, Egor V. Kostylev
2016 Proceedings of the 25th International Conference on World Wide Web - WWW '16  
We first provide a theoretical study, formalising variants of the reverse engineering problem and giving tight bounds on its complexity.  ...  We next explain an implementation of a reverse engineering tool for positive examples.  ...  Matching lower bounds on reverse engineering problems In this section we provide complexity lower bounds for the reverse engineering decision problems, thus closing the exact complexities for these problems  ... 
doi:10.1145/2872427.2882989 dblp:conf/www/ArenasDK16 fatcat:5j6ahwgthzhcfi7xm575lo5wdi

Children's interface design for hierarchical search and browse

Hilary Browne Hutchinson
2003 ACM SIGCAPH Computers and the Physically Handicapped  
I will instead use graphic representations of hierarchical categories and animated query creation in an accessible, web-based environment to support conjunctive queries.  ...  Previous tools for handling hierarchical data rely on text -based visualizations, lose or distort global context, and/or rely on complex abstractions, excluding children from using them.  ...  Our team's user studies [6] indicate that children are able to create conjunctive queries in the WebStart version, but still have three problems with the interface.  ... 
doi:10.1145/976261.976265 fatcat:h3auwsyinfgj7feuuytwdjbunq

Consistency Checking of Re-engineered UML Class Diagrams via Datalog+/- [chapter]

Georg Gottlob, Giorgio Orsi, Andreas Pieris
2015 Lecture Notes in Computer Science  
The upper bound is obtained by exploiting algorithmic techniques developed for conjunctive query answering under guarded Datalog+/-, that is, a key member of the Datalog+/-family of KR languages, while  ...  This process is known as reverse engineering. A fundamental property of reverse engineered (or simply re-engineered) UCDs is consistency, showing that the system is realizable in practice.  ...  This research has received funding from the EPSRC Programme Grant EP/M025268/ "VADA".  ... 
doi:10.1007/978-3-319-21542-6_3 fatcat:b6npoxysxjaxjfpxvczaw3kdsu

Smallest Set for Reverse Selection Queries to Satisfy All

Muhammed Miah
2017 International Journal of Science and Engineering Applications  
This paper considers the Smallest Set Reverse Selection Queries Problem also known as the Multiple Tuple Design Problem: Given a set of selection queries with conjunctive conditions, where the task is  ...  The problem is an interesting variant of the Maximal Reverse Selection Queries Problem (also referred to as the Tuple Design Problem) introduced by Miah et al. (2016).  ...  CONCLUSIONS This paper investigated the problem of designing smallest set of tuples for maximal reverse selection queries -given a set of selection queries with conjunctive conditions (where a query can  ... 
doi:10.7753/ijsea0603.1006 fatcat:xcntif4dk5aqfhg2iifxpfuexa

A Practical Approach for Scalable Conjunctive Query Answering on Acyclic $\mathcal{EL}^+$ Knowledge Base [chapter]

Jing Mei, Shengping Liu, Guotong Xie, Aditya Kalyanpur, Achille Fokoue, Yuan Ni, Hanyu Li, Yue Pan
2009 Lecture Notes in Computer Science  
Conjunctive query answering for EL ++ ontologies has recently drawn much attention, as the Description Logic EL ++ captures the expressivity of many large ontologies in the biomedical domain and is the  ...  In this paper, we propose a practical approach for conjunctive query answering in a fragment of EL ++ , namely acyclic EL + , that supports role inclusions.  ...  Acknowledgements The authors wish to thank Carsten Lutz for useful discussions during the writing of this paper.  ... 
doi:10.1007/978-3-642-04930-9_26 fatcat:i6u7te54bzeyzfnrmbbtrvq3aa

Comparing Entities in RDF Graphs

Alina Petrova
2017 Very Large Data Bases Conference  
We model explanations as conjunctive queries, we discuss how multiple explanations for an entity pair can be ranked and we provide a polynomial-time algorithm for generating most specific similarity explanations  ...  Knowledge bases enable new types of information search, going beyond classical query answering and into the realm of exploratory search, and providing answers to new types of user questions.  ...  We model formal explanations as conjunctive queries and we consider the problem of finding such explanations as an instance of the query reverse engineering problem.  ... 
dblp:conf/vldb/Petrova17 fatcat:glrxn5b565dqnj4s76a4uysawe

A Predicate Connection Graph Based Logic with Flexible Control

Richard Whitney, Darrel J. Van Buer, Donald P. McKay, Dan Kogan, Lynette Hirschman, Rebecca Davis
1985 International Joint Conference on Artificial Intelligence  
The FDE has been designed to support multiple search strategies for logic programs.  ...  Long-term research will focus on exploration of search strategies, especially for parallel logic machines.  ...  One case concerns the problem of determining a value for, e.g., the number of bachelors in our database.  ... 
dblp:conf/ijcai/WhitneyBMKHD85 fatcat:bd34rxbabba3zbde7uyep5a6nq


Wei Chit Tan, Meihui Zhang, Hazem Elmeleegy, Divesh Srivastava
2018 Proceedings of the VLDB Endowment  
The goal of query reverse engineering is to re-generate the SQL query that produced a given result from some known database.  ...  Prior work has addressed the reverse engineering of constrained types of SQL queries and sometimes on constrained schemas, such as single-table schemas.  ...  We reverse engineer SPJA queries by combining the functionality of reverse engineering SPJ queries and the REGAL algorithm.  ... 
doi:10.14778/3229863.3236240 fatcat:65xl6gudrjgpxcrrykcnhbpwfe

A Study on Database Fuzzy Query Method in SQL

2011 Procedia Engineering  
The previous work analyzes its simplicity, inquires the multi-relational query, inquires composite inquires, sub-query etc, so as to solve the problem of the influence of fuzzy to some extent.  ...  This kind of fuzzy inquires the solved here through the fuzzy theory and the function of the SQL combination, which will improve the fuzzy inquiry system, so that the query will be more effective.  ...  Fuzzy query with weights based on fuzzy logic conjunctions ZHANG Peng/ Procedia Engineering 00 (2011) 000-000 ) A A Fuzzy linguistic quantifies are introduced here as logic conjunctions instead of AND  ... 
doi:10.1016/j.proeng.2011.11.2653 fatcat:2stutqapfjeqfje5aqr3ilyn6a

semQA: SPARQL with Idempotent Disjunction

E.P. Shironoshita, Y.R. Jean-Mary, R.M. Bradley, M.R. Kabuka
2009 IEEE Transactions on Knowledge and Data Engineering  
We also analyze the combined complexity of SPARQL, proving it to be NP-complete. It is also shown that the SPARQL query language is not, in the general case, fixed-parameter tractable.  ...  In this paper, we present semQA, an algebraic extension for the SPARQL query language for RDF, which overcomes this issue by transforming graph patterns through the use of an idempotent disjunction operator  ...  Acknowledgments This research has been supported through Grant 1R43RR018667 from the National Center for Research Resources, US National Institutes of Health, and Grant 1R43CA132293 from the National Cancer  ... 
doi:10.1109/tkde.2008.91 pmid:19915690 pmcid:PMC2776754 fatcat:cc3ojsobvfbj3iolpubrlwt2gu

Query-by-Example for Expressive Horn Description Logics

Víctor Gutiérrez-Basulto, Jean Christoph Jung, Leif Sabellek
2018 International Workshop on Description Logics  
Query-by-example is a reverse engineering problem that asks for the existence of a query complying with a set of specified examples.  ...  In such systems, users access the knowledge base through queries usually formulated in powerful query languages such as (unions of) conjunctive queries (U)CQs.  ... 
dblp:conf/dlog/Gutierrez-Basulto18 fatcat:dx2ns6zmv5cszcy62rxucyepli

Adversarial learning

Daniel Lowd, Christopher Meek
2005 Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining - KDD '05  
In this paper, we introduce the adversarial classifier reverse engineering (ACRE) learning problem, the task of learning sufficient information about a classifier to construct adversarial attacks.  ...  We present efficient algorithms for reverse engineering linear classifiers with either continuous or Boolean features and demonstrate their effectiveness using real data from the domain of spam filtering  ...  ACKNOWLEDGEMENTS We thank Mausam for helpful comments on a draft of this paper.  ... 
doi:10.1145/1081870.1081950 dblp:conf/kdd/LowdM05 fatcat:52hji4gcvjhkvfvwqy4wolywee
« Previous Showing results 1 — 15 out of 16,287 results