This report is the documentation of the master thesis project that pursues to show that indoor space shortest path queries processed directly on the database engine without any middle-ware are effective.

The project includes the usage of indoor space data model and it's adaptation to support effective shortest path queries in indoor spaces. The model takes partitions, doors and connectors with their geometrical values as objects and provides the connections between those elements with the help of spatial properties only. In order model to increase the efficiency of the queries the model was extended by R-Tree indexing structure.

Finally, the number of queries were written to show, that the model is able to support the queries without the help of aditional middle-ware tools and it is efficient.