An Overview of Reachability Indexes on Graphs-Reference-Cited by-同舟云学术

An Overview of Reachability Indexes on Graphs

Published:2023-06-04 Issue: Volume: Page:
ISSN:
Container-title:Companion of the 2023 International Conference on Management of Data
language:
Short-container-title:

Author:

Zhang Chao¹^ORCID,Bonifati Angela²^ORCID,Özsu M. Tamer¹^ORCID

Affiliation:

1. University of Waterloo, Waterloo, ON, Canada

2. Lyon 1 University, Lyon, France

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3555041.3589408

Reference57 articles.

1. Regular path queries with constraints

2. Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. In Proc. ACM SIGMOD;Agrawal R.;Int. Conf. on Management of Data. 253--262. https://doi.org/10.,1989

3. Renzo Angles , Marcelo Arenas , Pablo Barceló , Aidan Hogan , Juan Reutter , and Domagoj Vrgovc . 2017 . Foundations of Modern Query Languages for Graph Databases . ACM Comput. Surv. , Vol. 50 , 5, Article 68 (2017), 40 pages. https://doi.org/ 10 .1145/3104031 10.1145/3104031 Renzo Angles, Marcelo Arenas, Pablo Barceló, Aidan Hogan, Juan Reutter, and Domagoj Vrgovc. 2017. Foundations of Modern Query Languages for Graph Databases. ACM Comput. Surv. , Vol. 50, 5, Article 68 (2017), 40 pages. https://doi.org/10.1145/3104031

4. Spatial networks

5. Angela Bonifati George Fletcher Hannes Voigt Nikolay Yakovets and H. V. Jagadish. 2018. Querying Graphs. Morgan & Claypool Publishers. https://doi.org/10.2200/S00873ED1V01Y201808DTM051 10.2200/S00873ED1V01Y201808DTM051

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

1. Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs;Proceedings of the ACM on Management of Data;2024-03-12

2. Minimum Strongly Connected Subgraph Collection in Dynamic Graphs;Proceedings of the VLDB Endowment;2024-02

3. Knowledge Engineering in the Era of Artificial Intelligence;Advances in Databases and Information Systems;2023