Interactive Join Query Inference with JIM

Angela Bonifati (1, 2) , Radu Ciucanu (1, 2) , Slawomir Staworko (1, 2)

1 LINKS - Linking Dynamic Data
2 LIFL - Laboratoire d'Informatique Fondamentale de Lille

Specifying join predicates may become a cumbersome task in many situations e.g., when the relations to be joined come from disparate data sources, when the values of the attributes carry little or no knowledge of metadata, or simply when the user is unfamiliar with querying formalisms. Such task is recurrent in many traditional data management applications, such as data integration, constraint inference, and database denormalization, but it is also becoming pivotal in novel crowdsourcing applications. We present Jim (Join Inference Machine), a system for interactive join specification tasks, where the user infers an n-ary join predicate by selecting tuples that are part of the join result via Boolean membership queries. The user can label tuples as positive or negative, while the system allows to identify and gray out the uninformative tuples i.e., those that do not add any information to the final learning goal. The tool also guides the user to reach her join inference goal with a minimal number of interactions.

Domaines: Base de données [cs.DB]

Angela Bonifati, Radu Ciucanu, Slawomir Staworko. Interactive Join Query Inference with JIM. Gestion de Données - Principes, Technologies et Applications (BDA), Oct 2014, Grenoble-Autrans, France. ⟨hal-01052789⟩