Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database Systems for Advanced Applications

DASFAA 2015: Database Systems for Advanced Applications pp 240–245Cite as

FFD-Index: An Efficient Indexing Scheme for Star Subgraph Matching on Large RDF Graphs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9052))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Notes

  1. 1.

    http://swat.cse.lehigh.edu/projects/lubm/.

  2. 2.

    http://www.mpi-inf.mpg.de/departments/databases-and-information-systems/research/yago-naga/yago/archive/.

References

  1. Neumann, T., Weikum, G.: RDF-3X: a RISC-style engine for RDF. Proc. VLDB Endow. 1(1), 647–659 (2008)

    Article  Google Scholar 

  2. Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman Co., San Francisco (1979)

    MATH  Google Scholar 

  3. 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)

    Google Scholar 

  4. 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)

    Article  Google Scholar 

Download references

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

  1. School of Computer Science and Technology, Tianjin University, Tianjin, China

    Xuedong Lyu, Xin Wang & Zhiyong Feng

  2. Faculty of Information Technology, Monash University, Clayton, VIC, 3800, Australia

    Yuan-Fang Li

Authors
  1. Xuedong Lyu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuan-Fang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhiyong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xin Wang .

Editor information

Editors and Affiliations

  1. Soochow University, Suzhou, China

    An Liu

  2. Nagoya University, Nagoya, Japan

    Yoshiharu Ishikawa

  3. Wuhan University, Wuhan, China

    Tieyun Qian

  4. University of Hong Kong, Hong Kong, China

    Sarana Nutanong

  5. Monash University, Clayton, Victoria, Australia

    Muhammad Aamir Cheema

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation