|
193 | 193 | <h3 class="hero-title fw-bold display-1 text-primary text-center text-xl-start pb-4">Shaping the Future of Knowledge Graphs</h3>
|
194 | 194 |
|
195 | 195 |
|
196 |
| - <p class="text-center text-black-61 text-xl-start pb-4">Orb DB is a fresh start in database design, combining the latest advances in AI and Data Systems to build world’s first responsible knowledge graph database. If you like to join the team, we have positions open internationally!</p> |
| 196 | + <p class="text-center text-black-61 text-xl-start pb-4">Orb DB is a fresh start in database design, combining the latest advances in AI and Data Systems to build world’s first responsible knowledge graph database.</p> |
197 | 197 |
|
198 | 198 | <div class="d-flex flex-column flex-xl-row">
|
199 | 199 |
|
@@ -224,15 +224,16 @@ <h3 class="hero-title fw-bold display-1 text-primary text-center text-xl-start p
|
224 | 224 | }
|
225 | 225 |
|
226 | 226 | .team-member img {
|
227 |
| - width: 200px; |
228 |
| - height: 200px; |
| 227 | + width: 180px; |
| 228 | + height: 180px; |
229 | 229 | border-radius: 20%;
|
230 | 230 | object-fit: cover;
|
231 | 231 | }
|
232 | 232 |
|
233 | 233 | .team-member h2 {
|
234 | 234 | margin: 5px 0;
|
235 | 235 | font-size: 1.5rem;
|
| 236 | + padding-top: 5px; |
236 | 237 | }
|
237 | 238 |
|
238 | 239 | .team-member p {
|
@@ -454,6 +455,56 @@ <h2 class="text-primary">Panagiotis Kaliosis</h2>
|
454 | 455 | </div>
|
455 | 456 | </section>
|
456 | 457 |
|
| 458 | + <section class="section portfolio"> |
| 459 | + <div class="container"> |
| 460 | + <div class="row"> |
| 461 | + |
| 462 | + <div class="col-12 col-md-6 mb-4 d-flex"> |
| 463 | + <div class="card p-3 border d-flex flex-column"> |
| 464 | + <div class="d-flex flex-column justify-content-between h-100"> |
| 465 | + |
| 466 | + <p class="text-danger fw-semibold mb-2">Our Vision</p> |
| 467 | + |
| 468 | + |
| 469 | + <h3 class="fs-4 fw-bold text-primary pb-3">ORB: Empowering Graph Queries through Inference</h3> |
| 470 | + |
| 471 | + |
| 472 | + <p class="text-black-61 pb-3">Executing queries on incomplete, sparse knowledge graphs yields incomplete results, especially when it comes to queries involving traversals. We question the applicability of all known architectures for incomplete knowledge bases and propose Orb DB: a clear departure from existing system designs, relying on Machine Learning-based operators to provide inferred query results.</p> |
| 473 | + |
| 474 | + <div class=""> |
| 475 | + |
| 476 | + <a class="text-decoration-none me-3" href="https://ceur-ws.org/Vol-3443/ESWC_2023_DMKG_paper_6223.pdf">Read paper</a> |
| 477 | + |
| 478 | + </div> |
| 479 | + </div> |
| 480 | + </div> |
| 481 | + </div> |
| 482 | + |
| 483 | + <div class="col-12 col-md-6 mb-4 d-flex"> |
| 484 | + <div class="card p-3 border d-flex flex-column"> |
| 485 | + <div class="d-flex flex-column justify-content-between h-100"> |
| 486 | + |
| 487 | + <p class="text-danger fw-semibold mb-2">Orb DB's Query Optimization</p> |
| 488 | + |
| 489 | + |
| 490 | + <h3 class="fs-4 fw-bold text-primary pb-3">Query Optimization for Inference-Based Graph DBs</h3> |
| 491 | + |
| 492 | + |
| 493 | + <p class="text-black-61 pb-3">This work aims to develop a novel graph query optimizer that leverages the power of Graph Machine Learning to equip graph queries with prediction capabilities while offering approximate but timely results to complex queries. We discuss challenges, design decisions, and research avenues required in materializing this prototype.</p> |
| 494 | + |
| 495 | + <div class=""> |
| 496 | + |
| 497 | + <a class="text-decoration-none me-3" href="https://ceur-ws.org/Vol-3452/paper9.pdf">Read paper</a> |
| 498 | + |
| 499 | + </div> |
| 500 | + </div> |
| 501 | + </div> |
| 502 | + </div> |
| 503 | + |
| 504 | + </div> |
| 505 | + </div> |
| 506 | +</section> |
| 507 | + |
457 | 508 |
|
458 | 509 |
|
459 | 510 | <footer class="shared footer bg-blue-light py-5">
|
|
0 commit comments