Estimating the Cardinality of Conjunctive Queries over RDF Data Using Graph Summarisation-Reference-Cited by-同舟云学术

Estimating the Cardinality of Conjunctive Queries over RDF Data Using Graph Summarisation

Published:2018 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18
language:
Short-container-title:

Author:

Stefanoni Giorgio¹,Motik Boris²,Kostylev Egor V.²

Affiliation:

1. Bloomberg L.P., London, United Kingdom

2. University of Oxford, Oxford, United Kingdom

Funder

Engineering and Physical Sciences Research Council (EPSRC)

Publisher

ACM Press

Reference22 articles.

1. Ashraf Aboulnaga and Surajit Chaudhuri. 1999. Self-tuning Histograms: Building Histograms Without Looking at Data Proc. of the ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1999). ACM, Philadelphia, PA, USA, 181--192.

2. Swarup Acharya, Phillip B. Gibbons, Viswanath Poosala, and Sridhar Ramaswamy. 1999. Join Synopses for Approximate Query Answering. SIGMOD Record Vol. 28, 2 (1999), 275--286.

3. Günes Alucc, Olaf Hartig, M. Tamer Özsu, and Khuzaima Daudjee. 2014. Diversified Stress Testing of RDF Data Management Systems Proc. of the 13th Int. Semantic Web Conference (ISWC 2014) (LNCS), Vol. Vol. 8796. Springer, Riva del Garda, Italy, 197--212.

4. Nicolas Bruno. 2003. Statistics on Query Expressions in Relational Database Management Systems. Ph.D. Dissertation. bibinfoschoolColumbia University.

5. Nicolas Bruno and Surajit Chaudhuri. 2004. Conditional Selectivity for Statistics on Query Expressions Proc. of the ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 2004). ACM, Paris, France, 311--322.

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

1. Accurate Sampling-Based Cardinality Estimation for Complex Graph Queries;ACM Transactions on Database Systems;2024-08-17

2. HomeRun: A Cardinality Estimation Advisor for Graph Databases;Proceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA);2024-06-09

3. LearnSC: An Efficient and Unified Learning-Based Framework for Subgraph Counting Problem;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

4. Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural Networks;Proceedings of the ACM on Management of Data;2024-03-12

5. Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach;Proceedings of the VLDB Endowment;2024-03