Abstract
Subgraph matching, a basic SPARQL operation, is known to be NP-complete. Coupled with the rapidly increasing volumes of RDF data, it makes efficient graph query processing a very challenging problem. In this paper, we tackle the important problem of efficient processing of star-shaped subgraph matching queries, which are a core SPARQL query pattern and usually lead to a number of costly join operations. We present a novel method to encode a star-shaped subgraph into a bit string and an indexing mechanism to improve the query answering performance, called FFD-index. Our extensive evaluation shows that FFD-index and the corresponding algorithms are effective in solving star-shaped graph queries and they significantly outperform the state-of-the-art SPARQL query engine RDF-3X.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. Proc. VLDB Endow. 1(1), 647–659 (2008)
Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman Co., San Francisco (1979)
Kim, H., Ravindra, P., Anyanwu, K.: From SPARQL to mapreduce: the journey using a nested triplegroup algebra. Proc. VLDB Endow. 4(12), 1426–1429 (2011)
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)
Acknowledgement
This work is supported by the National Natural Science Foundation of China (61100049), the National High-tech R&D Program of China (863 Program) (2013AA013204), CCF Opening Project of Chinese Information Processing (CCF2013-02-02), and the 3rd Baidu Subject Research Project.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Lyu, X., Wang, X., Li, YF., Feng, Z. (2015). FFD-Index: An Efficient Indexing Scheme for Star Subgraph Matching on Large RDF Graphs. In: Liu, A., Ishikawa, Y., Qian, T., Nutanong, S., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9052. Springer, Cham. https://doi.org/10.1007/978-3-319-22324-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-22324-7_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22323-0
Online ISBN: 978-3-319-22324-7
eBook Packages: Computer ScienceComputer Science (R0)