Comparing columnar, row and array DBMSs to process recursive queries on graphs-Reference-Cited by-同舟云学术

Comparing columnar, row and array DBMSs to process recursive queries on graphs

Published:2017-01 Issue: Volume:63 Page:66-79
ISSN:0306-4379
Container-title:Information Systems
language:en
Short-container-title:Information Systems

Author:

Ordonez Carlos,Cabrera Wellington,Gurram Achyuth

Publisher

Elsevier BV

Subject

Hardware and Architecture,Information Systems,Software

Reference33 articles.

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases: The Logical Level, Pearson Education POD, facsimile edition, 1994.

2. Direct and transitive closure algorithms;Agrawal;ACM TODS,1990

3. F. Bancilhon, R. Ramakrishnan, An amateur׳s introduction to recursive query processing strategies, in: Proceedings of ACM SIGMOD Conference, 1986, pp. 16–52.

4. C. Binnig, N. May, T. Mindnich, SQLScript: efficiently analyzing big enterprise data in SAP HANA, in: Proceedings of BTW (Datenbanksysteme für Business, Technologie und Web), 2013, pp. 363–382.

5. S. Chaudhuri, An overview of query optimization in relational systems, in: Proceedings of ACM PODS Conference, 1998, pp. 84–93.

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

1. Parallel Pattern Enumeration in Large Graphs;Lecture Notes in Computer Science;2023

2. SHARq;Proceedings of the 36th Annual ACM Symposium on Applied Computing;2021-03-22

3. Efficient Graph Analytics in Python for Large-Scale Data Science;Big Data Analytics and Knowledge Discovery;2021

4. PandaSQL;Proceedings of the 29th ACM International Conference on Information & Knowledge Management;2020-10-19

5. Efficient querying of multidimensional RDF data with aggregates: Comparing NoSQL, RDF and relational data stores;International Journal of Information Management;2020-10