Talk:Scenario: Discovery II and Simple Composition

This is a Draft page

Functional Challenge Matrix

Functional Challenge Matrix for the Discovery II and Simple Composition Scenario

Functional Challenge	Related goals
	A1	A2	B1	B2	C1	C2	C3	C4
Basic discrete matchmaking
Discrete conditions (e.g., color white, specific processor type)	√	√	√	√	√	√	√	√
Matching with numbers
Numeric comparisons (e.g., conditions on RAM and HDD size or price)	√	√	√	√	√	√	√	√
Arithmetic computations (e.g., price difference, total price)				√		√	√	√
Preferences, Ranking, Selection
Continuous preferences (preferences that establish an ordering based on infinitely many levels like "the cheaper, the better")			√	√		√		√
Discrete preferences (expressions that result in discrete preference levels like black notebook preferred over white one)				√
Multiple prioritized ordering criteria (e.g., ordering via price and then processor power)				√				√
Relative preferences (preferences that are established in relation to other offers like "prefer black notebook except if white one is at least 100$ cheaper")				√
Composition - multiple products to be chosen and ordered via multiple invocations
Unrelated product choices (e.g., multiple products)					√
Correlated product choices (e.g., multiple compatible products, multiple products with global price constraint)						√	√	√
Mediation
Data mediation between the semantic and syntactic level, lowering/lifting to/from differing XML element names and XML structures	√	√	√	√	√	√	√	√
Advanced matchmaking aspects
performing and evaluating service calls, handling service invocation errors	√	√	√	√	√	√	√	√
Inquiring for dynamic information, leveraging of that information during the matchmaking (requesting product listings)	√	√	√	√	√	√	√	√