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-...

Celý popis

Podrobná bibliografia

Vydané v:	The VLDB journal Ročník 26; číslo 4; s. 563 - 583
Hlavní autori:	Zhu, Qiankun, Cheng, Hong, Huang, Xin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.08.2017 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!