|
Retrieve highly relevant results that others miss:
Parametric search also known as constraint based or SQL-type searches, can be represented in an n dimensional space, where n is the number of attributes, by a box based on the search constraints (query conditions). The search retrieves the data that meet the query constraints in other words the elements that are in the box.

For example, the selection of a car that has a performance that exceeds 200 horsepower and priced under $25,000 would eliminate a vehicle with 250 Horsepower that costs $25,500. It only returns the cars within the constraints or "inside the box".
Optimization theory, teaches that ideal results are usually found close to the pareto optimal boundaries. These boundaries are typically the intersections of curves, planes and graphs representing constraints, utility functions, etc...

In the case of a parametric search, this intersection corresponds to the corner of the box. With SQL-type searches, data that falls outside the box is eliminated and does not show up in the result set. This is why parametric search often requires several trial and error attempts to locate the required data.
This means that a parametric or SQL-type search will miss highly relevant results that happen to "land just outside the box".

In comparison, Auguri’s search works by identifying an ideal result (often hypothetical) and measuring the distance of each element to the ideal in an n dimensional vector space. Auguri will retrieve ALL the elements that are close to the ideal result. As a result every relevant data will be retrieved.
|