Skip to main content
SpringerLink
Log in

Evaluation of RDF queries via equivalence

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Performance and scalability are two issues that are becoming increasingly pressing as the resource description framework (RDF) datamodel is applied to real-world applications. Because neither vertical nor flat structures of RDF storage can handle frequent schema updates and meanwhile avoid possible long-chain joins, there is no clear winner between the two typical structures. In this paper, we propose an alternative open user schema. The open user schema consists of flat tables automatically extracted from RDF query streams. A query is divided into two parts and conquered on the flat tables in the open user schema and on the vertical table stored in a backend storage. At the core of this divide and conquer architecture with open user schema, an efficient isomorphic decision algorithm is introduced to guide a query to related flat tables in the open user schema. Our proposal in essence departs from existing methods in that it can accommodate schema updates without possible long-chain joins. We implement our approach and provide empirical evaluations to demonstrate both the efficiency and effectiveness of our approach in evaluating complex RDF queries.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. De Virgilio R, Giunchiglia F, Tanca L. Semantic Web Information Management. Heildelberg: Springer, 2010

    Book  MATH  Google Scholar 

  2. Abadi D J, Marcus A, Madden S R, Hollenbach K. Sw-store: a vertically partitioned dbms for semantic web data management. The VLDB Journal, 2009, 18(2): 385–406

    Article  Google Scholar 

  3. Arenas M, Gutierrez C, Pérez J. Foundations of RDF Databases. LNCS, 2009, 5689: 158–204

    Google Scholar 

  4. Neumann T, Weikum G. Rdf-3x: a risc-style engine for RDF. Proceedings of the VLDB Endowment, 2008, 1(1): 647–659

    Google Scholar 

  5. Weiss C, Karras P, Bernstein A. Hexastore: sextuple indexing for semantic web data management. Proceedings of the VLDB Endowment, 2008, 1(1): 1008–1019

    Google Scholar 

  6. Neumann T, Weikum G. Scalable join processing on very large RDF graphs. In: Proceedings of the SIGMOD’ 09. 2009, 627–640

    Chapter  Google Scholar 

  7. Neumann T, Weikum G. The RDF-3x engine for scalable management of RDF data. The VLDB Journal, 2010, 19(1): 91–113

    Article  Google Scholar 

  8. Chong E I, Das S, Eadon G, Srinivasan J. An efficient SQL-based RDF querying scheme. In: Proceedings of the VLDB’ 05. 2005, 1216–1227

    Google Scholar 

  9. Wilkinson K, Sayers C, Kuno H A, Reynolds D. Efficient RDF storage and retrieval in Jena2. In: Proceedings of the SWDB. 2003, 131–150

    Google Scholar 

  10. Chong Z, Qi G, Shu H, Bao J, Ni W, Zhou A. Open user schema guided evaluation of streaming RDF queries. In: Proceedings of the CIKM. 2010, 1281–1284

    Google Scholar 

  11. Manku G S, Motwani R. Approximate frequency counts over data streams. In: Proceedings of the VLDB’02. 2002, 346–357

    Google Scholar 

  12. Yu J X, Chong Z, Lu H, Zhou A. False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proceedings of the VLDB’04. 2004, 204–215

    Google Scholar 

  13. Chaudhuri S, Krishnamurthy R, Potamianos S, Shim K. Optimizing queries with materialized views. In: Proceedings of the ICDE’ 95. 1995, 190–200

    Google Scholar 

  14. Fletcher G H, Beck PW. Scalable indexing of RDF graphs for efficient join processing. In: Proceedings of the CIKM’09. 2009, 1513–1516

    Google Scholar 

  15. Chen Y, Ou J, Jiang Y, Meng X. Hstar-a semantic repository for large scale owl documents. In: Proceedings of the ASWC. 2006, 415–428

    Google Scholar 

  16. Ma L, Wang C, Lu J, Cao F, Pan Y, Yu Y. Effective and efficient semantic web data management over DB2. In: Proceedings of the SIGMOD’ 08. 2008, 1183–1194

    Chapter  Google Scholar 

  17. Matono A, Amagasa T, Yoshikawa M, Uemura S. A path-based relational RDF database. In: Proceedings of the ADC’05. 2005, 95–103

    Google Scholar 

  18. Battre D. Caching of intermediate results in DHT-based RDF stores. International Journal of Metadata, Semantics and Ontologies, 2008, 3(1): 84–93

    Article  Google Scholar 

  19. Yan Y, Wang C, Zhou A, Qian W, Ma L, Pan Y. Efficient indices using graph partitioning in RDF triple stores. In: Proceedings of the ICDE’09. 2009, 1263–1266

    Google Scholar 

  20. Finkelstein S. Common expression analysis in database applications. In: Proceedings of the SIGMOD’82. 1982, 235–245

    Google Scholar 

  21. Papadomanolakis S, Ailamaki A. Autopart: automating schema design for large scientific databases using data partitioning. In: Proceedings of the SSDBM’04. 2004, 383

    Google Scholar 

  22. Chaudhuri S, Narasayya V. Self-tuning database systems: a decade of progress. In: Proceedings of the VLDB’07. 2007, 3–14

    Google Scholar 

  23. Godfrey P, Gryz J, Hoppe A, Ma W, Zuzarte C. Query rewrites with views for XML in DB2. In: Proceedings of the ICDE’09. 2009, 1339–1350

    Google Scholar 

  24. Chen D, Chan C Y. Viewjoin: efficient view-based evaluation of tree pattern queries. In: Proceedings of the ICDE. 2010, 816–827

    Google Scholar 

  25. Goh S T, Ooi B C, Tan K L. Demand-driven caching in multiuser environment. IEEE Transactions on Knowledge and Data Engineering, 2004, 16(1): 112–124

    Article  Google Scholar 

  26. Sidirourgos L, Goncalves R, Kersten M, Nes N, Manegold S. Columnstore support for RDF data management: not all swans are white. Proceedings VLDB Endowment, 2008, 1(2): 1553–1563

    Google Scholar 

  27. Wikipedia. Graph isomorphism problem, http://en.wikipedia.org/wiki/graph_isomorphism_problem

  28. Hoel E G, Samet H. A qualitative comparison study of data structures for large line segment databases. In: Proceedings of the SIGMOD’92. 1992, 205–214

    Google Scholar 

  29. Hellerstein J M, Koutsoupias E, Papadimitriou C H. On the analysis of indexing schemes. In: Proceedings of the PODS’97. 1997, 249–256

    Google Scholar 

  30. Stonebraker M, Abadi D J, Batkin A, Chen X, Cherniack M, Ferreira M, Lau E, Lin A, Madden S, O’Neil E, O’Neil P, Rasin A, Tran N, Zdonik S. C-store: a column-oriented DBMS. In: Proceedings of the VLDB’05. 2005, 553–564

    Google Scholar 

  31. Kleinberg J. Algorithm Design. Person Education Inc., 2006

    Google Scholar 

  32. Yang G. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceedings of the KDD’04. 2004, 344–353

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Southeast University, Nanjing, 210096, China

    Weiwei Ni, Zhihong Chong, Hu Shu & Jiajia Bao

  2. Software School, East China Normal University, Shanghai, 200062, China

    Aoying Zhou

