Skip to main content

Challenge Accepted: QUAD Meets MOCHA2017

  • Conference paper
  • First Online:
Semantic Web Challenges (SemWebEval 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 769))

Included in the following conference series:

  • 408 Accesses

Abstract

Native RDF (http://www.w3.org/RDF/) stores have been making enormous progress in closing the performance gap compared to relational database management systems (RDBMS). But this small gap, however, still prevents the adoption of RDF stores in scenarios for large-scale enterprise applications. We solve this problem with our native RDF store QUAD and its fundamental design principles. It is based on a vector database schema for quadruples and it is realized by facilitating various index data structures. QUAD also comprises approaches to optimize the SPARQL query execution plan by using heuristic transformations. In this short paper, we briefly introduce QUAD and sketch in which tasks of the Mighty Storage Challenge we will attend to benchmark the current performance capabilities.

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 EPUB and 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

Notes

  1. 1.

    http://www.w3.org/standards/semanticweb/.

  2. 2.

    Here, “S” stands for Subject, “P” for Predicate, “O” for Object, and “G” for Graph.

  3. 3.

    https://www.w3.org/TR/sparql11-protocol/.

  4. 4.

    https://en.wikipedia.org/wiki/Digest_access_authentication.

  5. 5.

    http://www.boost.org/.

  6. 6.

    https://project-hobbit.eu/challenges/mighty-storage-challenge.

  7. 7.

    https://en.wikipedia.org/wiki/Multiversion_concurrency_control.

References

  1. Potocki, A., Polukhin, A., Drobyazko, G., Hladky, D., Klintsov, V., Unbehauen, J.: OntoQuad: native high-speed RDF DBMS for semantic web. In: Klinov, P., Mouromtsev, D. (eds.) KESW 2013. CCIS, vol. 394, pp. 117–131. Springer, Heidelberg (2013). doi:10.1007/978-3-642-41360-5_10

    Chapter  Google Scholar 

  2. Harris, S., Seaborne, A.: SPARQL 1.1 Query Language. Technical report, W3C Recommendation (2013). https://www.w3.org/TR/sparql11-query/

  3. Harth, A., Decker, S.: Optimized index structures for querying RDF from the web. In: LA-WEB (Latin American Web Congress) (2005)

    Google Scholar 

  4. Harth, A., Umbrich, J., Hogan, A., Decker, S.: YARS2: a federated repository for querying graph structured data from the web. In: Aberer, K., et al. (eds.) ASWC/ISWC -2007. LNCS, vol. 4825, pp. 211–224. Springer, Heidelberg (2007). doi:10.1007/978-3-540-76298-0_16

    Chapter  Google Scholar 

  5. Harth, A., Decker, S.: Yet Another RDF Store: Perfect Index Structures for Storing Semantic Web Data With Context, DERI Technical report (2004)

    Google Scholar 

  6. Baolin, L., Bo, H.: HPRD: a high performance RDF database. In: Li, K., Jesshope, C., Jin, H., Gaudiot, J.-L. (eds.) NPC 2007. LNCS, vol. 4672, pp. 364–374. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74784-0_37

    Chapter  Google Scholar 

  7. Weiss, C., Karras, P., Bernstein, A.: Sextuple Indexing for Semantic Web Data Management. PVLDB 1(1), 1008–1019 (2008)

    Google Scholar 

  8. Abadi, D.J., Marcus, A., Madden, S., Hollenbach, K.J.: Scalable semantic web data management using vertical partitioning. In: VLDB, pp. 411–422 (2007)

    Google Scholar 

  9. Wood, D., Gearon, P., Adams, T.: Kowari: a platform for semantic web storage and analysis. In: XTeGh (2005)

    Google Scholar 

  10. Neumann, T., Weikum, G.: The RDF-3X engine for scalable management of RDF data. J. VLDB 19(1), 91–113 (2010)

    Article  Google Scholar 

  11. Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. PVLDB 1(1), 647–659 (2008)

    Google Scholar 

  12. Stocker, M., Seaborne, A., Bernstein, A., Kiefer, C., Reynolds, D.: SPARQL basic graph pattern optimization using selectivity estimation. In: WWW 2008, pp. 595–604. ACM, New York (2008)

    Google Scholar 

  13. Gomathi, R., Sathya, C.: Efficient optimization of multiple SPARQL queries. IOSR J. Comput. Eng. (IOSR-JCE) 8(6) (2013), pp. 97–101 (2013). www.iosrjournals.org, e-ISSN: 2278–0661, p- ISSN: 2278–8727

  14. Graefe, G.: Query evaluation techniques for large databases. ACM Comput. Surv. 25(2), 73–170 (1993)

    Article  Google Scholar 

  15. Johnson, T., Shasha, T.: 2Q: A low overhead high performance buffer management replacement algorithm. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB 1994), San Francisco, CA, USA, pp. 439–450 (1994)

    Google Scholar 

Download references

Acknowledgments

This work was partially supported by the BMWi project SAKE (Grant No. 01MD15006).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexander Potocki .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Potocki, A., Hladky, D., Voigt, M. (2017). Challenge Accepted: QUAD Meets MOCHA2017. In: Dragoni, M., Solanki, M., Blomqvist, E. (eds) Semantic Web Challenges. SemWebEval 2017. Communications in Computer and Information Science, vol 769. Springer, Cham. https://doi.org/10.1007/978-3-319-69146-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69146-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69145-9

  • Online ISBN: 978-3-319-69146-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics