Hacker News new | past | comments | ask | show | jobs | submit | david_p's comments login

Linkurious | Backend and DevOps engineer | Full-Time | ONSITE (Paris, France) | EUR 60k-70k | https://linkurious.com

TL;DR: we’re the European competitor to Palantir. We build and deploy our data intelligence platform in the World’s biggest organisations (governments, financial institutions, NGOs, industry groups, etc.).

Tech: we are centered on graph visualization with a swappable graph database backend (neo4j, neptune, memgraph, google spanner). Our stack is full typescript (nodejs, angular).

We are looking for someone who can contribute to our nodejs app while also improving our developer experience by contributing code & config to our jenkins/kubernetes/argocd/nexus stack.

If you want to know more, please get in touch here: https://linkurious.recruitee.com/o/backend-productivity-engi...



Hi, would you be available to share some feedback about the process & tooling? I'm comparing tools for my needs and would love to ask you for details. I can be reached at david [at] linkurio [dot] us


As many people already commented, no one actually visualizes graphs of that size at once.

Context: I’m the CTO of a GraphViz company, I’ve been doing this for 10+ years.

Here are my recommendations:

- if you can generate a projection of your graph into millions of nodes, you might be able to get somewhere with Three.js, which is a JS library to generate WebGL graphics. The library is close enough to the metal to allow you to build something large and fast.

- if you can get the data below 1M nodes, your best shot is Ogma (spoiler: my company made it). It scales well thanks to WebGL and allows for complex interactions. It can run a graph layout on the GPU in your browser. See https://doc.linkurious.com/ogma/latest/examples/layout-force...

- If you want to keep your billions of nodes but are OK with not seeing the whole graph at once, my company builds Linkurious. It is an advanced exploration interface for a graph stored in Neo4j (or Amazon Neptune). We believe that local exploration up to 10k nodes on screen is enough, as long as you can run graph queries and full-text search queries against the whole graph with little friction. See https://doc.linkurious.com/user-manual/latest/running-querie...


Just wanted to say, while I'll never use Ogma, it's really fun to play w/. Performant too.


in this context, DPA usually means Data Processing Agreement.

I’m assuming GP meant DPO, for Data Protection Officer, the person responsible for enforcing GDPR (or similar laws) in a company.


I was 12 in 1996, in southern France, and my art teacher held a lunch-time club to teach us 3D modelling.

We were using MNM (midnight modeler) and POVRay to create some cool 3D models on my schools 386 computers.

I was dreaming of, one day, working at ILM. Good memories :)


According to ISO.org, which normalized only 2 DB query languages (the first one of which is SQL), it’s GQL (for graph query language).

GQL was normalized in April 2024. Here is the link: https://www.gqlstandards.org/


I love the idea of a simplified SQL syntax for joins.

I have been working with graph databases for years now: these databases had to solve this problem from day one, because of the focus on relationships between entities.

I must point out that Neo4j was the first to propose a syntax that made traversal feel simple and natural again: the Cypher query language.

Neo4 and other industry players have spent years working on a new standard query language for graph databases that was released in April this year: GQL. GQL is the first database query language normalized by ISO since SQL, so it’s a big deal.

Anyway, if you wanna learn more about GQL, that a look at https://www.gqlstandards.org/


Graph databases aren't particularly relevant to a novel syntax for relational databases. The part of the related standard that is about relational databases (SQL/PGQ) demands that every table hold either edges or vertices, but not both [1], which is very limiting.

[1] https://peter.eisentraut.org/blog/2023/04/04/sql-2023-is-fin...


I struggled to find the actual language at the link you posted - is there an obvious example somewhere?

Given that graphql is often shortened to gql is feel this is going to get confusing!


This paper [1] explains some basics

[1] https://arxiv.org/abs/2112.06217


I think InterSystems Caché did it first. Its SQL join syntax lets you do `WHERE employee->manager->manager->name`. I'm not sure it has arbitrary recursion like you can do with graph databases, however.


> I must point out that Neo4j was the first to propose a syntax that made traversal feel simple and natural again

Was it the first? Does it predate path expressions in Hibernate Query Language / Java Persistence Query Language?


Same here.

I currently use photoprism, which is good, but i’m always on the look for a great self-hosted photo app.


I’m using Immich and it’s quite decent. The native app has some annoying glitches.


The AI in photoprism was too embarrassing that I gave up on it. How did you get it working properly?


https://linkurious.com | USA (East coast) | REMOTE | Full-time | $150k-180k

We are a graph visualization company specializing in data investigations. Most of our customers are fighting financial crime.

We are a 11 years old bootstrapped French startup, we created a subsidiary in Washington DC 2 year ago to better serve the US market. We are looking for employee #2 in the US (#44 overall).

The open position is a Solutions Engineering (think technical pre-sales and post-sales). Details: https://www.linkedin.com/jobs/view/3814706457/


Did we study in the same university?

I was studying at a French engineering university and had that exact experience.

I loved learning all the weird command line tricks and Pine shortcuts :)


This was Engineering at University of Toronto


Join us for AI Startup School this June 16-17 in San Francisco!

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: