Finding smallest k-Compact tree set for keyword queries on graphs using mapreduce.
Chengfei Liu|Liang Yao|Jianxin Li|Rui Zhou|Zhenying He
| Anthology ID: | DBLP:journals/www/LiuYL0H16 |
|---|---|
| Year: | 2016 |
| Venue: | World Wide Web (WWW) |
| Pages: | 499-518 |
| URL: | https://doi.org/10.1007/S11280-015-0337-1 |
| DOI: | https://doi.org/10.1007/S11280-015-0337-1 |
| DBLP: | journals/www/LiuYL0H16 |
| BibTeX: |
@article{liu-2016-finding,
author = {Chengfei Liu and
Liang Yao and
Jianxin Li and
Rui Zhou and
Zhenying He},
title = {{Finding smallest k-Compact tree set for keyword queries on graphs using mapreduce}},
journal = {World Wide Web (WWW)},
volume = {19},
number = {3},
pages = {499--518},
year = {2016},
url = {https://doi.org/10.1007/S11280-015-0337-1},
doi = {https://doi.org/10.1007/S11280-015-0337-1}
}