WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Transactions on Database Systems (TODS)
  2. ACM Transactions on Database Systems (TODS) : Volume 40
  3. Issue 4(Special Issue: Invited 2014 PODS and EDBT Revised Articles), February 2016
  4. Learning Join Queries from User Examples
Loading...

Please wait, while we are loading the content...

ACM Transactions on Database Systems (TODS) : Volume 42
ACM Transactions on Database Systems (TODS) : Volume 41
ACM Transactions on Database Systems (TODS) : Volume 40
Issue 4(Special Issue: Invited 2014 PODS and EDBT Revised Articles), February 2016
Generating Plans from Proofs
Processing Top-k Dominating Queries in Metric Spaces
Learning Join Queries from User Examples
Negative Factor: Improving Regular-Expression Matching in Strings
Faster Random Walks by Rewiring Online Social Networks On-the-Fly
Issue 3, October 2015
Issue 2, June 2015
Issue 1, March 2015
ACM Transactions on Database Systems (TODS) : Volume 39
ACM Transactions on Database Systems (TODS) : Volume 38
ACM Transactions on Database Systems (TODS) : Volume 37
ACM Transactions on Database Systems (TODS) : Volume 36
ACM Transactions on Database Systems (TODS) : Volume 35
ACM Transactions on Database Systems (TODS) : Volume 34
ACM Transactions on Database Systems (TODS) : Volume 33
ACM Transactions on Database Systems (TODS) : Volume 32
ACM Transactions on Database Systems (TODS) : Volume 31
ACM Transactions on Database Systems (TODS) : Volume 30
ACM Transactions on Database Systems (TODS) : Volume 29
ACM Transactions on Database Systems (TODS) : Volume 28
ACM Transactions on Database Systems (TODS) : Volume 27
ACM Transactions on Database Systems (TODS) : Volume 26
ACM Transactions on Database Systems (TODS) : Volume 25
ACM Transactions on Database Systems (TODS) : Volume 24
ACM Transactions on Database Systems (TODS) : Volume 23
ACM Transactions on Database Systems (TODS) : Volume 22
ACM Transactions on Database Systems (TODS) : Volume 21
ACM Transactions on Database Systems (TODS) : Volume 20
ACM Transactions on Database Systems (TODS) : Volume 19
ACM Transactions on Database Systems (TODS) : Volume 18
ACM Transactions on Database Systems (TODS) : Volume 17
ACM Transactions on Database Systems (TODS) : Volume 16
ACM Transactions on Database Systems (TODS) : Volume 15
ACM Transactions on Database Systems (TODS) : Volume 14
ACM Transactions on Database Systems (TODS) : Volume 13
ACM Transactions on Database Systems (TODS) : Volume 12
ACM Transactions on Database Systems (TODS) : Volume 11
ACM Transactions on Database Systems (TODS) : Volume 10
ACM Transactions on Database Systems (TODS) : Volume 9
ACM Transactions on Database Systems (TODS) : Volume 8
ACM Transactions on Database Systems (TODS) : Volume 7
ACM Transactions on Database Systems (TODS) : Volume 6
ACM Transactions on Database Systems (TODS) : Volume 5
ACM Transactions on Database Systems (TODS) : Volume 4
ACM Transactions on Database Systems (TODS) : Volume 3
ACM Transactions on Database Systems (TODS) : Volume 2
ACM Transactions on Database Systems (TODS) : Volume 1

Similar Documents

...
Reverse engineering complex join queries

Article

...
Formal semantics of SQL queries

Article

...
Observing SQL queries in their natural habitat

Article

...
SQL query optimization:reordering for a general class of queries

Article

...
Reverse Engineering SPJ-Queries from Examples

Article

...
SQL/SE:a query language extension for databases supporting schema evolution

Article

...
On optimizing an SQL-like nested query

Article

...
SQL query optimization through nested relational algebra

Article

...
A Paradigm for Learning Queries on Big Data

Article

Learning Join Queries from User Examples

Content Provider ACM Digital Library
Author Ciucanu, Radu Staworko, Sławek Bonifati, Angela
Copyright Year 2016
Abstract We investigate the problem of learning join queries from user examples. The user is presented with a set of candidate tuples and is asked to label them as $\textit{positive}$ or $\textit{negative}$ examples, depending on whether or not she would like the tuples as part of the join result. The goal is to quickly infer an arbitrary $\textit{n}-ary$ join predicate across an arbitrary number $\textit{m}$ of relations while keeping the number of user interactions as minimal as possible. We assume no prior knowledge of the integrity constraints across the involved relations. Inferring the join predicate across multiple relations when the referential constraints are unknown may occur in several applications, such as data integration, reverse engineering of database queries, and schema inference. In such scenarios, the number of tuples involved in the join is typically large. We introduce a set of strategies that let us inspect the search space and aggressively prune what we call $\textit{uninformative}$ tuples, and we directly present to the user the $\textit{informative}$ ones—that is, those that allow the user to quickly find the goal query she has in mind. In this article, we focus on the inference of joins with equality predicates and also allow disjunctive join predicates and projection in the queries. We precisely characterize the frontier between tractability and intractability for the following problems of interest in these settings: consistency checking, learnability, and deciding the informativeness of a tuple. Next, we propose several strategies for presenting tuples to the user in a given order that allows minimization of the number of interactions. We show the efficiency of our approach through an experimental study on both benchmark and synthetic datasets.
Starting Page 1
Ending Page 38
Page Count 38
File Format PDF
ISSN 03625915
e-ISSN 15574644
DOI 10.1145/2818637
Volume Number 40
Issue Number 4
Journal ACM Transactions on Database Systems (TODS)
Language English
Publisher Association for Computing Machinery (ACM)
Publisher Date 2016-01-04
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword SQL query discovery Incomplete schema Reverse engineering
Content Type Text
Resource Type Article
Subject Information Systems
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...