Design and implementation Framework of Energy Efficient and Scalable RDF data Query Processing to Multi Server Query Processor (MSQP) in ELearnAPP
Keywords:
Ranking, Review, Rating, Android Market, Search Rank Fraud, Malware DetectionAbstract
E-learning is learning new things through the use of technologies. It is growing at a rapid pace. Today more organizations are taking up e-learning. While e-learning technology developed extensively since its origin, there are numerous issues that experts find when come to executing e-learning Planning. One of the fundamental issues is the complexity of integrating these systems with content and with different type of business systems. RDF is a data model for representing labeled directed graphs, and it is an important building block of semantic web. Due to its flexibility and relevance, RDF has been utilized as a piece of e-learning. In these applications, large-scale graph datasets are extremely normal. Notwithstanding, existing techniques are not effectively managing them. We introduce a query processing system using Parallel Web Server, it consists of two noteworthy modules (1) The Master node and (2) Worker Nodes. The Master node investigates and analyzes the RDF data and places parts of data over multiple servers. The Worker Nodes parses the user query and distributes sub queries to cluster nodes. Also, the results of sub queries from various servers are gathered (and re-evaluated if necessary) and delivered to the user. Parallel Web Server goes for process queries by their deadlines, and preferred advantage high-level scheduling data to reduce the CPU energy consumption of a query-processing node. MSQP construct its decision on query efficiency predictors, estimating the processing volume and preparing time of a query. In e-learning ecosystem can assist organizations to achieve the advantages of an integrated approach to develop e-learning systems. It can be utilized for building a virtual environment for both educating and learning.
References
- J. Huang, D. Abadi, and K. Ren. Scalable SPARQL querying of large RDF graphs. In VLDB, pages 1123–1134. ACM, 2011.
- D. Kossmann. The state of the art in distributed query processing. ACM Comput. Surv., 32(4):422–469, 2000.
- G. Ladwig and T. Tran. Linked data query processing strategies. In ISWC, pages 453–469. Springer, 2010.
- A. Langegger, W. W¨oß, and M. Bl¨ochl. A semantic web middleware for virtual data integration on the web. In ESWC, pages 493–507. Springer, 2008.
- S. T. Leutenegger, J. M. Edgington, and M. A. Lopez. STR: A simple and efficient algorithm for R-Tree packing. In ICDE, pages 497–506. IEEE Computer Society, 1997.
- Y. Li and J. Heflin. Using reformulation trees to optimize queries over distributed heterogeneous sources. In ISWC, pages 502–517. Springer, 2010.
- T. Neumann and G. Moerkotte. Characteristic sets: Accurate cardinality estimation for RDF queries with multiple joins. In ICDE, pages 984–994. IEEE Computer Society, 2011.
- T. Neumann and G. Weikum. The RDF-3X engine for scalable management of RDF data. VLDB J., 19(1):91–113, 2010.
- B. Quilitz and U. Leser. Querying distributed RDF data sources with SPARQL. In ESWC, pages 524–538. Springer, 2008.
- K. Stocker, D. Kossmann, R. Braumandl, and A. Kemper. Integrating semi-join-reducers into state of the art query processors. In ICDE, pages 575–584. IEEE Computer Society, 2001.
- China IDC, 2012. Data center power will double in the next five years. Online]. Available:〈http://tech.idcquan.com/pro/34910.shtml〉 .(accessed 2016).
- Do, J., Kee, Y.S., Patel, J.M., et al., 2013. Query processing on smart SSDs: opportunities and challenges. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. ACM: New York. pp. 1221–1230.
- Dokeroglu, T., Bayir, M.A., Cosar, A., 2015. Robust heuristic algorithms for exploiting the common tasks of relational cloud database queries. Appl. Soft Comput. 30 (C), 72–82.
- Global action plan, 2007. An inefficient truth. Global action plan report. Online]. Available: http://www.global action plan.org.uk/〉.(accessed 2016).
- Graefe, G., 2008. Database servers tailored to improve energy efficiency. In: Proceedings of the 2008 EDBT workshop on Software engineering for tailor-made data management. New York: ACM. pp. 24–28.
- D. Meisner, C. M. Sadler, L. A. Barroso, W.-D. Weber, and T. F. Wenisch, "Power management of online data-intensive services," in Proc. ISCA, 2011, pp. 319–330.
- C. D. Manning, P. Raghavan, and H. Sch¨utze, Introduction to Information Retrieval. Cambridge University Press, 2008.
- M. Catena, C. Macdonald, and I. Ounis, "On inverted list compression for search engine efficiency," in Proc. ECIR, 2014, pp. 359–371.
- J. Dean, "Challenges in building large-scale information retrieval systems: Invited talk," in Proc. WSDM, 2009.
- S. Robertson and H. Zaragoza, "The Probabilistic Relevance Framework: BM25 and Beyond," Found. Trends Inf. Retr., vol. 3, no. 4, pp. 333–389, Apr. 2009.
The Rubik's Cube solver runs in your web browser and it finds easily the solution for your puzzle.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRCSEIT
This work is licensed under a Creative Commons Attribution 4.0 International License.