Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. Design and Architecture
  4. Matching between product and customer personal information

Matching between product and customer personal information

Scheduled Pinned Locked Moved Design and Architecture
databasealgorithmssalesquestion
2 Posts 2 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • L Offline
    L Offline
    Lost User
    wrote on last edited by
    #1

    I writing some application that find ( according to some question ) information about some person ( lets say that the information are weight, hight and age of the person ). In the other hand i have product list ( can be very big one ) and according to the product information i need to find the best matching between the person information and the product ( the product information that i have are water part, nitrogen part and ext. ) I can't use flow chart algorithm or Breadth-first search because the number of the product is dynamically ( read the product list from DB ... )

    D 1 Reply Last reply
    0
    • L Lost User

      I writing some application that find ( according to some question ) information about some person ( lets say that the information are weight, hight and age of the person ). In the other hand i have product list ( can be very big one ) and according to the product information i need to find the best matching between the person information and the product ( the product information that i have are water part, nitrogen part and ext. ) I can't use flow chart algorithm or Breadth-first search because the number of the product is dynamically ( read the product list from DB ... )

      D Offline
      D Offline
      dasblinkenlight
      wrote on last edited by
      #2

      Since much detail has been left out (which is expected, given that it's an architecture forum) I'd make an assumption that finding the "best matching" can be expressed mathematically as finding an extremum of a function of some sort, and that the product list is stored in a SQL database. Suppose that the quality of the match can be evaluated as a function MatchQuality. When you get parameters of a person for whom you're finding a matching product, you can build a SQL query that corresponds to your MatchQuality function and the parameters of the given person. Consider this silly example: suppose your MatchQuality(age, weight, water, nitro) = age^2/nitro + water/weight, and the match is best when MatchQuality is highest. A query for the best product comes in: weight=170lb, age=65yr. The query below returns the best match:

      select top 1
      from Products
      order by (65*65)/nitro + water/170 desc

      1 Reply Last reply
      0
      Reply
      • Reply as topic
      Log in to reply
      • Oldest to Newest
      • Newest to Oldest
      • Most Votes


      • Login

      • Don't have an account? Register

      • Login or register to search.
      • First post
        Last post
      0
      • Categories
      • Recent
      • Tags
      • Popular
      • World
      • Users
      • Groups