Path-tree: An efficient reachability indexing scheme for large directed graphs

Path-tree: An efficient reachability indexing scheme for large directed graphs

- Jin, Ruoming, Ruan, Ning, Xiang, Yang, Wang, Haixun

Title: Path-tree: An efficient reachability indexing scheme for large directed graphs
Creator: Jin, Ruoming; Ruan, Ning; Xiang, Yang; Wang, Haixun
Date: 2011
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/103396
Identifier: vital:10909
Identifier: http://delivery.acm.org/10.1145/1930000/1929941/a7-jin.pdf?ip=141.132.84.50&id=1929941&acc=ACTIVE SERVICE&key=65D80644F295BC0D.962ADB9C9DF2D2C0.4D4702B0C3E38B35.4D4702B0C3E38B35&CFID=676864885&CFTOKEN=86017481&__acm__=1475623279_81f29503a5b042406e8ec70d097bc56d
Identifier: https://doi.org/10.1145/1929934.1929941
Identifier: ISSN:03625915
Relation: ACM Transactions on Database Systems Vol. 36, no. 1 (2011), p.
Rights: Copyright ACM
Rights: This metadata is freely available under a CCO license
Subject: Graph Indexing; Maximal Directed Spanning Tree; Path-Tree Cover; Reachability Queries; Transitive Closure; 0804 Data Format; 0806 Information Systems
Reviewed

Hits: 645
Visitors: 629
Downloads: 0

		Thumbnail	File	Description	Size	Format

‹ › ×