Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
dgraph
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Mirror
dgraph
Commits
c9fd7838
Commit
c9fd7838
authored
9 years ago
by
Manish R Jain
Browse files
Options
Downloads
Patches
Plain Diff
Removed old code from query. Explained how SubGraph approach would work
parent
b4127a6a
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
query/query.go
+80
-113
80 additions, 113 deletions
query/query.go
with
80 additions
and
113 deletions
query/query.go
+
80
−
113
View file @
c9fd7838
...
...
@@ -18,143 +18,110 @@ package query
import
(
"fmt"
"math"
"github.com/google/flatbuffers/go"
"github.com/manishrjain/dgraph/posting"
"github.com/manishrjain/dgraph/posting/types"
"github.com/manishrjain/dgraph/query/result"
"github.com/manishrjain/dgraph/task"
"github.com/manishrjain/dgraph/uid"
"github.com/manishrjain/dgraph/x"
)
// Aim to get this query working:
// {
// me {
// id
// firstName
// lastName
// birthday {
// month
// day
// }
// friends {
// name
// }
// }
// }
/*
* QUERY:
* Let's take this query from GraphQL as example:
* {
* me {
* id
* firstName
* lastName
* birthday {
* month
* day
* }
* friends {
* name
* }
* }
* }
*
* REPRESENTATION:
* This would be represented in SubGraph format internally, as such:
* SubGraph [result uid = me]
* |
* Children
* |
* --> SubGraph [Attr = "xid"]
* --> SubGraph [Attr = "firstName"]
* --> SubGraph [Attr = "lastName"]
* --> SubGraph [Attr = "birthday"]
* |
* Children
* |
* --> SubGraph [Attr = "month"]
* --> SubGraph [Attr = "day"]
* --> SubGraph [Attr = "friends"]
* |
* Children
* |
* --> SubGraph [Attr = "name"]
*
* ALGORITHM:
* This is a rough and simple algorithm of how to process this SubGraph query
* and populate the results:
*
* For a given entity, a new SubGraph can be started off with NewGraph(id).
* Given a SubGraph, is the Query field empty? [Step a]
* - If no, run (or send it to server serving the attribute) query
* and populate result.
* Iterate over children and copy Result Uids to child Query Uids.
* Set Attr. Then for each child, use goroutine to run Step:a.
* Wait for goroutines to finish.
* Return errors, if any.
*/
var
log
=
x
.
Log
(
"query"
)
// SubGraph is the way to represent data internally. It contains both the
// query and the response. Once generated, this can then be encoded to other
// client convenient formats, like GraphQL / JSON.
type
SubGraph
struct
{
Attr
string
Children
[]
*
SubGraph
Q
uery
[]
byte
R
esult
[]
byte
q
uery
[]
byte
r
esult
[]
byte
}
func
NewGraph
(
id
uint64
,
xid
string
)
*
SubGraph
{
func
NewGraph
(
eu
id
uint64
,
e
xid
string
)
(
*
SubGraph
,
error
)
{
// This would set the Result field in SubGraph,
// and populate the children for attributes.
return
nil
}
type
Mattr
struct
{
Attr
string
Msg
*
Mattr
Query
[]
byte
// flatbuffer
Result
[]
byte
// flatbuffer
/*
ResultUids []byte // Flatbuffer result.Uids
ResultValue []byte // gob.Encode
*/
}
type
Message
struct
{
Id
uint64
// Dgraph Id
Xid
string
// External Id
Attrs
[]
Mattr
}
type
Node
struct
{
Id
uint64
Xid
string
}
func
extract
(
l
*
posting
.
List
,
uids
*
[]
byte
,
value
*
[]
byte
)
error
{
b
:=
flatbuffers
.
NewBuilder
(
0
)
var
p
types
.
Posting
llen
:=
l
.
Length
()
if
ok
:=
l
.
Get
(
&
p
,
l
.
Length
()
-
1
);
ok
{
if
p
.
Uid
()
==
math
.
MaxUint64
{
// Contains a value posting, not useful for Uids vector.
llen
-=
1
}
}
result
.
UidsStartUidVector
(
b
,
llen
)
for
i
:=
l
.
Length
()
-
1
;
i
>=
0
;
i
--
{
if
ok
:=
l
.
Get
(
&
p
,
i
);
!
ok
{
return
fmt
.
Errorf
(
"While retrieving posting"
)
}
if
p
.
Uid
()
==
math
.
MaxUint64
{
*
value
=
make
([]
byte
,
p
.
ValueLength
())
copy
(
*
value
,
p
.
ValueBytes
())
}
else
{
b
.
PrependUint64
(
p
.
Uid
())
}
}
vend
:=
b
.
EndVector
(
llen
)
result
.
UidsStart
(
b
)
result
.
UidsAddUid
(
b
,
vend
)
end
:=
result
.
UidsEnd
(
b
)
b
.
Finish
(
end
)
buf
:=
b
.
Bytes
[
b
.
Head
()
:
]
*
uids
=
make
([]
byte
,
len
(
buf
))
copy
(
*
uids
,
buf
)
return
nil
}
func
Run
(
m
*
Message
)
error
{
if
len
(
m
.
Xid
)
>
0
{
u
,
err
:=
uid
.
GetOrAssign
(
m
.
Xid
)
if
len
(
exid
)
>
0
{
u
,
err
:=
uid
.
GetOrAssign
(
exid
)
if
err
!=
nil
{
x
.
Err
(
log
,
err
)
.
WithField
(
"xid"
,
m
.
X
id
)
.
Error
(
x
.
Err
(
log
,
err
)
.
WithField
(
"xid"
,
ex
id
)
.
Error
(
"While GetOrAssign uid from external id"
)
return
err
return
nil
,
err
}
log
.
WithField
(
"xid"
,
m
.
X
id
)
.
WithField
(
"uid"
,
u
)
.
Debug
(
"GetOrAssign"
)
m
.
I
d
=
u
log
.
WithField
(
"xid"
,
ex
id
)
.
WithField
(
"uid"
,
u
)
.
Debug
(
"GetOrAssign"
)
eui
d
=
u
}
if
m
.
I
d
==
0
{
if
eui
d
==
0
{
err
:=
fmt
.
Errorf
(
"Query internal id is zero"
)
x
.
Err
(
log
,
err
)
.
Error
(
"Invalid query"
)
return
err
return
nil
,
err
}
for
idx
:=
range
m
.
Attrs
{
mattr
:=
&
m
.
Attrs
[
idx
]
key
:=
posting
.
Key
(
m
.
Id
,
mattr
.
Attr
)
pl
:=
posting
.
Get
(
key
)
if
err
:=
extract
(
pl
,
&
mattr
.
ResultUids
,
&
mattr
.
ResultValue
);
err
!=
nil
{
x
.
Err
(
log
,
err
)
.
WithField
(
"uid"
,
m
.
Id
)
.
WithField
(
"attr"
,
mattr
.
Attr
)
.
Error
(
"While extracting data from posting list"
)
}
if
mattr
.
Msg
!=
nil
{
// Now this would most likely be sent over wire to other servers.
if
err
:=
Run
(
mattr
.
Msg
);
err
!=
nil
{
return
err
}
}
}
return
nil
// Encode uid into result flatbuffer.
b
:=
flatbuffers
.
NewBuilder
(
0
)
task
.
ResultStartUidsVector
(
b
,
1
)
b
.
PrependUint64
(
euid
)
vend
:=
b
.
EndVector
(
1
)
task
.
ResultStart
(
b
)
task
.
ResultAddUids
(
b
,
vend
)
rend
:=
task
.
ResultEnd
(
b
)
b
.
Finish
(
rend
)
sg
:=
new
(
SubGraph
)
sg
.
result
=
b
.
Bytes
[
b
.
Head
()
:
]
return
sg
,
nil
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment