Parts database
Junior Member
Posts like a Ricer Type-R
Joined: Aug 2002
Posts: 11
Likes: 13
The problem with exclusive access is big. This won't be running on our server in Florida. It would have to be somewhere else. How can we keep the membership list synced up between the servers? And passwords? Unless it asks for the username and password here, then links to the remote server?
Member
Posts like a V-Tak
Joined: Aug 2003
Posts: 65
Likes: 0
From: Upstate NY
It think it is very possible assuming that GM NEVER uses the same part number for different or modifyed parts
(ex pt#3356998 from 1994 is slightly different from pt#3356998 from 199
Parts could be arranged in a binary tree sorted by part number. A binary tree would be easy on the space usage. Number of entries equals the number of parts. Parts used more that once only need to be entered once and it would be quick. To look through 131,071 parts would require the program to only make 17 comparisions (formule is 2 raised to the number of entries -1)
Each node or part would have to store:
part number
array of years used
part name
description (1 to two sentences)
in your program you would have interfaces with searches for
number
year, name
possibly a keyword search for parts
this would require possibly an array of keywords (more space required)
and more code to search
The largest part of this unfertaking would be data entry for each part
opinions anyone?
(ex pt#3356998 from 1994 is slightly different from pt#3356998 from 199
Parts could be arranged in a binary tree sorted by part number. A binary tree would be easy on the space usage. Number of entries equals the number of parts. Parts used more that once only need to be entered once and it would be quick. To look through 131,071 parts would require the program to only make 17 comparisions (formule is 2 raised to the number of entries -1)
Each node or part would have to store:
part number
array of years used
part name
description (1 to two sentences)
in your program you would have interfaces with searches for
number
year, name
possibly a keyword search for parts
this would require possibly an array of keywords (more space required)
and more code to search
The largest part of this unfertaking would be data entry for each part
opinions anyone?
Senior Member
True Car Nut
Joined: May 2002
Posts: 2,621
Likes: 0
From: Edmonton, AB Canada
Originally Posted by Slick666
It think it is very possible assuming that GM NEVER uses the same part number for different or modifyed parts
(ex pt#3356998 from 1994 is slightly different from pt#3356998 from 199
Parts could be arranged in a binary tree sorted by part number. A binary tree would be easy on the space usage. Number of entries equals the number of parts. Parts used more that once only need to be entered once and it would be quick. To look through 131,071 parts would require the program to only make 17 comparisions (formule is 2 raised to the number of entries -1)
Each node or part would have to store:
part number
array of years used
part name
description (1 to two sentences)
in your program you would have interfaces with searches for
number
year, name
possibly a keyword search for parts
this would require possibly an array of keywords (more space required)
and more code to search
The largest part of this unfertaking would be data entry for each part
opinions anyone?
(ex pt#3356998 from 1994 is slightly different from pt#3356998 from 199
Parts could be arranged in a binary tree sorted by part number. A binary tree would be easy on the space usage. Number of entries equals the number of parts. Parts used more that once only need to be entered once and it would be quick. To look through 131,071 parts would require the program to only make 17 comparisions (formule is 2 raised to the number of entries -1)
Each node or part would have to store:
part number
array of years used
part name
description (1 to two sentences)
in your program you would have interfaces with searches for
number
year, name
possibly a keyword search for parts
this would require possibly an array of keywords (more space required)
and more code to search
The largest part of this unfertaking would be data entry for each part
opinions anyone?
Thread Starter
Senior Member
Posts like a Turbo
Joined: Oct 2003
Posts: 322
Likes: 0
From: Eugene/Springfield Oregon
Like I said I'm down for the data entry. I really want to see this happen. I may be able to use my current mac (10gig) for the server in about two to three months which may seem a long time but it may take that long to get all the data entered. All I need to know is what I can do to help make this happen.
Thread
Thread Starter
Forum
Replies
Last Post
