Hi all,
I need to use an index structure that require less complexity
first I opt for b-tree but I'm not sure that it's a good choise
in other hand a lot of index structure exits in lettrature
- quadtree
- kd tree
- R tree
Thank you for help .
It's totally dependent on the type of data you are trying to index.
For example if you're indexing structured data, you can use b-tree indexes like in relational databases.
But if you're using Semi-structured data (as in XML), there are also semi-structured indexes available like the one in Timber XML DBMS, TMIX or..etc.
However, if you are using spatial data, you can use the indexes that you added inside your question since they are related to spatial data.
So you should be more specific in what type of data you're using.
Hi,
the choice of index type depends on your database type and use. If it is a relational database for an OLTP usage, a B-tree index is usually used. However, if your database is meant for business intelligence (modeled as a star schema) with read-intensive queries and a high selectivity ratio, other index types can me used such as bitmap, star join indexes, etc.
thank you for your answer
in reality i have non-structured data (spatial data)
i want to speed up my algorithm of searching and querying this data
for that i didn't know exactly which index structure i have to use
- Badges
- Science topic
- Similar topics
- Mathematics
- Statistics
- Statistical Analysis
- Data Analysis
- Dataset
- Big Data