Selectivity estimation in spatial networks
Eleftherios Tiakas, Apostolos N. Papadopoulos, A. Alexandros Nanopoulos, Y. Manolopoulos · 2008
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph size (number of nodes and edges) and other graph parameters. In this paper, we present novel methods to estimate the number of nodes in regions of interest in spatial networks, towards predicting the space and time requirements of range queries. We examine all methods by using real-life and synthetic spatial networks. Experimental results show that the number of nodes can be estimated efficiently and accurately with small space requirements, thus providing useful information to the query optimizer.