Istraživanja u području grafovskih baza podataka
Svezak 4 Br. 2 (2020), Članci časopisa
Svezak 4 Br. 2 (2020)

Istraživanja u području grafovskih baza podataka

Članci časopisa
https://doi.org/10.36978/cte.4.2.5
Objavljeno 2020-12-22
Kornelije Rabuzin
Sveučilište u Zagrebu, Fakultet organizacije i informatike Varaždin
https://orcid.org/0000-0002-0247-669X
Robert Kudelić
Sveučilište u Zagrebu, Fakultet organizacije i informatike Varaždin
PDF

Ključne riječi

graph databases
Neo4j
integrity constraints
inheritance
Cypher
Gremlin grafovske baze podataka
Neo4j
integritetna ograničenja
nasljeđivanje
Cypher
Gremlin

Kako citirati

Rabuzin, K., & Kudelić, R. (2020). Istraživanja u području grafovskih baza podataka. Politehnika, 4(2), 47-54. https://doi.org/10.36978/cte.4.2.5
ACM ACS APA ABNT Chicago Harvard IEEE MLA Turabian Vancouver

Preuzmi citat

Endnote/Zotero/Mendeley (RIS) BibTeX

Sažetak

Kako smo unatrag nekoliko godina dobili određena sredstva (tzv. sveučilišne potpore) kojima smo istraživali određene aspekte grafovskih baza podataka, odlučili smo rezultate istraživanja predstaviti i hrvatskoj akademskoj i stručnoj zajednici. Smatramo kako su istraživanja bila kvalitetna i da rezultati istih imaju potencijal za širu primjenu i implementaciju u dostupnim sustavima za upravljanje grafovskim bazama podataka. Također, postoje i određene mogućnosti za proširenje implementiranih rješenja, kao i prostor za dodatna istraživanja i preslikavanja relacijskih u koncepte grafovskih baza podataka.
https://doi.org/10.36978/cte.4.2.5
PDF

Reference

Bayerl, S., & Granitzer, M. (2017). Discovering, Ranking and Merging RDF Data Cubes. In Proceedings - IEEE 11th International Conference on Semantic Computing, ICSC 2017. https://doi.org/10.1109/ICSC.2017.56

Chen, J., Song, Q., Zhao, C., & Li, Z. (2020). Graph Database and Relational Database Performance Comparison on a Transportation Network. In Communications in Computer and Information Science (Vol. 1244 CCIS, 407–418). Springer. https://doi.org/10.1007/978-981-15-6634-9_37

de Oliveira, A. T., de Souza, A. D., Moreira, E. M., & Seraphim, E. (2020). Mapping and Conversion between Relational and Graph Databases Models: A Systematic Literature Review. In Advances in Intelligent Systems and Computing (Vol. 1134, 539–543). Springer. https://doi.org/10.1007/978-3-030-43020-7_71

Jeon, S., Khosiawan, Y., & Hong, B. (2013). Making a Graph Database from Unstructured Text. In Chen, J and Cuzzocrea, A and Yang, LT (Ed.), 2013 IEEE 16th Iternational Conference on Computational science and Engineering (CSE 2013) (981–988). https://doi.org/10.1109/CSE.2013.144

Kaliyar, R. K. (2015). Graph Databases: A Survey. In Swaroop, A and Sharma, V (Ed.), International Conference on Computing, Communication & Automation (ICCCA) (785–790).

Kudelić, R. (2016). Monte-Carlo randomized algorithm for minimal feedback arc set. Applied Soft Computing Journal, 41, 235–246. https://doi.org/10.1016/j.asoc.2015.12.018

Kudelić, R., & Ivković, N. (2019). Ant inspired Monte Carlo algorithm for minimum feedback arc set. Expert Systems with Applications, 122, 108–117. https://doi.org/10.1016/j.eswa.2018.12.021

Maleković, M., Rabuzin, K., & Šestak, M. (2016). Graph Databases-are they really so new. International Journal of Advances In Science Engineering and Technology. Retrieved from http://bib.irb.hr/prikazi-rad?rad=843723

Rabuzin, K, Konecki, M., & Šestak, M. (2016). Implementing CHECK Integrity Constraint in Graph Databases. Proceedings of the 82nd IIER International Conference. Retrieved from http://bib.irb.hr/prikazi-rad?rad=836861

Rabuzin, K, Maleković, M., & Šestak, M. (2016). Gremlin By Example. International Conference on Advances in Big Data Analytics, 144–149.

Rabuzin, Kornelije, Konecki, M., & Šestak, M. (2016). Implementing CHECK Integrity Constraint in Graph Databases. In IIER 105th International Conference on Recent Innovations in Engineering and Technology (19–22). Berlin, Germany.

Rabuzin, Kornelije, & Sestak, M. (2018). Towards inheritance in graph databases. In 2018 International Conference on Information Management and Processing, ICIMP 2018 (Vol. 2018, 115–119). https://doi.org/10.1109/ICIMP1.2018.8325851

Rabuzin, Kornelije, & Šestak, M. (2019). Creating triggers with trigger-by-example in graph databases. In DATA 2019 - Proceedings of the 8th International Conference on Data Science, Technology and Applications (137–144). https://doi.org/10.5220/0007829601370144

Rabuzin, Kornelije, Šestak, M., & Konecki, M. (2016). Implementing UNIQUE Integrity Constraint in Graph Databases. In The Eleventh International Multi-Conference on Computing in the Global Information Technology (48–53).

Reutter, J. L., Romero, M., & Vardi, M. Y. (2017). Regular Queries on Graph Databases. Theory of computing Systems 61(1), 31–83. https://doi.org/10.1007/s00224-016-9676-2

Robinson, I., Webber, J., & Eifrem, E. (2013). Graph Databases. Information Management. https://doi.org/http://dx.doi.org/10.1016/B978-0-12-407192-6.00003-0

Šestak, M., Rabuzin, K., & Konecki, M. (2016). Indexing in relational and graph databases as a mean of dealing with increasing amount of business data. International Conference on Management, Business and Marketing, 181-185.

Sestak, M., Rabuzin, K., & Novak, M. (2016). Integrity constraints in graph databases-implementation challenges. Proceedings of Central European Conference on Information and Intelligent Systems. Retrieved from http://search.proquest.com/openview/aad715de2556dca67ef5e88a60976dc1/1?pq-origsite=gscholar&cbl=1986354

Thompson, B., Personick, M., & Cutcher, M. (2014). The Bigdata (R) RDF Graph Database. In Harth, A and Hose, K and Schenkel, R (Ed.), Linked Data Management (193–237).

Wilson, J. R. (1996). Graph Theory. UK: Addison Wesley.

Creative Commons License

Ovaj rad licenciran je pod Creative Commons Attribution-NonCommercial 4.0 International License.

Copyright (c) 2020 Array