Abstract
Path query languages have been previously shown to complement RDF rule languages in a natural way and have been used as a means to implement the RDFS derivation rules. RPL is a novel path query language specifically designed to be incorporated with RDF rules and comes in three flavors: Node-, edge- and path-flavored expressions allow to express conditional regular expressions over the nodes, edges, or nodes and edges appearing on paths within RDF graphs. Providing regular string expressions and negation, RPL is more expressive than other RDF path languages that have been proposed. We give a compositional semantics for RPL and show that it can be evaluated efficiently, while several possible extensions of it cannot.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The Lorel query language for semistructured data. International Journal on Digital Libraries 1(1), 68–88 (1997)
Alkhateeba, F., Baget, J.-F., Euzenat, J.: Extending SPARQL with regular expression patterns. Journal of Web Semantics (2009)
Angles, R., Gutierrez, C., Hayes, J.: RDF query languages need support for graph properties. Technical report (2004)
Bry, F., Furche, T., Ley, C., Linse, B.: RDFLog—taming existence - a logic-based query language for RDF (2007)
Bry, F., Furche, T., Ley, C., Linse, B., Marnette, B.: RDFLog: It’s like datalog for RDF. In: Proceedings of 22nd Workshop on (Constraint) Logic Programming, Dresden, September 30 –October 1 (2008)
Bry, F., Furche, T., Linse, B.: Online version, http://www.pms.ifi.lmu.de/mitarbeiter/linse/RPL-full.pdf
Bry, F., Furche, T., Linse, B., Pohl, A.: XcerptRDF: A pattern-based answer to the versatile web challenge. In: Proceedings of 22nd Workshop on (Constraint) Logic Programming, Dresden, Germany, September 30 –October 1, pp. 27–36 (2008)
Bry, F., Furche, T., Ley, C., Linse, B., Marnette, B., Poppe, O.: SPARQLog: SPARQL with rules and quantification. In: Virgilio, R.D., Giunchiglia, F., Tanca, L. (eds.) Semantic Web Information Management: A Model-based Perspective, ch. 12. Springer, Heidelberg (2009)
Fortune, S., Hopcroft, J.E., Wyllie, J.C.: The Directed Subgraph Homeomorphism Problem (1978)
Kochut, K., Janik, M.: SPARQLeR: Extended SPARQL for semantic association discovery. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 145–159. Springer, Heidelberg (2007)
La Paugh, A., Papadimitrou, C.: The even-path problem for graphs and digraphs. Networks 14(4), 507–513 (1984)
Marx, M.: Conditional XPath. ACM Transactions on Database Systems (TODS) 30(4), 929–959 (2005)
Mendelzon, A.O., Wood, P.T.: Finding Regular Simple Paths in Graph Databases. SIAM Journal on Computing 24, 1235 (1995)
Ogbuji, C.: Versa: Path-based RDF query language (2005)
Pérez, J., Arenas, M., Gutierrez, C.: nSPARQL: A navigational language for RDF. In: Sheth, A.P., Staab, S., Dean, M., Paolucci, M., Maynard, D., Finin, T., Thirunarayan, K. (eds.) ISWC 2008. LNCS, vol. 5318, pp. 66–81. Springer, Heidelberg (2008)
Pohl, A.: RDF Querying in Xcerpt: Language Constructs and Implementation. Deliverable I4-Dx2, REWERSE (2008)
Polleres, A.: From SPARQL to rules (and back). In: Williamson, C.L., Zurko, M.E., Patel-Schneider, P.F., Shenoy, P.J. (eds.) WWW, pp. 787–796. ACM, New York (2007)
Schenk, S., Staab, S.: Networked graphs: A declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the Web. In: Proceedings of the 17th International World Wide Web Conference, Bejing, China (April 2008)
Seaborne, A., Prud’hommeaux, E.: SPARQL query language for RDF. W3C recommendation, W3C (January 2008), http://www.w3.org/TR/2008/REC-rdf-sparql-query-20080115/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bry, F., Furche, T., Linse, B. (2009). The Perfect Match: RPL and RDF Rule Languages. In: Polleres, A., Swift, T. (eds) Web Reasoning and Rule Systems. RR 2009. Lecture Notes in Computer Science, vol 5837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05082-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-05082-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05081-7
Online ISBN: 978-3-642-05082-4
eBook Packages: Computer ScienceComputer Science (R0)