Article

Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins

Authors:

Thomas Neumann,

Guido MoerkotteAuthors Info & Claims

ICDE '11: Proceedings of the 2011 IEEE 27th International Conference on Data Engineering

Pages 984 - 994

https://doi.org/10.1109/ICDE.2011.5767868

Published: 11 April 2011 Publication History

Abstract

Accurate cardinality estimates are essential for a successful query optimization. This is not only true for relational DBMSs but also for RDF stores. An RDF database consists of a set of triples and, hence, can be seen as a relational database with a single table with three attributes. This makes RDF rather special in that queries typically contain many self joins. We show that relational DBMSs are not well-prepared to perform cardinality estimation in this context. Further, there are hardly any special cardinality estimation methods for RDF databases. To overcome this lack of appropriate cardinality estimation methods, we introduce characteristic sets together with new cardinality estimation methods based upon them. We then show experimentally that the new methods are-in the RDF context-highly superior to the estimation methods employed by commercial DBMSs and by the open-source RDF store RDF-3X.

Cited By

View all

Mulder TFletcher GYakovets N(2025)Optimizing navigational graph queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00892-734:2Online publication date: 1-Mar-2025
https://dl.acm.org/doi/10.1007/s00778-024-00892-7
Lou YLai LLyu BYang YZhou XYu WZhang YZhou J(2024)Towards a Converged Relational-Graph Optimization FrameworkProceedings of the ACM on Management of Data10.1145/36988282:6(1-27)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698828
Hu PMotik B(2024)Accurate Sampling-Based Cardinality Estimation for Complex Graph QueriesACM Transactions on Database Systems10.1145/368920949:3(1-46)Online publication date: 17-Sep-2024
https://dl.acm.org/doi/10.1145/3689209
Show More Cited By

Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins
1. Information systems
  1. Data management systems
    1. Database management system engines
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory

Recommendations

Relationships between covering-based rough sets and relation-based rough sets

Rough set theory is an important technique to deal with vagueness and granularity in information systems. In rough set theory, relation-based rough sets and covering-based rough sets are two important extensions of the classical rough sets. This paper ...
Granular rough sets and granular shadowed sets: Three-way approximations in Pawlak approximation spaces
Abstract
A Pawlak approximation space is a pair of a ground set/space and a quotient set/space of the ground set induced by an equivalence relation on the ground set. The quotient space is a simple granulation of the ground space such that an equivalence ...
Characteristic sets of matroids
Abstract
We investigate possible linear, algebraic, and Frobenius flock characteristic sets of matroids. In particular, we classify possible combinations of linear and algebraic characteristic sets when the algebraic characteristic set is finite or ...

Comments

Information & Contributors

Information

Published In

ICDE '11: Proceedings of the 2011 IEEE 27th International Conference on Data Engineering

April 2011

1457 pages

ISBN:9781424489596

Publisher

IEEE Computer Society

United States

Publication History

Published: 11 April 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mulder TFletcher GYakovets N(2025)Optimizing navigational graph queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-024-00892-734:2Online publication date: 1-Mar-2025
https://dl.acm.org/doi/10.1007/s00778-024-00892-7
Lou YLai LLyu BYang YZhou XYu WZhang YZhou J(2024)Towards a Converged Relational-Graph Optimization FrameworkProceedings of the ACM on Management of Data10.1145/36988282:6(1-27)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3698828
Hu PMotik B(2024)Accurate Sampling-Based Cardinality Estimation for Complex Graph QueriesACM Transactions on Database Systems10.1145/368920949:3(1-46)Online publication date: 17-Sep-2024
https://dl.acm.org/doi/10.1145/3689209
van Leeuwen WFletcher GYakovets N(2024)HomeRun: A Cardinality Estimation Advisor for Graph DatabasesProceedings of the 7th Joint Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA)10.1145/3661304.3661902(1-9)Online publication date: 14-Jun-2024
https://dl.acm.org/doi/10.1145/3661304.3661902
Schwabe TAcosta M(2024)Cardinality Estimation over Knowledge Graphs with Embeddings and Graph Neural NetworksProceedings of the ACM on Management of Data10.1145/36392992:1(1-26)Online publication date: 26-Mar-2024
https://dl.acm.org/doi/10.1145/3639299
Chen JHuang YWang MSalihoglu SSalem K(2023)Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation GraphsACM SIGMOD Record10.1145/3604437.360445852:1(94-102)Online publication date: 8-Jun-2023
https://dl.acm.org/doi/10.1145/3604437.3604458
Diop LMarkhoff BSoulet A(2023)TTProfiler: Types and Terms Profile Building for Online Cultural Heritage Knowledge GraphsJournal on Computing and Cultural Heritage 10.1145/358844316:3(1-22)Online publication date: 9-Aug-2023
https://dl.acm.org/doi/10.1145/3588443
Zheng GRen TYang LZhang XFeng Z(2023)mStore: Schema Mining based-RDF Data StorageCompanion Proceedings of the ACM Web Conference 202310.1145/3543873.3587339(168-171)Online publication date: 30-Apr-2023
https://dl.acm.org/doi/10.1145/3543873.3587339
Wang HHu RZhang YQin LWang WZhang WIves ZBonifati AEl Abbadi A(2022)Neural Subgraph Counting with Wasserstein EstimatorProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526163(160-175)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526163
Al-Sayeh HMemishi BJibril MParadies MSattler KIves ZBonifati AEl Abbadi A(2022)Juggler: Autonomous Cost Optimization and Performance Prediction of Big Data ApplicationsProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3517892(1840-1854)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3517892
Show More Cited By

Abstract

Cited By

Recommendations

Relationships between covering-based rough sets and relation-based rough sets

Granular rough sets and granular shadowed sets: Three-way approximations in Pawlak approximation spaces

Characteristic sets of matroids

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations