A hierarchical approach to reachability query answering in very large graph databases.

Saikat K. Dey|Hasan M. Jamil


Anthology ID:DBLP:conf/cikm/DeyJ10
Volume:Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010
Year:2010
Venue:International Conference on Information and Knowledge Management (CIKM)
Publisher:ACM
Pages:1377-1380
URL:https://doi.org/10.1145/1871437.1871625
DOI:https://doi.org/10.1145/1871437.1871625
DBLP:conf/cikm/DeyJ10
BibTeX:
@inproceedings{dey-2010-hierarchical, author = {Saikat K. Dey and Hasan M. Jamil}, editor = {Jimmy Huang and Nick Koudas and Gareth J. F. Jones and Xindong Wu and Kevyn Collins-Thompson and Aijun An}, title = {{A hierarchical approach to reachability query answering in very large graph databases}}, booktitle = {{Proceedings of the 19th ACM Conference on Information and Knowledge Management, CIKM 2010, Toronto, Ontario, Canada, October 26-30, 2010}}, pages = {1377--1380}, publisher = {ACM}, year = {2010}, url = {https://doi.org/10.1145/1871437.1871625}, doi = {https://doi.org/10.1145/1871437.1871625} }