Compact reachability labeling for graph-structured data.
Hao He|Haixun Wang|Jun Yang|Philip S. Yu
| Anthology ID: | DBLP:conf/cikm/HeWYY05 |
|---|---|
| Volume: | Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005 |
| Year: | 2005 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 594-601 |
| URL: | https://doi.org/10.1145/1099554.1099708 |
| DOI: | https://doi.org/10.1145/1099554.1099708 |
| DBLP: | conf/cikm/HeWYY05 |
| BibTeX: |
@inproceedings{he-2005-compact,
author = {Hao He and
Haixun Wang and
Jun Yang and
Philip S. Yu},
editor = {Otthein Herzog and
Hans-J\"{o}rg Schek and
Norbert Fuhr and
Abdur Chowdhury and
Wilfried Teiken},
title = {{Compact reachability labeling for graph-structured data}},
booktitle = {{Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31 - November 5, 2005}},
pages = {594--601},
publisher = {ACM},
year = {2005},
url = {https://doi.org/10.1145/1099554.1099708},
doi = {https://doi.org/10.1145/1099554.1099708}
}