[JBurke]

Hi,
I'm not a programmer, but I'm in the process of developing a concept for a website that I hope will eventually be programmed. The website will be for musician's that wish to search for chords and scales. The user inputs a series of notes, and matching chords and/or scales are found.
My problem is this: I will need a search engine that will search through a database and match things that are out of order.
The user can search for any of the 12 notes of music, in any order, no duplicates, maximum string of 7 notes per search.
The notes of music: A, A#, B, C, C#, D, D#, E, F, F#, G, G# .

Example:
say the user inputs A, B, C, D, E, F#, G into the search box.
I want the program to find (in the database) the "C Major-Mode 4 Scale" which contains these notes in the following order:
C, D, E, F#, G, A, B. (the same notes, just in a diferent order).

Is this possible without creating a database of every possible combination? I figure I would have to create millions of inversions, otherwise. If I were to have to create all these inversions to put into the database, how would I go about doing that?

Any info and/or advice would be greatly appreciated. Thanks in advance.

Jim