Graph Database Engineer – Index & Query Optimisation (Core Database) at Avathon, Inc – Austin, Texas
Explore Related Opportunities
About This Position
Position Title: Graph Database Engineer Index & Query Optimisation (Core Database)
Who We Are & Why Join Us
Avathon is the only physical AI unicorn headquartered in the San Francisco Bay Area, we go beyond models and dashboards we deploy AI that continuously computes across supply chains, energy systems, and industrial operations. Our Operational Technology platform turns fragmented data into real-time, autonomous decisioning across the systems that power the global economy.
This is not digital AI. This is AI for operational reality where latency, constraints, and failure have real-world consequences.
Cutting-Edge AI Innovation Join a team at the forefront of AI, developing groundbreaking solutions that shape the future.
High-Growth Environment Thrive in a fast-scaling startup where agility, collaboration, and rapid professional growth are the norm.
Meaningful Impact Work on AI-driven projects that drive real change across industries and improve lives.
Learn more at: Avathon
Position Summary:
We are looking for a Kernel Engineer with a focus on Indexing and Query Optimisation to join our Index team. You will work on designing and evolving the indexing and schema subsystem of our graph database. Do you have a strong interest in database indexes, query performance, and algorithm design? Are you excited by building indexing systems that support complex graph queries, similarity search, and emerging GenAI workloads then this role shall excite you.
Youll be part of a highly skilled engineering team that values technical rigor, clean design, and honest engineering discussions. Our team has a mix of highly proficient people from multiple fields such as Machine Learning, AI and Data Scientist, Software Engineering, Operations, and Big Data Analytics. We have a strong culture of collaboration, and plenty of opportunity to learn, make an impact, and grow!
What You Will Do:
- Build and ship features related to:
- Indexes
- Constraints
- Schema evolution
- Design and optimise indexing subsystems for graph workloads
- Work on:
- Property and composite indexes
- Graph-aware query optimisation
- Vector and similarity search capabilities
- Support complex workloads across large-scale graph datasets
- Write high-quality, testable, and efficient code
- Profile and optimise indexing and query execution performance
- Collaborate with product managers to define the index roadmap
- Explore and integrate new indexing techniques and research ideas
- Use innovation time to experiment with new index designs
- Strong interest in how database indexes work internally
- Proficiency in algorithm and data structure design
- Proficiency in C++ and/or Scala
- Experience working with graph databases or query engines
- Understanding of multi-threaded systems
- Strong analytical and problem-solving skills
- A collaborative and humble engineering mindset
- Experience with Lucene or search/index engines
- Knowledge of B-Trees, LSM trees, inverted or vector indexes, Various Search Algorithms
- JVM performance tuning experience
- Experience working on large-scale database systems
- 4+ years of experience
- Languages: C++, Scala
- Graph Stack: JanusGraph, TinkerPop
- Focus Areas: Kernel systems, indexing, transactions, schema, query execution
- Engineering Values: Performance, correctness, simplicity, and long-term maintainability
**A PLUS if you provide the link to your GitHub Website
Avathon is an Equal Opportunity Employer. All qualified applicants will receive consideration for employment without regard to race, color, religion, sex, sexual orientation, gender identity, national origin, age, pregnancy, genetic information, disability, status as a protected veteran, or any other protected category under applicable federal, state, and local laws.
Avathon is committed to providing reasonable accommodations throughout the recruiting process. If you need a reasonable accommodation, please contact us to discuss how we can assist you.