Benchmarking optimised algorithms for transitive closure-Reference-Cited by-同舟云学术

Benchmarking optimised algorithms for transitive closure

Published:2017 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the South African Institute of Computer Scientists and Information Technologists on - SAICSIT '17
language:
Short-container-title:

Author:

Pieterse Vreda¹,Cleophas Loek²

Affiliation:

1. University of Pretoria, Pretoria, South Africa

2. Stellenbosch University, Stellenbosch, South Africa and Eindhoven University of Technology, Eindhoven, The Netherlands

Publisher

ACM Press

Reference32 articles.

1. Rakesh Agrawal, Shaul Dar, and H. V. Jagadish. 1990. Direct transitive closure algorithms: design and performance evaluation. ACM Transactions on Database Systems (TODS) 15, 3 (1990), 427--458.

2. Rakesh Agrawal and H. V. Jagadish. 1987. Direct Algorithms for Computing the Transitive Closure of Database Relations. In Proceedings of the 13th International Conference on Very Large Data Bases (VLDB '87). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 255--266. http://0-dl.acm.org.innopac.up.ac.za/citation.cfm?id=645914.671624

3. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. 1974. The design and analysis of computer algorithms. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.

4. James J. Baker. 1962. A note on multiplying Boolean matrices. Commun. ACM 5, 2 (1962), 102.

5. Steffen Beyer. 2009. Bit::Vector. http://guest.engelschall.com/-sb/download/Bit-Vector/. (2009). [Online; accessed 2014-08-23].

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Anti-Section Transitive Closure;2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC);2021-12