Authors
  1. Weiwei Ni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhihong Chong
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hu Shu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiajia Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Aoying Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhihong Chong.

Additional information

Weiwei Ni received his PhD in computer applications from Southeast University, Nanjing, China in 2005. He is now an associate professor of Southeast University and a member of the China Computer Federation. His research interests include data management and data mining.

Zhihong Chong received his PhD in Computer Software from Fudan University, Shanghai, China in 2006. He is now an associate professor of Southeast University. His research interests include data management and analysis.

Hu Shu is now a Master student of Southeast University. His research interests include graph data management and data mining.

Jiajia Bao is now a Master student of Southeast University. Her research interests include graph data management and data mining.

Aoying Zhou received his PhD from Fudan University, Shanghai, China in 1993. He is now a professor of East China Normal University. He is the winner of the National Science Fund for Distinguished Young Scholars supported by NSFC and the professorship appointment under Cheung Kong Scholars Program sponsored jointly by MoE and Li Ka Shing Foundation. His research interests include data management, data mining and data streams, and P2P computing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ni, W., Chong, Z., Shu, H. et al. Evaluation of RDF queries via equivalence. Front. Comput. Sci. 7, 20–33 (2013). https://doi.org/10.1007/s11704-012-1208-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-012-1208-x

Keywords

Search

Navigation