Skip to main content

gTop: An Efficient SPARQL Query Engine

  • Conference paper
  • First Online:
Web and Big Data (APWeb-WAIM 2022)

Abstract

In this demonstration, we present gTop, a top-k query engine based on gStore which supports SPARQL queries over RDF databases. gTop can answer top-k queries with high efficiency and scalability. We use the DP-B algorithm for top-k queries and the DP-any algorithm for any-k queries. We break cyclic queries into pieces of tree queries and use DP-any to solve queries generated before assembling the results to retrieve the origin answers. Experiments show the efficiency of gTop. We provide a demonstration website to show the usage of gTop, where users can query YAGO2 with top-k SPARQL queries.

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 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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

References

  1. Cheng, J., Zeng, X., Yu, J.X.: Top-k graph pattern matching over large graphs. In: Jensen, C.S., Jermaine, C.M., Zhou, X. (eds.) 29th IEEE International Conference on Data Engineering, ICDE 2013, Brisbane, Australia, 8–12 April 2013, pp. 1033–1044. IEEE Computer Society (2013). https://doi.org/10.1109/ICDE.2013.6544895

  2. Gou, G., Chirkova, R.: Efficient algorithms for exact ranked twig-pattern matching over graphs. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 581–594 (2008)

    Google Scholar 

  3. Hoffart, J., Suchanek, F.M., Berberich, K., Weikum, G.: YAGO2: A spatially and temporally enhanced knowledge base from Wikipedia. Artif. Intell. 194, 28–61 (2013). https://doi.org/10.1016/j.artint.2012.06.001

  4. Zeng, X., Cheng, J., Yu, J.X., Feng, S.: Top-K graph pattern matching: a twig query approach. In: Gao, H., Lim, L., Wang, W., Li, C., Chen, L. (eds.) WAIM 2012. LNCS, vol. 7418, pp. 284–295. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32281-5_28

    Chapter  Google Scholar 

  5. Zou, L., Mo, J., Chen, L., Özsu, M.T., Zhao, D.: gStore: answering SPARQL queries via subgraph matching. Proc. VLDB Endow. 4(8), 482–493 (2011). https://doi.org/10.14778/2002974.2002976, http://www.vldb.org/pvldb/vol4/p482-zou.pdf

Download references

Acknowledgements

This work was partially supported by National Key R &D Program of China (2020AAA0105200).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuqi Zhou .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhou, Y., Zou, L., Cao, G. (2023). gTop: An Efficient SPARQL Query Engine. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13423. Springer, Cham. https://doi.org/10.1007/978-3-031-25201-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-25201-3_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-25200-6

  • Online ISBN: 978-3-031-25201-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics