International Business Machines Corporation

Phokion Kolaitis

Lucian Popa

Ronald Fagin

Wang-Chiew Tan

Andrew Stephen Tomkins

Shanmugasundaram Ravikumar

Ramanathan V Guha

Dandapani Sivakumar

Jasmine Novak

Cong Yu

Laura Chiticarlu

Methods, systems and computer program products for interactive generation of integrated schemas. Exemplary embodiments include a method for schema integration, the method including recasting a first source schema into a first graph of concepts with HasA relationships, recasting a second source schema into a second graph of concepts with HasA relationships, identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts of the first and second graphs, producing an integrated schema, based on a fixed specification of matching concepts to merge, and generating a mapping from the first source schema to the integrated schema and from the second source schema to the integrated schema.

Interactive generation of integrated schemas

A method and system for processing a schema mapping M from a source schema S to a target schema T by executing program code on a processor of a computer system. A schema mapping M' from T to S is determined via processing the schema mapping M. The schema mapping M includes at least one constraint &#x3c3;. Each constraint &#x3c3; consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M&#x2032; includes at least one constraint &#x3c3;&#x2032;. Each constraint &#x3c3;&#x2032; consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M&#x2032; is stored in at least one computer usable storage device of the computer system and/or is outputted in at least one output device of the computer system.

Quasi-inverses of schema mappings

A method for generating a schema mapping. A provided mapping Mrelates schema Sto schema S. A provided mapping Mrelates schema Sto schema S. A mapping Mis generated from schema Sto schema Sas a composition of mappings Mand M. Mappings M, M, and Mare each expressed in terms of at least one second-order nested tuple-generating dependency (SO nested tgd). Mapping Mdoes not expressly recite any element of schema S. At least one schema of the schemas Sand Smay comprise at least one complex type expression nested inside another complex type expression. Mapping Mmay define the composition of the mappings Mand Mwith respect to a relationship semantics or a transformation semantics.

Sequential composition of schema mappings

A multi-structural query system performs a high-level multi-dimensional query on a multi-structural database. The query system enables a user to navigate a search by adding restrictions incrementally. The query system uses a schema to discover structure in a multi-structural database. The query system leaves a choice of nodes to return in response to a query as a constrained set of choices available to the algorithm. The query system further casts the selection of a set of nodes as an optimization. The query system uses pairwise-disjoint collections to capture a concise set of highlights of a data set within the allowed schema. The query system further comprises efficient algorithms that yield approximately optimal solutions for several classes of objective functions.

System and method for performing a high-level multi-dimensional query on a multi-structural database

Growing community of inventors

Los Altos, CA, United States of America

Phokion Kolaitis