Getting started with Dgraph #5: Tweet graph, string indices, and keyword-based searching

preview_player
Показать описание
In the fifth episode of Getting started with Dgraph, we cover string indices including hash, exact, and term.

  1. Dgraph Labs
  2. dgraph
  3. graph
  4. database
  5. scalable
  6. distributed
Рекомендации по теме
Getting started with 0:09:01

Getting started with Dgraph #5: Tweet graph, string indices, and keyword-based searching

Getting started with 0:10:02

Getting started with Dgraph #2: updating, deleting, and recursive traversals

Getting started with 0:07:34

Getting started with Dgraph #1: running, mutations, and queries

Neo4j in 100 0:02:37

Neo4j in 100 Seconds

Getting started with 0:08:56

Getting started with Dgraph #3: basic types, indexes, filters, and reverse traversals

Dgraph Data Platform 0:04:24

Dgraph Data Platform in 5 minutes

Getting started with 0:07:06

Getting started with Dgraph #4: string internationalization

GraphQL Explained in 0:02:22

GraphQL Explained in 100 Seconds

Creating Your First 0:03:17

Creating Your First GraphQL Endpoint with Dgraph

Vector databases are 0:03:22

Vector databases are so hot right now. WTF are they?

Searching With Strings 0:02:48

Searching With Strings in Dgraph Cloud

Rapid Application Development 0:12:01

Rapid Application Development with GraphQL - Dgraph - React.js

Introduction to Dgraph 1:18:21

Introduction to Dgraph | Rawkode Live

GUN Decentralized Graph 0:02:19

GUN Decentralized Graph DB in 100 Seconds

15 futuristic databases 0:08:42

15 futuristic databases you’ve never heard of

Go in 100 0:02:30

Go in 100 Seconds

Graph Database: Performing 0:10:58

Graph Database: Performing CRUD operations with Dgraph (2019)

DGraph - a 0:32:42

DGraph - a Graph Database

Dgraph GraphQL - 0:01:40

Dgraph GraphQL - From zero to a running GraphQL API in two steps

Building GraphQL Responses 0:06:56

Building GraphQL Responses Using RESTful Endpoints With Dgraph Lambda

What is Dgraph? 0:02:34

What is Dgraph?

Dgraph: The Graph 1:29:18

Dgraph: The Graph Database written in Go

Getting Started with 0:40:21

Getting Started with the Graph Database Extension for PostgreSQL

Graph Database: Intro 0:18:00

Graph Database: Intro to Dgraph's Query Language (2017)

Комментарии
Автор

I have two questions about graph traversals:
1. Given a starting node and an ending node, how to traverse all paths with the specified minimal and maximal depths? @recurse has some limitations: first, the depth parameter is specified as maximum depth, not minimal depth; second, the nodes in the path may be have different predicates, in other words, there may not exist a repeated pattern which could be rewritten as recurse block.
2. Given a starting node and a minimal or/and maximal depth, how to traverse all paths in either direction (including outgoing and incoming direction)?
Thanks in advance!

LinghuiZeng
Автор

What happened to Franscesc? This guy clearly doesn't have a clue what he is talking about. All of this step by step "let's uncheck this, let's select that, click update.". C'mon, this is not a photoshop tutorial for beginners. Please bring back somebody who can explain something about the steps instead of the steps themselves.

rainerwahnsinn