skip to main content
10.1145/1242572.1242782acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
Article

Estimating the cardinality of RDF graph patterns

Published: 08 May 2007 Publication History

Abstract

Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is determining the join order which depends on the expected cardinality of intermediate results. This work proposes a pattern-based summarization framework for estimating the cardinality of RDF graph patterns. We present experiments on real world and synthetic datasets which confirm the feasibility of our approach.

References

[1]
Anyanwu, K., Maduko, A., Sheth, A. SemRank: Ranking Complex Relationship Search Results on the Semantic Web. WWW 2005.
[2]
Guo, Y., Pan, Z., Heflin, J. LUBM: A Benchmark for OWL Knowledge Base Systems. J. of Web Semantics 3(2), 2005.
[3]
Haase, P., Broekstra, J., Eberharth, A., Volz, R. A Comparison of RDF Query Languages. ISWC 2004.
[4]
Yan, X., Han, J. gSpan: Graph--Based Substructure Pattern Mining. ICDM 2002.
[5]
http://lsdis.cs.uga.edu/projects/semdis/swetodblp

Cited By

View all
  • (2022)HERMES: data placement and schema optimization for enterprise knowledge basesThe VLDB Journal10.1007/s00778-022-00756-y32:3(549-574)Online publication date: 26-Jul-2022
  • (2021)Property Graph Schema Optimization for Domain-Specific Knowledge Graphs2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00085(924-935)Online publication date: Apr-2021
  • (2018)Managing big RDF data in clouds: Challenges, opportunities, and solutionsSustainable Cities and Society10.1016/j.scs.2018.02.01939(375-386)Online publication date: May-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '07: Proceedings of the 16th international conference on World Wide Web
May 2007
1382 pages
ISBN:9781595936547
DOI:10.1145/1242572
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 May 2007

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. pattern cardinality estimation
  2. statistical summaries

Qualifiers

  • Article

Conference

WWW'07
Sponsor:
WWW'07: 16th International World Wide Web Conference
May 8 - 12, 2007
Alberta, Banff, Canada

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2022)HERMES: data placement and schema optimization for enterprise knowledge basesThe VLDB Journal10.1007/s00778-022-00756-y32:3(549-574)Online publication date: 26-Jul-2022
  • (2021)Property Graph Schema Optimization for Domain-Specific Knowledge Graphs2021 IEEE 37th International Conference on Data Engineering (ICDE)10.1109/ICDE51399.2021.00085(924-935)Online publication date: Apr-2021
  • (2018)Managing big RDF data in clouds: Challenges, opportunities, and solutionsSustainable Cities and Society10.1016/j.scs.2018.02.01939(375-386)Online publication date: May-2018
  • (2015)An ant colony optimisation approach for optimising SPARQL queries by reordering triple patternsInformation Systems10.1016/j.is.2015.01.01350:C(51-68)Online publication date: 1-Jun-2015
  • (2014)An Offline Optimal SPARQL Query Planning Approach to Evaluate Online Heuristic PlannersWeb Information Systems Engineering – WISE 201410.1007/978-3-319-11749-2_36(480-495)Online publication date: 2014
  • (2013)Building an efficient RDF store over a relational databaseProceedings of the 2013 ACM SIGMOD International Conference on Management of Data10.1145/2463676.2463718(121-132)Online publication date: 22-Jun-2013
  • (2011)Database foundations for scalable RDF processingProceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data10.5555/2033313.2033317(202-249)Online publication date: 23-Aug-2011
  • (2011)Database Foundations for Scalable RDF ProcessingReasoning Web. Semantic Technologies for the Web of Data10.1007/978-3-642-23032-5_4(202-249)Online publication date: 2011
  • (2010)Annotated RDFACM Transactions on Computational Logic10.1145/1656242.165624511:2(1-41)Online publication date: 22-Jan-2010
  • (2010)The RDF-3X engine for scalable management of RDF dataThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-009-0165-y19:1(91-113)Online publication date: 1-Feb-2010
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media