International Business Machines Corporation

Ronald Fagin

Lucian Popa

Phokion Kolaitis

Wang-Chiew Tan

Nimrod Megiddo

Dandapani Sivakumar

Jasmine Novak

Andrew Stephen Tomkins

Jeffrey Bruce Lotspiech

Shanmugasundaram Ravikumar

Daniel Gruhl

Eitan D Farchi

Thomas Guthrie Zimmerman

Hal Jervis Rosen

Ramanathan V Guha

David Carmel

Yoelle Smadja Maarek

Alfredo Alba

Sridhar Rajagopalan

Clemens Drews

Cartic Ramakrishnan

Doron Cohen

Kenneth Lee Clarkson

Meenakshi Nagarajan

Neal Ryan Lewis

Kevin Snow McCurley

Dalit Naor

John Anthony Tomlin

Michael Herscovici

Mauricio Antonio Hernandez-Sherrington

Randal Chilton Burns

Aya Soffer

Pablo N Mendes

Lingling Yan

Laura Myers Haas

Simeon Naor

Edward Leo Wimmers

Larry Joseph Stockmeyer

Miklos Ajtai

Renee J Miller

Robert John Tasman Morris

David Paul Williamson

Cong Yu

Felix Gerhard Naumann

Shanmugasundram Ravikumar

One embodiment provides generating a similarity matrix corresponding to an input collection including initializing, by a processor, a working set as a collection of a multiple items. Until the similarity matrix converges: receiving a seed for similarity for at least one pair of items of the multiple items, and obtaining a similarity value for all other item pairs using a Naive Triangle Inequality process. The similarity is generated with obtained similarity values.

Efficient semi-supervised concept organization accelerated via an inequality process

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

Given a target schema in which instances have been mapped from a source schema, an inverse schema mapping system generates an instance of a target relation for each of a plurality of target relations in the target schema, chases the target relation using a schema mapping to generate a plurality of target relations for the source schema, and then generates an inverse schema mapping, if one exists, that maps the instances of the target schema to the instances of the source schema.

System and method of performing an inverse schema mapping

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

An apparatus and method is provided for pruning an index of a corpus of text documents by creating an inverted index of terms appearing in the documents, wherein the index includes postings of the terms in the documents, ranking the postings in the index, and pruning from the index the postings below a given level in the ranking.

Lossy index compression

A modular scoring system using rank aggregation merges search results into an ordered list of results using many different features of documents. The ranking functions of the present system can easily be customized to the needs of a particular corpus or collection of users such as an intranet. Rank aggregation is independent of the underlying score distributions between the different factors, and can be applied to merge any set of ranking functions. Rank aggregation holds the advantage of combining the influence of many different heuristic factors in a robust way to produce high-quality results for queries. The modular scoring system combines factors such as indegree, page ranking, URL length, proximity to the root server of an intranet, etc, to form a single ordering on web pages that closely obeys the individual orderings, but also mediates between the collective wisdom of individual heuristics.

System, method and service for ranking search results using a modular scoring system

A computer program product is provided that uses data examples as a basis for understanding and refining declarative schema mappings. The system of the present invention identifies a set of intuitive operators for manipulating examples including establishing value correspondences, data linking, data trimming, data walking, and data chasing. These operators allow a user to follow and refine an example by walking through a data source. In addition, these operators can identify a large class of schema mappings and distinguish effectively between alternative schema mappings. With these operators, a user is able to quickly and intuitively build and refine complex data transformation queries that map one data source into another while continuously verifying that the mapping is accurate and appropriate.

Method for schema mapping and data transformation

An encryption key matrix has rows grouped into segments, with a set of one segment per column establishing a slot. Slots are assigned to device manufacturers, with the keys of the slots then being assigned to decryption devices made by the respective manufacturer. In generating the slots, the number 'q' of segments in a column is first defined such that a predetermined maximum number of devices can be revoked devices (in that all the keys held by the device are revoked) while ensuring that a good device remains a functional device with a probability of at least (1&#x2212;Q), wherein Q is a predefined device confidence. Once the number 'q' of segments has been defined, the slots themselves are defined in a provably non-discriminatory fashion using an error-correcting code such as a Reed-Solomon code. With this invention, overlap between slots can be minimized to minimize the possibility that the key set of an innocent device might be inadvertently revoked when the keys in the slots of a &#x201c;bad&#x201d; manufacturer are revoked.

Method for assigning encryption keys

A digital pen that has an ink writing tip includes a laser on a pen body that directs light toward paper across which the writing tip is stroked. A CMOS camera or CCD is also mounted on the pen body for detecting reflections of the laser light, referred to as &ldquo;speckles&rdquo;. A processor in the pen body determines relative pen motion based on the speckles. A contact sensor such as an FSR on the pen body senses when the tip is pressed against the paper, with positions being recorded on a flash memory in the pen body when the contact sensor indicates that the pen is against the paper. The memory can be later engaged with a handwriting recognition device to correlate the positions to alpha-numeric characters. Ordinary paper can be used, but, if desired, special bar-coded paper can also be used, so that the recorded positions can be tagged with a page number, form field, and absolute position on the page.

Digital pen using speckle tracking

A method and a system are presented for generating differentially compressed output from binary sources. Given two versions of the same file as input streams, a compact encoding of one of the input streams is generated, by representing it as a set of changes with respect to the other input stream. Algorithms for differencing files requiring time linear in the size of the input and a constant amount of space for execution are presented. In addition, advanced techniques for improving existing differencing algorithms are developed and applied to previous methods. These techniques allow algorithms to increase their efficiency without a loss of compression and to accept arbitrarily large inputs without sacrificing correctness or degrading the compression data rate. The differential compression methods provide a computationally efficient compression technique for applications that generate versioned data.

System and method for differential compression of data from a plurality of binary sources

A data processing system provides the correct weighted combinational function for any unweighted combinational rules applied to a database. The system receives weights to be applied to data attributes, checks for ordering conditions and if necessary re-orders the weights, and produces the correct, unique combinational function that incorporates the user weights into the base combinational rules that otherwise would be applied to retrieve desired data from the database. Thus, the invention provides unprecedented flexibility in determining the proper computation of combined scoring functions.

Method and apparatus for incorporating weights into data combinational

Growing community of inventors

Los Gatos, CA, United States of America

Ronald Fagin