This paper focuses on finding spatial association rules. In the first part of the article the specifics of spatial databases are discussed and the existing methods for finding spatial association rules are reviewed. Also different classes of spatial relations used to express the relationships between objects in spatial databases are presented. Farther a method for mining spatial association rules has been proposed and special data structure, called T-tree, for storing frequent and potentially frequent itemsets has been introduced. Spatial objects are represented here as points. Non-spatial items contain information considering spatial elements. Discovered associations contain information including both spatial and non-spatial elements.