I'm building a database...

[Nelsoncarmo26]

Ok, so I'm building a database in my website for Static Meshes and Textures.
I don't know if you guys already have one in here.

I think Ant mentioned something about a water texture database...?

I know there is a meshes database on wikipedia, but it's not very clear and it took me just as long to look for meshes as it did just randomly opening them to see what they contained.

My database is a WIP, as I only just started it, but check it out...
It has the name of the mesh too, so you can easily find it.

It's in the forums, under Videogames Help.

[DW_Ant]

No, I created a texture index that divides the texture packages based on what types of textures they have (certain packages belong in many categories).
There are a few errors in the document at the moment (some are custom packages rather than default so I'll need to filter them out).
Whenever I get around to it, I'll upload on the internet somewhere. I just don't know where though.

In terms of your database, you just want to create it to help organize what packages go into where, right? Similar to the Unreal Wiki Static Mesh Index.
Not building a search engine or anything, are you?

[Nelsoncarmo26]

Yes, kind of a internal search engine, so you can type the mesh you are looking for and it will display the results.
Ultimatelly I want to place a link in every single static mesh name on the database, and when you click or highlight it it will show a picture of it.

To keep it short,
I want people to be able to easily find every static mesh in my database, wether they google it, or just ask for help in another website...
Then people can point my database out.

I hope that answers the question Ant.

Eventually I will also make a textures database.

Right now it seems it's going to take some time to finish the Meshes database.

[DW_Ant]

Do my favorite data structure: Hashing!
Search by the index address rather than searching the name itself. Then again, I don't think the static mesh packages aren't large enough to make it worth the programming.

I would rather have have the options available to you, like a menu. Click on the option, then all the packages containing that type is displayed, very much like the unreal wiki.

What was wrong with Unreal Wiki, again?

[Nelsoncarmo26]

One of the things in wiki is that it doesn't have the name of the mesh, and simply just has the type of mesh and a few packages, and I found it wasn't quite complete, as the author missed out a lot of meshes.

I aim to make everything as easy as possible, so all you have to do is go straight to the package>group>and scroll down to the name of the mesh in just a few clicks, and will only take a few seconds.

[DW_Fry]

Whenever I get around to it, I'll upload on the internet somewhere. I just don't know where though.

If you ever need anything hosted, just let me know.

[Nelsoncarmo26]

Ant, I don't know what Hashing is... is it like an A-Z index?
Like the ones usually used for cheats and Reviews?

Ho Ant, somehow I missed the part you want someone to host it, and just realized after fry is response.
Upload it whenever you can, and I will host it in my website.

What fry just staed... same here.
If you want something hosted, let me know.

2 websites hosts are better than one, right?

By the way, now that we're at it, do you want me to place DW forums as parterns in my website?
It goes under the partners and cool sites on the side bar.

[DW_Ant]

Ant, I don't know what Hashing is... is it like an A-Z index?
Like the ones usually used for cheats and Reviews?

Hashing is one of the most efficient search tools since it often searches in constant time (if you do open Hashing).
In a nutshell:
Say if you got the data values: 10-23-24-12-9-29-7-29-13-18
Now we need to sort them into an array so we can search for these values. Instead of just using a linear search where you start the search at 10 then 23 then 24 on and on until you get to the end, we can use hashing that'll jump straight to the index number, search about 0-3 elements, then concludes the result. Reducing the time from Order N (number of elements) to Constant Time (Searching for a value as low as one time).

First create an array that must contain more available spaces than the number of elements. We have 10 elements, and for example purposes, the array will have 20 slots.
Now to insert the elements and to find the right index number, we use a function that is displayed as %
It basically returns the remainder after the division.
So we take the % of the current element by the total size of the hash table.
10%20=10 so our index number for 10 will be 10. 10 is inserted at the tenth index number.
23%20=3 so our index number for 23 will be 3.
24%20=4
12%20=12
9%20=9
29%20=9 (notice how these two elements are both going to the same index number. This is called a collision. You have two choices: You can either create a single linked list, or send this element to the next index number, but ten is taken, too. So now the number 29 moves to the next one. The eleventh index number.
13%20=13
18%20=18
So if you simply moved the elements to the next index number (closed hashing), then our array will look like this:
Index # | Data Value
0 -
1 -
2 -
3 23
4 24
5 -
6 -
7 -
8 -
9 9
10 10
11 29
12 12
13 13
on and on

Now to search for the values. Say if we're searching for number 17, the program should perform this calculation:
17%20=17
Search the index 17. Since that index number is empty, the program will assume that 17 doesn't exist (notice how quickly we searched the entire list within one simple calculation).

There is a flaw in this array. Say if we wanted to search for 49. Then we get this:
49%20=9
We look in index 9 only to find 9. So we move to the next element. Index 10 doesn't have 49. Moving on. Index 11 isn't 49, index 12 isn't 49, index 13 isn't 49, and index 14 is empty so NOW the program assumes that 49 doesn't exist. I'm certain that you already can tell where I'm heading with this flaw I mentioned. The more collisions you have, the longer the search time. Therefore, you should always set the number of index numbers greater than twice the number of elements AND set it equal to a prime number. Prime numbers aren't divisible so we should get lots of remainders.

That's Hashing in a nutshell. If you want more info, check out this link.

By the way, now that we're at it, do you want me to place DW forums as parterns in my website?
It goes under the partners and cool sites on the side bar.

I don't see why not. We can't dictate what goes on your website so the choice is yours.

[Nelsoncarmo26]

Ok, for the first thing... I'm not going to pretend to know what you so kindly explained to me, because I don't have a clue. Besides mathematics isn't one of my vertues.

I will look into it though, to see if I can get to grips with it... if all else fails, there are allways apps I can add to create an index.

For the second thing... I will add DW forums to my partners list right now.

Don't forget if you want something posted on my website, consider it done.