Abstract: 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.

Abstract: 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.

Abstract: 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 ?. Each constraint ? consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M? includes at least one constraint ??. Each constraint ?? consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M? 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.

Abstract: 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 ?. Each constraint ? consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M? includes at least one constraint ??. Each constraint ?? consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M? 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.

Abstract: A method for generating a schema mapping. A provided mapping M12 relates schema S1 to schema S2. A provided mapping M23 relates schema S2 to schema S3. A mapping M13 is generated from schema S1 to schema S3 as a composition of mappings M12 and M23. Mappings M12, M23, and M13 are each expressed in terms of at least one second-order nested tuple-generating dependency (SO nested tgd). Mapping M13 does not expressly recite any element of schema S2. At least one schema of the schemas S1 and S2 may comprise at least one complex type expression nested inside another complex type expression. Mapping M13 may define the composition of the mappings M12 and M23 with respect to a relationship semantics or a transformation semantics.

Abstract: 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.

Abstract: 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 ?. Each constraint ? consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M? includes at least one constraint ??. Each constraint ?? consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M? 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.

Abstract: 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 ?. Each constraint ? consists of a source-to-target tuple-generating dependencies (s-t tgd). The schema mapping M? includes at least one constraint ??. Each constraint ?? consists of a disjunctive tgd with constants and inequalities among the constants. The schema mapping M? 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A method for generating a schema mapping. A provided mapping M12 relates schema S1 to schema S2. A provided mapping M23 relates schema S2 to schema S3. A mapping M13 is generated from schema S1 to schema S3 as a composition of mappings M12 and M23. Mappings M12, M23, and M13 are each expressed in terms of at least one second-order nested tuple-generating dependency (SO nested tgd). Mapping M13 does not expressly recite any element of schema S2. At least one schema of the schemas S1 and S2 may comprise at least one complex type expression nested inside another complex type expression. Mapping M13 may define the composition of the mappings M12 and M23 with respect to a relationship semantics or a transformation semantics.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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?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.

Abstract: A system, method, and computer program product for automatically performing similarity search, classification, and other nearest-neighbor search-based applications using rank aggregation. The invention reduces the &egr;-approximate Euclidean nearest neighbor problem to the problem of finding the candidate with the best median rank in an election with n candidates and O(&egr;−2logn) voters.

Abstract: The present system imports data from a source schema into a target schema while keeping the semantics, structure, and constraints of the data intact. The system is driven by user inputs that define a set of correspondences between the source schema and the target schema. The system meets the requirement that data produced at the target not violate the schema of the target; rather, the data must conform to the target schema. The system can be applied in both target materialization and query unfolding, producing all the meaningful queries required in data translation by finding all the associations that exist in the schemas. Each query maps from a source association to a target association. The user selects a subset of those queries that match the desired data translation. Target constraints are taken into account by the present system to infer the user intention and to guarantee that the generated data satisfies the structure and constraints of the target schema.

Abstract: An apparatus is provided for performing a method (FIG. 2) for pruning an index of a corpus of text documents, wherein the method includes steps for ranking (50) the postings in the index and pruning (48) from the index the postings below a given level in the ranking. The pruning methods of the invention are lossy, since some document postings are removed from the full index; however, the user cannot differentiate the lossy index from the full index.