Nod CareersAuto-apply free

Master's Thesis Opportunity - Spring of 2027 (Kernel)

neo4j · Malmö · Malmö
Auto-apply to this job with Nod →
<div class="content-intro"><div><span style="font-size: 18pt;"><strong>About Neo4j:</strong></span></div> <div> <p>Neo4j is the graph intelligence platform that transforms data into knowledge to power the next generation of intelligent applications and AI systems. It includes enterprise-ready knowledge graphs for accurate, explainable, and governed AI; the most comprehensive, trusted, and easy-to-deploy graph capabilities across any environment and data source; and an unmatched ecosystem trusted by 84 of the Fortune 100 and supported by the world’s largest graph community. Intelligence that works. Results that matter.</p> <p>Built to work everywhere and integrate with everything across every cloud for dynamic, personalized, and autonomous AI systems. We deliver quicker results, contextual knowledge, and solutions that impact customers and employees across the business.</p> </div> <div><span style="font-size: 18pt;"><strong>Our Vision: </strong></span></div> <div> <p><span style="font-weight: 400;">At Neo4j, we have always strived to help the world make sense of data.  </span></p> <p><span style="font-weight: 400;">As business, society and knowledge become increasingly connected, our technology promotes innovation by helping organizations to find and understand data relationships. We created, drive and lead the graph database category, and we’re disrupting how organizations leverage their data to innovate and stay competitive.</span></p> </div></div><p><span style="font-size: 18pt;"><strong>The Role:</strong></span></p> <div class="p-rich_text_section" style="text-align: left;"><strong>N.B.</strong> We are looking for a single individual for a master's thesis project with the Kernel team in the areas of transaction management, concurrency and/or system performance. Together with another student, you will work on the master's thesis project as a pair.</div> <div class="p-rich_text_section" style="text-align: left;"> </div> <div class="p-rich_text_section" style="text-align: left;">Are you at the end of your studies and want to immerse yourself in graph technology? We are now looking for students who want to do their Master’s Thesis alongside us at Neo4j!<br>As part of Neo4j engineering in Malmö, you will work with a diverse team of talented colleagues worldwide. You will receive advice and continuous support from us - we are experts in graph technology and positioned to help you perform to the best of your ability.</div> <div class="p-rich_text_section" style="text-align: left;"> </div> <div class="p-rich_text_section" style="text-align: left;"> <div class="p-rich_text_section" style="text-align: left;"><strong data-stringify-type="bold">Past Thesis Topics:</strong></div> <div class="p-rich_text_section" style="text-align: left;"><strong data-stringify-type="bold"> <br></strong><strong>Force Directed Drawing Algorithms and Parameter Optimisation:</strong><br>Through my thesis I have implemented and compared some different graph drawing algorithms in addition to some methods to speed up the slow parts of these algorithms. These algorithms were then used to test what to the best of my knowledge is a novel approach to select parameter values for graph drawing algorithms. For this, I use methods similar to those used in Machine Learning to select parameter values and measure the utility of any set of parameters by creating my own utility function. I created this function by looking at objective measures of drawing quality that are commonly known, such as the number of edge crossings, along with the time it took to draw a given graph. The resulting method for parameter optimisation could find significant increases in the speed of graph drawing for several of my implemented drawing algorithms without compromising drawing quality. Furthermore, the approach is not specific to any parameter set, and can with some modification be applied to any graph drawing algorithm dependent on some constants.<br><strong data-stringify-type="bold"><br></strong><strong>Modeling Profiling Data in a Graph Database for Performance Analysis:</strong><br>Benchmarking is an important part of the development process for any mission-critical application. By inspecting profiling data, developers can identify bottlenecks and performance regressions before they reach the customers. </div> <div class="p-rich_text_section" style="text-align: left;">Neo4j runs an extensive benchmarking suite on its database, resulting in a huge collection of profiling data collected each week. These profiles are commonly visualized individually as flame graphs which are inspected manually. Finding patterns and differences among multiple profiles is difficult to do manually, due to the size and complexity of the data. We propose a framework for identifying bottlenecks and regressions by modeling the profiling data as call-stack trees in a graph database. We demonstrate the usefulness of the framework for cross-profile analysis such as time series analysis and aggregation-based methods. We conclude that there is much potential in this approach and our thesis can be used as a decision basis for organizations wanting to implement a similar framework.<br>Using a graph database to model profiling data has many advantages and is suitable for the tree-like structure of the data. It makes the data more accessible and facilitates flexible querying in which the user can ask questions about the data and perform non-trivial aggregation. It has alre

Let Nod apply for you →

More jobs at neo4j

Senior Account Executive, Digital Natives - India (Bangalore) — neo4jSales Development Representative - London — neo4jSenior Developer Advocate — neo4jSenior Enterprise Account Executive, Financial Services — neo4jSoftware Engineer - Connectors — neo4jSoftware Engineer - Developer Experience — neo4j