mirror of
https://github.com/hanzoai/graph.git
synced 2026-10-30 18:35:37 +00:00
zeekay
f5aaeb712e
Derived from Dgraph (github.com/dgraph-io/dgraph) at commit 64804bd2, Apache-2.0. See NOTICE. WHAT THIS IS. The graph engine as a Go library: posting lists, the DQL parser, the type and tokenizer system, the index and schema layers, and the wire types. 39,170 lines of the upstream's 166,337. THE STORE is github.com/luxfi/zapdb, a Badger fork that kept the package name, the subpackages (options, pb, y) and the API — Open, OpenManaged, DB, Options — so the 74 import sites are aliased rather than rewritten. THE CODEC is ZAP. zapdb serializes with ZAP, not protobuf: its pb package builds the ZAP types by default and the protobuf ones only under `-tags grpc`, a path that does not compile (table/builder.go calls pb.Marshal, which that tag removes). One call site in posting needed converting; every other type here is Hanzo's own protobuf and is untouched. NO TRANSPORT. An embedded engine dials nothing, so nothing here imports google.golang.org/grpc. Removed: 20 transport functions in x, the generated service stubs for Raft, Zero and Worker (1,657 lines), and the JWT helper — identity belongs to IAM. The core called none of them. NOT KEPT: worker, conn, raftwal, the cluster commands, the GraphQL layer and the test harnesses. `query`, the DQL execution engine, went with them because it depends on worker; parsing DQL is available here, executing it is not. The history of the upstream project lives at github.com/dgraph-io/dgraph. This repository begins at the derivation because three quarters of that history describes code this fork does not carry.
81 lines
1.3 KiB
Go
81 lines
1.3 KiB
Go
/*
|
|
* SPDX-FileCopyrightText: © 2017-2026 Istari Digital, Inc.
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
package posting
|
|
|
|
import (
|
|
"math"
|
|
"sync"
|
|
|
|
"github.com/hanzoai/graph/algo"
|
|
)
|
|
|
|
type StatsHolder struct {
|
|
sync.RWMutex
|
|
|
|
predStats map[string]StatContainer
|
|
}
|
|
|
|
func NewStatsHolder() *StatsHolder {
|
|
return &StatsHolder{
|
|
predStats: make(map[string]StatContainer),
|
|
}
|
|
|
|
}
|
|
|
|
type StatContainer interface {
|
|
InsertRecord([]byte, uint64)
|
|
Estimate([]byte) uint64
|
|
}
|
|
|
|
type EqContainer struct {
|
|
sync.RWMutex
|
|
|
|
cmf *algo.CountMinSketch
|
|
}
|
|
|
|
func NewEqContainer() *EqContainer {
|
|
return &EqContainer{cmf: algo.NewCountMinSketch(0.001, 0.99)}
|
|
}
|
|
|
|
func (eq *EqContainer) Estimate(key []byte) uint64 {
|
|
eq.RLock()
|
|
defer eq.RUnlock()
|
|
|
|
return eq.cmf.Count(key)
|
|
}
|
|
|
|
func (eq *EqContainer) InsertRecord(key []byte, count uint64) {
|
|
eq.Lock()
|
|
defer eq.Unlock()
|
|
eq.cmf.AddInt(key, count)
|
|
}
|
|
|
|
func (sh *StatsHolder) InsertRecord(pred string, key []byte, count uint64) {
|
|
sh.RLock()
|
|
val, ok := sh.predStats[pred]
|
|
sh.RUnlock()
|
|
if !ok {
|
|
return
|
|
}
|
|
|
|
val.InsertRecord(key, count)
|
|
}
|
|
|
|
func (sh *StatsHolder) ProcessEqPredicate(pred string, key []byte) uint64 {
|
|
sh.RLock()
|
|
val, ok := sh.predStats[pred]
|
|
sh.RUnlock()
|
|
if ok {
|
|
return val.Estimate(key)
|
|
}
|
|
|
|
sh.Lock()
|
|
val = NewEqContainer()
|
|
sh.predStats[pred] = val
|
|
sh.Unlock()
|
|
return math.MaxUint64
|
|
}
|