SPSR Efficient Processing of Socially k-Nearest Neighbors with Spatial Range Filter

• Other Authors: Pasumarthy, Nitin (Author)
• Format: Dissertation
• Language: English
• Published: 2016
• Subjects: Computer science; Computer engineering; database; geosocial; graph; index; knn; shortest path
• Online Access: http://hdl.handle.net/2286/R.I.40219

abstract: Social media has become popular in the past decade. Facebook for example has 1.59 billion active users monthly. With such massive social networks generating lot of data, everyone is constantly looking for ways of leveraging the knowledge from social networks to make their systems more personalized to their end users. And with rapid increase in the usage of mobile phones and wearables, social media data is being tied to spatial networks. This research document proposes an efficient technique that answers socially k-Nearest Neighbors with Spatial Range Filter. The proposed approach performs a joint search on both the social and spatial domains which radically improves the performance compared to straight forward solutions. The research document proposes a novel index that combines social and spatial indexes. In other words, graph data is stored in an organized manner to filter it based on spatial (region of interest) and social constraints (top-k closest vertices) at query time. That leads to pruning necessary paths during the social graph traversal procedure, and only returns the top-K social close venues. The research document then experimentally proves how the proposed approach outperforms existing baseline approaches by at least three times and also compare how each of our algorithms perform under various conditions on a real geo-social dataset extracted from Yelp. === Dissertation/Thesis === Masters Thesis Computer Science 2016