Improving Performance of Spatial Network Queries
نویسنده
چکیده
............................................................................................................. iv Introduction ........................................................................................................ 1 Background ........................................................................................................ 6 Proposed Methodology ..................................................................................... 9 Network Model................................................................................................................................................ 9 Spatial Network Queries ............................................................................................................................... 9 Graph Processing.......................................................................................................................................... 11 The Data Set............................................................................................................................................... 11 Graph Creation........................................................................................................................................... 11 Parallelizing the Process ........................................................................................................................... 15 Graph Validation ....................................................................................................................................... 17 Graph Storage And Access ......................................................................................................................... 18 Database Storage and Access ................................................................................................................... 18 Shared Library Access .............................................................................................................................. 19 M-Tree Index................................................................................................................................................. 21 Organizing the network with an M-Tree.................................................................................................. 28 Network Distance.......................................................................................................................................... 28 Dijkstra’s Algorithm.................................................................................................................................. 28 A* Algorithm............................................................................................................................................. 29 Hill Climbing ............................................................................................................................................. 31 Precomputation .......................................................................................................................................... 34 Hill Climbing and Precomputation........................................................................................................... 35 Road Network Embedding........................................................................................................................ 36 Cost Analysis ............................................................................................................................................. 38 Experimental Results....................................................................................... 40 Performance of Proposed Methodology.................................................................................................... 41 Accuracy......................................................................................................................................................... 48 Conclusion........................................................................................................ 52 References........................................................................................................ 54 Vita..................................................................................................................... 55
منابع مشابه
Graph Processing For Spatial Network Queries
Spatial network queries often have performance bound by the structure and size of the underlying network. This paper discusses methods of improving the performance of these queries, specifically those using network expansion algorithms, by creating a graph representation of the network and removing unnecessary nodes and edges. In addition, two methods of storing and accessing the graph are comp...
متن کاملS-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks
Mobile services is emerging as an important application area for spatio-temporal database management technologies. Service users are often constrained to a spatial network, e.g., a road network, through which points of interest, termed data points, are accessible. Queries that implement services will often concern data points of some specific type, e.g., Thai restaurants or art museums. As a re...
متن کاملEfficient Processing of Preference Queries in Distributed and Spatial Databases
Traditional SQL queries are recognized for producing an exact and complete result set. However, for an increasing number of applications that manage massive amounts of data, the large result set produced by traditional SQL queries has become difficult to handle. Therefore, there is an increasing interest in queries that produce a more concise result set. Preference queries capture the wishes of...
متن کاملA Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملDeveloping a ChatBot to Answer Spatial Queries for use in Location-based Services
A Chat Bot is an automated operator that can interact with customers like a human operator, answer their questions, solve problems and get feedback. Real-time responsiveness, the sense of talking to a human user is one of their good features that can be used to deliver location-based services. This paper designed a Chat Bot that can talk and answer users' questions based on their location. Thi...
متن کامل