Skip to main content

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6839))

Included in the following conference series:

  • 3413 Accesses

Abstract

Today RDF data are proliferating so fast that RDF query engines are faced with very large graphs that contain thousand million of RDF triples. Often there are a lot of joins should be processed when using RDF query language-SPARQL execute queries and the key issue for optimizing SPARQL execution plans is join ordering so selectivity estimation is very important to query cost. Exact estimation could optimize query and reduce query time, in contrast bad estimation could misguide the order of joins and increase query cost. In this paper we introduce two selectivity estimation methods: method based on histogram and method based on Index. We analyze the execute details of each method and compare the two methods then we give the conclusion that which method are better when execute query in large dataset. Finally, our experimental (using these two methods in different queries that have different join times in different size datasets.) testify our viewpoint.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wilkinson, K.: Efficient Rdf Storage and Retrieval in Jena2. J. Mol. Biol. 147, 195–197 (2003)

    Google Scholar 

  2. RDF-3x, http://www.mpi-inf.mpg.de/~neumann/rdf3x

  3. Jena: A Semantic Web Framework for Java, http://jena.sourceforge.net/

  4. Neumann, T., Weikum, G.: Scalable Join Processing on Very Large RDF Graphs. In: Proceedings of the 35th SIGMOD International Conference on Management of Data (2009)

    Google Scholar 

  5. Patrick, S., Michael, T.R., Mansur, R.: Cardinality Estimation for the Optimization of Queries on Ontologies. SIGMOD Record 36(2), 13–18 (2007)

    Article  Google Scholar 

  6. Olaf, H., Ralf, H.: The SPARQL Query Graph Model for Query Optimization. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 564–578. Springer, Heidelberg (2007)

    Google Scholar 

  7. Michael, S., Michael, M., Georg, L.: Foundations of SPARQL Query Optimization. In: ICDT (2010)

    Google Scholar 

  8. Michael, S., Thomas, H., Georg, L., Christoph, P.: SP2Bench: A SPARQL Performance Benchmark. In: ICDE (2009)

    Google Scholar 

  9. Thomas, N., Gerhard, W.: RDF-3X: RISC-style Engine for RDF. In: VLDB (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, W., Zhang, K. (2012). The Comparison between Histogram Method and Index Method in Selectivity Estimation. In: Huang, DS., Gan, Y., Gupta, P., Gromiha, M.M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2011. Lecture Notes in Computer Science(), vol 6839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25944-9_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25944-9_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25943-2

  • Online ISBN: 978-3-642-25944-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics