Information graph-based creation of parallel queries for databases
Abstract
The article describes the query parallelisation method that takes into account the dependencies between operations in the data query. The method is based on the representation of the query as a directed graph with vertices as operations and edges as data connections. The graph is processed as an adjacency list, saving more memory than during processing a sparse adjacency matrix. The graph is modified only by operations, which do not change the elements of the adjacency list. Therefore it is possible to achieve intra-query parallelism by consideration of a request structure and implementation of mathematical methods of parallel calculations for its equivalent transformation. This article also presents an example of complex query parallelisation and describes applicability of the graph theory and methods of parallel computing both for query parallelisation and optimisation.
References
[1]
Akal, F., Böhm, K. and Schek, H-J. (2002) 'OLAP query evaluation in a database cluster: a performance study on intra-query parallelism, East-European Conf. on Advances in Databases and Information Systems (ADBIS), Bratislava, Slovakia, 2002.
[2]
Akl, S. (1989) The Design and Analysis of Parallel Algorithms, Prentice-Hall, Englewood Cliffs, New Jersey.
[3]
Arvindam, S., Kumar, V. and Rao, V. (1989) 'Floorplan optimization on multiprocessors', Proc. 1989 Intl Conf. on Computer Design, IEEE Computer Society, pp.109-113.
[4]
Chen, H. (2006) 'MPIPP: an automatic profileguided parallel process placement toolset for SMP clusters and multiclusters, Proceedings of the 20th Annual International Conference on Super-Computing, pp.353-360.
[5]
Chen, M-S., Yu, P.S. and Wu, K-L. (1996) 'Optimization of parallel execution for multijoin queries', IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 3, pp.416-428.
[6]
Chen, Y., Dehne, F., Eavis, T. and Rau-Chaplin, A. (2004) 'Parallel ROLAP data cube construction on shared-nothing multiprocessors', Distributed and Parallel Databases, May, Vol. 15, No. 3, pp.219-236.
[7]
DeWitt, D.J. and Gray, J. (1992) 'Parallel database systems: the future of high performance database systems', Commun. ACM, Vol. 35, No. 6, pp.85-98.
[8]
Drake, D.E. and Hougardy, S. (2005) 'A linear-time approximation algorithm for weighted matchings in graphs', ACM Transactions on Algorithms, Vol. 1, No. 1, pp.107-122.
[9]
Feng, L., Li, Q. and Wong, A. (2001) 'Mining inter-transactional association rules: generalization and empirical evaluation', Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery, Springer-Verlag London, UK, ISBN:3-540-42553-5, pp.31-40.
[10]
http://servernews.ru/tags/gather (accessed 15 March 2017).
[11]
https://eden.dei.uc.pt/~pnf/publications/Furtado_survey.pdf (accessed 15 March 2017).
[12]
Jackson, D. (2001) 'Core algorithms of the Maui scheduler', in Jackson, D., Snell, Q. and Clement, M. (Eds.): Lecture Notes in Computer Science, Vol. 2221, pp.87-102.
[13]
Jordan, H.F. and Alaghband, F. (2003) Fundamentals of Parallel Processing, 07452, c.578, Pearson Education, Inc., Upper Saddle River, NJ.
[14]
Kupriyanov, M.S. and Shichkina, Y.A. (2016) 'Applying the list method to the transformation of parallel algorithms into account temporal characteristics of operations', Proceedings of the 19th International Conference on Soft Computing and Measurements, SCM 2016, 7519759, pp.292-295, ISBN: 978-146738919-8,
[15]
Kupriyanov, M.S., Shichkina, J.A. and Al-Mardi, M. (2016) 'Optimization algorithm for an information graph for an amount of communications', Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 9870, pp.50-62, ISSN: 03029743, ISBN: 978-331946300-1,
[16]
Park, C-W. and Chung, C-W. (2002) 'An effective query pruning technique for multiple regular path expressions', Journal of Systems and Software, Vol. 64, No. 3, pp.219-233.
[17]
Rauber, N. and Runger, G. (2010) Parallel Programming: for Multicore and Cluster Systems, 450p, Springer, Verlag Berlin Heidelberg.
[18]
Sanjay, A., Narasayya, V.R. and Yang, B. (2004) 'Integrating vertical and horizontal partitioning into automated physical database design', Proceedings of the ACM SIGMOD International Conference on Management of Data, June, pp.359-370.
[19]
Valduriez, P. (1993) 'Parallel database systems: open problems and new issues', Distributed and Parallel Databases, April, Vol. 1, No. 2, pp.137-165.
[20]
Wilkinson, B. and Allen, M. (2005) Parallel Programming Techniques and Applications Using Networked Workstations and Parallel Computers, p.468, Pearson Education, Saddle River.
Index Terms
- Information graph-based creation of parallel queries for databases
Recommendations
Answering "Why Empty?" and "Why So Many?" queries in graph databases
Graph databases provide schema-flexible storage and support complex, expressive queries. However, the flexibility and expressiveness in these queries come at additional costs: queries can result in unexpected empty answers or too many answers, which are ...
Regular Queries on Graph Databases
Graph databases are currently one of the most popular paradigms for storing data. One of the key conceptual differences between graph and relational databases is the focus on navigational queries that ask whether some nodes are connected by paths ...
Using semijoin programs to solve traversal queries in graph databases
GRADES'14: Proceedings of Workshop on GRAph Data management Experiences and SystemsGraph data processing is gaining popularity and new solutions are appearing to analyze graphs efficiently. In this paper, we present the prototype for the new query engine of the Sparksee graph database, which is based on an algebra of operations on ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Inderscience Publishers
Geneva 15, Switzerland
Publication History
Published: 01 January 2018
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in