Comparative Study of Optimization of data query for SPARQL for Distributed Queries
DOI:
https://doi.org/10.26438/ijcse/v6i9.780785Keywords:
Relational Database, SPARQL, RDF, Basic Graph patternAbstract
Semantic search tool is a user-friendly tool which helps to improve search accuracy by understanding what the user wants to search in the search space on the web or a closed system. But there are large number of challenges for translating the data query to SPARQL for better readability and visual ability. SPARQL is a RDF query language i.e. a semantic query language for database, which is able to retrieve and manipulate data stored in Resource Description Framework(RDF) format. Present work provides the optimum result of running queries over different SPARQL end points. This paper presents the comparative study of different algorithms for optimization and also discusses the two aspects of the result optimization like ranking and readability and it concludes the result for the user data.
References
Jim Rapoza "SPARQL Will Make the Web Shine" eWeek. 2006
Segaran, Toby at al: Programming the Semantic Web. O’Reilly Media, P-84,2009.
P. Hoefler, Linked Data Interfaces for Non-expert Users. In: Cimiano, P., Corcho, O., Presutti, V., Hollink, L., Rudolph, S. (eds.) ESWC vol. 7882, pp. 702–706, 2013.
L. Ding, T. Finin, A. Joshi, R. Pan, R. S. Cost, Y. Peng, P. Reddivari, V.C. Doshi, J. Sachs, Swoogle: A Search and Metadata Engine for the Semantic Web. In: 13th ACMConference on Information and Knowledge Management, Washington D.C. 2004.
G. Tummarello, R. Delbru, E. Oren,Sindice.com:Weaving the open linked data. The Semantic Web, pp:552-565. Springer Berlin Heidelberg, 2007.
M. d'Aquin, M. Sabou, E. Motta, S. Angeletou, L. Gridinoc, V. Lopez and F. Zablith, “What can be done with the Semantic Web? An Overview of Watson-based Applications,” 5th Workshop on Semantic Web Applications and Perspectives, SWAP Rome, Italy, 2008.
Franklin, M.J., Halevy, A.Y., Maier, D.: From databases to dataspaces: A new abstraction for information management. SIGMOD Record 34(4) (December 2005) 27–33.
Prud’hommeaux, E., Seaborne, A.: SPARQL query language for RDF. W3C recommendation (January 2008) Retrieved June 11, 2009, from http://www.w3.org/TR/rdf-sparql-query /.
Steinbrunn M., Moerkotte G., and Kemper A., “Heuristic and Randomized Optimization for the join Ordering Problem” VLDB JOURNAL, vol. 6, no. 3, pp. 191-20, 1997.
Kossmann D. and Stocker K., “Iterative Dynamic Programming: A New Class of Query Optimization Algorithm”, ACM TODS, March 2000.
M. Mitchell, “An Introduction to Genetic Algorithms”, MIT Press, 1998.
J. H. Holland, “Adaptation in natural and artificial Systems”, University of Michigan Press, 1975.
Xiangning Liu, Bharat K. Bhargava, “Data Replication in Distributed Database Systemsover Large Number of Sites”,Computer Science Technical Reports. Paper 1229
X. M. Chandy and J. Misra, "A Distributed Algorithm for Detecting Resource Deadlocks in Distributed Systems " in ACM, 1982.
B. M. M. Alom, F. Henskens, and M. Hannaford, "Deadlock Detection Views of Distributed Database," in International conference on Information Technology & New Generartion (ITNG- 2009) Las Vegas, USA: IEEE Computer Society, 2009.
Parul Tomar, Megha “An Overview of Distributed Databases”, International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 4, Number 2 (2014), pp. 207-214
Maniural B.M et al.,”Query Processing and Optimization in distributed database”,IJCSNS, vol 9,No.9,2009
Bhuyar P.R. “Horizonatal Fragmentation technique in Distributed database”,IJSRP,vol2,issue 5,2012
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
