Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Selmer, Petra; Poulovassilis, Alexandra; Wood, Peter T. (2015)
Publisher: CEUR Workshop Proceedings
Languages: English
Types: Article
Subjects: csis
Given the heterogeneity of complex graph data on the web, such as RDF linked data,a user wishing to query such data may lack full knowledge of its structure and irregularities.\ud Hence, providing users with flexible querying capabilities can be beneficial. The query language we adopt comprises\ud conjunctions of regular path queries, thus including extensions proposed for SPARQL 1.1 to allow for querying paths using regular expressions. To this language we add two operators: APPROX, supporting standard notions of\ud approximation based on edit distance, and RELAX, which performs query relaxation based on RDFS inference rules.\ud We describe our techniques for implementing the extended language and present a performance study undertaken on two real-world data sets. Our baseline implementation performs competitively with other automaton-based approaches, and we demonstrate empirically how various optimisations can decrease execution times of queries containing APPROX and RELAX, sometimes by orders of magnitude.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] Bio4j. http://bio4j.com/.
    • [2] C. Bizer, A. Jentzsch, and R. Cyganiak. http://lod-cloud.net/state/.
    • [3] D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In KR, pages 176{185, 2000.
    • [4] J. P. Ceden~o and K. S. Candan. R2DF framework for ranked path queries over weighted RDF graphs. In Proc. WIMS, pages 40:1{40:12, 2011.
    • [5] M. Droste, W. Kuich, and H. Vogler. Handbook of Weighted Automata. Springer, 2009.
    • [6] O. Hartig and R. Heese. The SPARQL query graph model for query optimization. In Proc. ESWC, pages 564{578, 2007.
    • [7] T. Heath, M. Hausenblas, C. Bizer, and R. Cyganiak. How to publish linked data on the web (tutorial). In Proc. ISWC, 2008.
    • [8] J. Huang, D. J. Abadi, and K. Ren. Scalable SPARQL querying of large RDF graphs. PVLDB, 4(11):1123{1134, 2011.
    • [9] C. A. Hurtado, A. Poulovassilis, and P. T. Wood. Ranking approximate answers to semantic web queries. In Proc. ESWC, pages 263{277, 2009.
    • [10] G. Kasneci, M. Ramanath, F. Suchanek, and G. Weikum. The YAGO-NAGA approach to knowledge discovery. SIGMOD Rec., 37(4):41{47, Mar. 2009.
    • [11] A. Koschmieder and U. Leser. Regular path queries on large graphs. In Proc. SSDBM, pages 177{194, 2012.
    • [12] N. Martinez-Bazan and D. Dominguez-Sal. Using semijoin programs to solve traversal queries in graph databases. In Proc. GRADES, pages 6:1{6:6, 2014.
    • [13] N. Mart nez-Bazan et al. E cient graph management based on bitmap indices. In Proc. IDEAS, pages 110{119, 2012.
    • [14] Neo4j. http://www.neo4j.com/.
    • [15] I. U. of Copenhagen. http://www.itu.dk/research/c5/.
    • [16] OrientDB. http://www.orientdb.org/.
    • [17] A. Poulovassilis, P. Selmer, and P. T. Wood. Flexible querying of lifelong learner metadata. IEEE Trans. on Learning Technologies, 5(2):117{129, 2012.
    • [18] A. Poulovassilis and P. T. Wood. Combining approximation and relaxation in semantic web path queries. In Proc. ISWC, pages 631{646, 2010.
    • [19] M. Przyjaciel-Zablocki, A. Schatzle, T. Hornung, and G. Lausen. RDFPath: Path query processing on large RDF graphs with MapReduce. In ESWC Workshops, 2011.
    • [20] Reco4j. http://www.reco4j.org/.
    • [21] Sparksee. http://www.sparsity-technologies.com/.
    • [22] H. Zauner, B. Linse, T. Furche, and F. Bry. A RPL through RDF: expressive navigation in RDF graphs. In Proc. RR, pages 251{257, 2010.
    • [23] D. D. Zhu and K. I. Ko. Problem Solving in Automata, Languages, and Complexity. Wiley, Newark, NJ, 2004.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article