Skip to main content
SpringerLink
Log in

Efficient and Convenient SPARQL+Text Search: A Quick Survey

  • Chapter
  • First Online:
Reasoning Web. Learning, Uncertainty, Streaming, and Scalability (Reasoning Web 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11078))

Included in the following conference series:

Abstract

This is a quick survey about efficient search on a text corpus combined with a knowledge base. We provide a high-level description of two systems for searching such data efficiently. The first and older system, Broccoli, provides a very convenient UI that can be used without expert knowledge of the underlying data. The price is a limited query language. The second and newer system, QLever, provides an efficient query engine for SPARQL+Text, an extension of SPARQL to text search. As an outlook, we discuss the question of how to provide a system with the power of QLever and the convenience of Broccoli. Both Broccoli and QLever are also useful when only searching a knowledge base (without additional text).

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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.

    The identifiers are actually URIs and the prefix fb:stands for the common beginning of these URIs. See Sect. 5 for more explanation of this.

  2. 2.

    We sweep under the rug here that this is not a matter of co-occurrence alone. For example, a text segment may additionally contain the word not and thus negate the meaning. There are different approaches to handle this which we do not discuss here.

  3. 3.

    The number of matching text segments shown (per match for the remaining variables in the SELECT clause) can be controlled with a TEXTLIMIT <k> clause. The default is TEXTLIMIT 1.

References

  1. Bast, H., Bäurle, F., Buchhold, B., Haussmann, E.: Broccoli: semantic full-text search at your fingertips. CoRR abs/1207.2615 (2012)

    Google Scholar 

  2. Bast, H., Bäurle, F., Buchhold, B., Haußmann, E.: Easy access to the freebase dataset. In: WWW (Companion Volume), pp. 95–98. ACM (2014)

    Google Scholar 

  3. Bast, H., Bäurle, F., Buchhold, B., Haußmann, E.: Semantic full-text search with broccoli. In: SIGIR, pp. 1265–1266. ACM (2014)

    Google Scholar 

  4. Bast, H., Buchhold, B.: An index for efficient semantic full-text search. In: CIKM, pp. 369–378. ACM (2013)

    Google Scholar 

  5. Bast, H., Buchhold, B.: QLever: a query engine for efficient SPARQL+text search. In: CIKM, pp. 647–656. ACM (2017)

    Google Scholar 

  6. Bast, H., Buchhold, B., Haussmann, E.: Relevance scores for triples from type-like relations. In: SIGIR, pp. 243–252. ACM (2015)

    Google Scholar 

  7. Bast, H., Buchhold, B., Haussmann, E.: Semantic search on text and knowledge bases. Found. Trends Inf. Retr. 10(2–3), 119–271 (2016)

    Article  Google Scholar 

  8. Bast, H., Haussmann, E.: Open information extraction via contextual sentence decomposition. In: ICSC, pp. 154–159. IEEE Computer Society (2013)

    Google Scholar 

  9. Bast, H., Haussmann, E.: More accurate question answering on freebase. In: CIKM, pp. 1431–1440. ACM (2015)

    Google Scholar 

  10. Carmel, D., Chang, M., Gabrilovich, E., Hsu, B.P., Wang, K.: ERD’14: entity recognition and disambiguation challenge. In: SIGIR Forum, vol. 48, no. 2, pp. 63–77 (2014)

    Google Scholar 

  11. ClueWeb: The Lemur Projekt (2012). http://lemurproject.org/clueweb12

  12. Cucerzan, S.: Large-scale named entity disambiguation based on Wikipedia data. In: EMNLP-CoNLL, pp. 708–716. ACL (2007)

    Google Scholar 

  13. Neumann, T., Weikum, G.: The RDF-3X engine for scalable management of RDF data. VLDB J. 19(1), 91–113 (2010). https://doi.org/10.1007/s00778-009-0165-y

    Article  Google Scholar 

  14. OpenLink: The Virtuoso Project. https://virtuoso.openlinksw.com

  15. Vrandecic, D., Krötzsch, M.: Wikidata: a free collaborative knowledgebase. Commun. ACM 57(10), 78–85 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Freiburg, 79110, Freiburg, Germany

    Hannah Bast & Niklas Schnelle

Authors
  1. Hannah Bast
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Niklas Schnelle
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hannah Bast .

Editor information

Editors and Affiliations

  1. University of Bari Aldo Moro, Bari, Italy

    Claudia d’Amato

  2. University of Luxembourg, Esch-sur-Alzette, Luxembourg

    Martin Theobald

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Bast, H., Schnelle, N. (2018). Efficient and Convenient SPARQL+Text Search: A Quick Survey. In: d’Amato, C., Theobald, M. (eds) Reasoning Web. Learning, Uncertainty, Streaming, and Scalability. Reasoning Web 2018. Lecture Notes in Computer Science(), vol 11078. Springer, Cham. https://doi.org/10.1007/978-3-030-00338-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00338-8_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00337-1

  • Online ISBN: 978-3-030-00338-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation