I/O-efficient algorithms for top-k nearest keyword search in massive graphs

Networks emerging nowadays usually have labels or textual content on the nodes. We model such commonly seen network as an undirected graph G , in which each node is attached with zero or more keywords, and each edge is assigned with a length. On such networks, a novel and useful query is called top-...

Full description

Saved in:

Bibliographic Details
Published in:	The VLDB journal Vol. 26; no. 4; pp. 563 - 583
Main Authors:	Zhu, Qiankun, Cheng, Hong, Huang, Xin
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2017 Springer Nature B.V
Subjects:	Computer Science Database Management Graphs Keywords Networks Regular Paper Shortest-path problems Stores Studies Trees Well construction Nearest keywords search I/O-efficient algorithms Top Massive graphs
ISSN:	1066-8888, 0949-877X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!