QLever

QLever
Original authorsHannah Bast, Björn Buchhold, Johannes Kalmbach, et al.
Initial release2017; 9 years ago (2017)
Written inC++
StandardSPARQL
Available inEnglish
TypeGraph database
LicenseApache License
Websiteqlever.dev
Repositorygithub.com/ad-freiburg/qlever

QLever (pronounced /ˈklɛvər/ KLEH-ver, as in "clever") is an open-source triplestore, graph database and SPARQL engine. It is designed to efficiently load and query very large RDF datasets, including those with hundreds of billions of triples on a single commodity server.[1] Unlike many large-scale graph databases that rely on distributed clusters, QLever is designed to operate efficiently on a single machine with modest memory requirements, even with very large datasets.[2] QLever implements the full SPARQL 1.1 standard, including SPARQL Update, for read/write operations.[3]

Beyond standard RDF graph queries, QLever integrates full-text search directly within SPARQL, allowing queries to combine structured semantic web knowledge-base lookups with keyword search over text corpuses. [1] It also supports spatial queries via the GeoSPARQL standard, enabling geometric operations over spatial datasets such as OpenStreetMap.[4] A context-sensitive autocomplete interface for QLever supports users in creating SPARQL queries interactively.[5]

History

QLever was first described in a 2017 paper by Hannah Bast and Björn Buchhold of the University of Freiburg.[1] The paper introduced QLever's approach of combining SPARQL with full-text search and demonstrated performance advantages over contemporary SPARQL engines. Development originated at the Chair for Algorithms and Data Structures at the University of Freiburg.

In 2021, the team published work on efficient RDF conversion and querying of the complete OpenStreetMap dataset, introducing support for GeoSPARQL queries over the full OSM data.[4] A 2022 paper introduced the context-sensitive SPARQL auto-completion system.[5]

A 2023 study compared QLever with Virtuoso, Blazegraph, GraphDB, Stardog, Apache Jena, and Oxigraph.[6] As part of the EU Next Generation Internet (NGI) Search programme[7], QLever achieved full SPARQL 1.1 compliance in June 2025, including support for SPARQL Update and the Graph Store HTTP Protocol, enabling read/write operations. In the same year, with support from the Swiss Prototype Fund[8], the indexing approach was extended to encode common identifiers directly within numerical IDs, eliminating string lookups even at result export time. This allowed QLever to index and query datasets exceeding one trillion triples on a single commodity server.

A 2025 paper presented an efficient algorithm for large-scale spatial joins, demonstrating the ability to compute all spatial relations between the 1.4 billion geometric objects in the complete OpenStreetMap dataset in under three hours on a commodity PC, outperforming PostGIS by more than an order of magnitude. [9]

In June 2025, the public SPARQL endpoint of the UniProt dataset hosted by the Swiss Institute of Bioinformatics switched from Virtuoso to QLever.[10]

Contents

The official QLever instance provides API endpoints for querying the following datasets:[11]

For OpenStreetMap and OpenHistoricalMap data, the QLever engine supports a subset of GeoSPARQL functions, supplemented by a precomputed subset of GeoSPARQL relationships stored as dedicated triples.[4]

Adoption

The Wikimedia Foundation issued a report in January 2026 qualifying QLever and Virtuoso Universal Server as high-performance candidates for replacing Blazegraph.

Besides the official instance, the QLever engine also powers the official SPARQL endpoint of DBLP[12] and UniProt.[10] QLever is one of the candidates to replace Blazegraph as the triplestore for the Wikidata Query Service.[6][13]

See also

Wikimedia Commons logo
Wikimedia Commons has media related to QLever.

References

  1. ^ a b c Bast, Hannah; Buchhold, Björn (2017-11-06). "QLever: A Query Engine for Efficient SPARQL+Text Search". Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. CIKM '17. New York, NY, USA: Association for Computing Machinery. pp. 647–656. doi:10.1145/3132847.3132921. ISBN 978-1-4503-4918-5.
  2. ^ "QLever's distinguishing features". GitHub. 2025-07-16.
  3. ^ "Compliance - QLever Documentation". QLever Documentation. Retrieved 2026-04-04.
  4. ^ a b c Bast, Hannah; Brosi, Patrick; Kalmbach, Johannes; Lehmann, Axel (2021). "An Efficient RDF Converter and SPARQL Endpoint for the Complete OpenStreetMap Data". In Meng, Xiaofeng; Wang, Fusheng; Lu, Chang-Tien; Huang, Yan; Shekhar, Shashi; Xie, Xing (eds.). Proceedings of the 29th International Conference on Advances in Geographic Information Systems. ACM. pp. 536–539. doi:10.1145/3474717.3484256. ISBN 978-1-4503-8664-7.
  5. ^ a b Bast, Hannah; Kalmbach, Johannes; Klumpp, Theresa; Kramer, Florian; Schnelle, Niklas (2021-04-29). "Efficient SPARQL Autocompletion via SPARQL". arXiv:2104.14595v1 [cs.DB].
  6. ^ a b Lam, An Ngoc; Elvesæter, Brian; Martin-Recuerda, Francisco (2023). Evaluation of a Representative Selection of SPARQL Query Engines Using Wikidata (PDF). Extended Semantic Web Conference. Lecture Notes in Computer Science. Vol. 13870. Springer, Cham. pp. 679–696. doi:10.1007/978-3-031-33455-9_40. ISBN 978-3-031-33454-2. To ensure that our limited selection of triple stores is representative and diverse, the following triplestores were evaluated: … QLever (commit version 742213facfcc80af11dade9a971fa6b09770f9c)…. QLever was very fast on success queries, but it offered limited support for queries with complex SPARQL constructs.
  7. ^ "The final Open Call 5 NGI Searchers are announced". 2024-10-07.
  8. ^ "Prototyping journey Insights: QLever — Making Data Smarter, Faster, and More Sustainable". 2025-11-26.
  9. ^ Bast, Hannah; Brosi, Patrick; Kalmbach, Johannes (2025-11-03). "Efficient Spatial Joins on Large Geometry Sets". Proceedings of the 33rd ACM International Conference on Advances in Geographic Information Systems. ACM. pp. 466–476. doi:10.1145/3748636.3762757. ISBN 979-8-4007-2086-4.
  10. ^ a b "UniProt SPARQL endpoint".
  11. ^ "QLever". Freiburg im Breisgau: University of Freiburg Chair for Algorithms and Data Structures. Retrieved 13 July 2024.
  12. ^ "dblp SPARQL query service". Schloss Dagstuhl. Retrieved 2024-11-09.
  13. ^ Woodie, Alex (10 July 2025). "Scaling the Knowledge Graph Behind Wikipedia". BigDATAwire. San Diego: Tabor Communications. Retrieved 1 August 2025.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.