RDF Keyword Search Query Processing via Tensor Calculus
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.
KeywordsTensorial Representation Indexing Scheme Query Execution Hadamard Product Database Graph
Unable to display preview. Download preview PDF.
- 1.Bondy, A., Murty, U.S.R.: Graph Theory. Springer (2010)Google Scholar
- 2.Davis, T.A.: Direct Methods for Sparse Linear Systems. SIAM (2006)Google Scholar
- 4.He, H., Wang, H., Yang, J., Yu, P.S.: Blinks: ranked keyword searches on graphs. In: SIGMOD, pp. 305–316 (2007)Google Scholar
- 5.Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: ICDE (2008)Google Scholar
- 6.Tran, T., Wang, H., Rudolph, S., Cimiano, P.: Top-k exploration of query candidates for efficient keyword search on graph-shaped (rdf) data. In: ICDE, pp. 405–416 (2009)Google Scholar
- 7.Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)Google Scholar