DURS: A distributed method for k-nearest neighbor search on uncertain graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

Large graphs are increasingly prevalent in mobile networks, social networks, traffic networks and biological networks. These graphs are often uncertain, where edges are augmented with probabilities that indicates the chance to exist. Recently k-nearest neighbor search has been studied within the field of uncertain graphs, but the scalability and efficiency issues are not well solved. Moreover, solutions are implemented on a single machine and thus cannot fit large uncertain graphs. In this paper, we develop a framework, called DURS, to distribute k-nearest neighbor search into several machines and re-partition the uncertain graphs to balance the work loads and reduce the communication costs. Evaluation results show that DURS is essential to make the system scalable when answering k-nearest neighbor queries on uncertain graphs.

Original languageEnglish
Title of host publicationProceedings - 2019 20th International Conference on Mobile Data Management, MDM 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages377-378
Number of pages2
ISBN (Electronic)9781728133638
DOIs
Publication statusPublished - Jun 2019
Event20th International Conference on Mobile Data Management, MDM 2019 - Hong Kong, Hong Kong
Duration: 10 Jun 201913 Jun 2019

Publication series

NameProceedings - IEEE International Conference on Mobile Data Management
Volume2019-June
ISSN (Print)1551-6245

Conference

Conference20th International Conference on Mobile Data Management, MDM 2019
Country/TerritoryHong Kong
CityHong Kong
Period10/06/1913/06/19

Keywords

  • Distributed system
  • K-nearest neighbor
  • Scalable search
  • Uncertain graphs

Fingerprint

Dive into the research topics of 'DURS: A distributed method for k-nearest neighbor search on uncertain graphs'. Together they form a unique fingerprint.

Cite this