Scalable multi-query optimization for SPARQL

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2012, Pages 666-677

  Le, Wangchao ^a   Kementsietsidis, Anastasios ^b   Duan, Songyun ^b   Li, Feifei ^a  

^a University of Utah   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL PROBLEMS; COST MODELS; ESSENTIAL COMPONENT; EXPERIMENTAL STUDIES; GRAPH QUERIES; MULTIQUERY OPTIMIZATION; NP-HARDNESS; OPTIMIZATION TECHNIQUES; QUERY ENGINES; RDF STORES; SEMI STRUCTURED DATA; SUB-STRUCTURES;

HEURISTIC ALGORITHMS; QUERY PROCESSING;

OPTIMIZATION;

EID: 84864245894     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2012.37     Document Type: Conference Paper

References (42)

1. D. J. Abadi, A. Marcus, S. R. Madden, and K. Hollenbach. Scalable semantic web data management using vertical partitioning. In VLDB, 2007.
2. R. Angles and C. Gutierrez. The expressive power of SPARQL. In ISWC, 2008.
3. M. Atre, V. Chaoji, M. J. Zaki, and J. A. Hendler. Matrix "bit" loaded: A scalable lightweight join query processor for RDF data. In WWW, 2010.
4. N. Biggs, E. Lloyd, and R. Wilson. Graph Theory. Oxford University Press, 1986.
5. C. Bizer and A. Schultz. The berlin SPARQL benchmark. International Journal On Semantic Web and Information Systems, 2009.
6. N. Bruno, L. Gravano, N. Koudas, and D. Srivastava. Navigation- vs. index-based XML multi-query processing. In ICDE, 2003.
7. N. N. Dalvi, S. K. Sanghai, P. Roy, and S. Sudarshan. Pipelining in multi-query optimization. In PODS, 2001.
8. A. A. Diwan, S. Sudarshan, and D. Thomas. Scheduling and caching in multi-query optimization. In COMAD, 2006.
9. S. Duan, A. Kementsietsidis, K. Srinivas, and O. Udrea. Apples and oranges: a comparison of RDF benchmarks and real RDF datasets. In SIGMOD, 2011.
10. S. Finkelstein. Common expression analysis in database applications. In SIGMOD, 1982.
11. Y. Guo, Z. Pan, and J. Heflin. LUBM: A benchmark for OWL knowledge base systems. Journal of Web Semantics, 2005.
12. M. Hong, A. J. Demers, J. Gehrke, C. Koch, M. Riedewald, and W. M. White. Massively multi-query join processing in publish/subscribe systems. In SIGMOD, 2007.
13. G. Ianni, T. Krennwallner, R. Martello, and A. Polleres. Dynamic querying of mass-storage RDF data with rule-based entailment regimes. In ISWC, 2009.
14. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Comput. Surv., 1999.
15. A. Kementsietsidis, F. Neven, D. V. de Craen, and S. Vansummeren. Scalable multi-query optimization for exploratory queries over federated scientific databases. PVLDB, 2008.
16. I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science, 2001.
17. W. Le, S. Duan, A. Kementsieditis, F. Li, and M. Wang. Rewriting queries on SPARQL views. In WWW, 2011.
18. T. Neumann and G. Weikum. RDF-3X: a RISC-style engine for RDF. In PVLDB, 2008.
19. T. Neumann and G. Weikum. Scalable join processing on very large RDF graphs. In SIGMOD, 2009.
20. K. O'Gorman, D. Agrawal, and A. E. Abbadi. Multiple query optimization by cache-aware middleware using query teamwork. In ICDE, 2002.
21. P. R. Östergård. A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, pages 195-205, 2002.
22. J. Park and A. Segev. Using common subexpressions to optimize multiple queries. In ICDE, 1988.
23. A. Polleres. From SPARQL to rules (and back). In WWW, 2007.
24. N. Preda, F. M. Suchanek, G. Kasneci, T. Neumann, W. Yuan, and G. Weikum. Active knowledge : Dynamically enriching RDF knowledge bases by web services. In SIGMOD, 2010.
25. J. W. Raymond and P. Willett. Maximum common subgraph isomorphism algorithms for the matching of chemical structures. Journal of Computer-Aided Molecular Design, 16:521-533, 2002.
26. Resource Description Framework. http://www.w3.org/RDF/.
27. P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobe. Efficient and extensible algorithms for multi query optimization. In SIGMOD, 2000.
28. M. Schmidt, T. Hornung, G. Lausen, and C. Pinkel. SP2Bench: A SPARQL performance benchmark. ICDE, 2009.
29. M. Schmidt, M. Meier, and G. Lausen. Foundations of SPARQL query optimization. In ICDT, 2010.
30. T. Sellis and S. Ghosh. On the multiple-query optimization problem. IEEE Trans. Knowl. Data Eng., 2(2):262-266, 1990.
31. T. K. Sellis. Multiple-query optimization. ACM Trans. Database Syst., 13(1):23-52, 1988.
32. K. Shim, T. K. Sellis, and D. Nau. Improvements on a heuristic algorithm for multiple-query optimization. Data and Knowledge Engineering, 12(2):197-222, 1994.
33. M. Stocker, A. Seaborne, and A. Bernstein. SPARQL basic graph pattern optimization using selectivity estimation. In WWW, 2008.
34. The TPC Benchmarks. http://www.tpc.org/.
35. E. Tomita and T. Seki. An efficient branch-and-bound algorithm for finding a maximum clique. Discrete Mathematics and Theoretical Computer Science, LNCS, 2003.
36. N. Trigoni, Y. Yao, A. J. Demers, J. Gehrke, and R. Rajaraman. Multi-query optimization for sensor networks. In Distributed Computing in Sensor Systems (DCOSS), LNCS.
37. P. Vismara and B. Valery. Finding maximum common connected subgraphs using clique detection or constraint satisfaction algorithms. Modelling, Computation and Optimization in Information Systems and Management Sciences, pages 358-368, 2008.
38. W3C Wiki for Currently Alive SPARQL Endpoints. http://www.w3.org/wiki/ SparqlEndpoints.
39. C. Weiss, P. Karras, and A. Bernstein. Hexastore: sextuple indexing for semantic web data management. PVLDB, 2008.
40. H. Z. Yang and P. Larson. Query transformation for PSJ-queries. PVLDB, 1987.
41. P. Zhao and J. Han. On graph query optimization in large networks. In PVLDB, 2010.
42. Y. Zhao, P. Deshpande, J. F. Naughton, and A. Shukla. Simultaneous optimization and evaluation of multiple dimensional queries. In SIGMOD, 1998.