Download now Free registration required
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. This dependency may be local or global. In this paper, the authors 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. They examine all methods by using real-life and synthetic spatial networks.
- Format: PDF
- Size: 466.98 KB