摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.