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

Qiankun Zhu, Hong Cheng, Xin Huang (2017)

> Home

Details and statistics

DOI: 10.1007/S00778-017-0464-7

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/vldb/ZhuCH17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vldb/ZhuCH17
Qiankun Zhu, Hong Cheng, Xin Huang:
I/O-efficient algorithms for top-k nearest keyword search in massive graphs. VLDB J. 26(4): 563-583 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.