Keyword-based search over (semi)structured data is considered today an essential feature of modern information management systems and has become an hot area in database research and development. Answers to queries are generally sub-structures of a graph, containing one or more keywords. While finding the nodes matching keywords is relatively easy, determining the connections between such nodes is a complex problem requiring on-the-fly time consuming graph exploration. Current techniques suffer from poorly performing worst case scenario or from indexing schemes that provide little support to the discovery of connections between nodes. In this paper we propose an indexing scheme for RDF graphs based on the first principles of linear algebra, in particular on tensorial calculus. Leveraging our abstract algebraic framework, our technique allows to expedite the retrieval of the sub-structures representing the query results. © 2012 Springer-Verlag.
CITATION STYLE
De Virgilio, R. (2012). RDF keyword search query processing via tensor calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7566 LNCS, pp. 780–788). https://doi.org/10.1007/978-3-642-33615-7_22
Mendeley helps you to discover research relevant for your work.