arcadedb
https://github.com/arcadedata/arcadedb
Triage Issues!
When you volunteer to triage issues, you'll receive an email each day with a link to an open issue that needs help in this project. You'll also receive instructions on how to triage issues.
Triage Docs!
Receive a documented method or class from your favorite GitHub repos in your inbox every day. If you're really pro, receive undocumented methods or classes and supercharge your commit history.
not yet supported0 Subscribers
Add a CodeTriage badge to arcadedb
Help out
- Issues
- test: named fail points in the commit protocol and the record writes, with failure, kill and concurrent-load tests
- fix(#11818): conditional UPDATE/DELETE and openCypher SET/REMOVE/DELETE evaluate their predicates again on a record a concurrent commit changed after the read
- openCypher: an anchored count(*) taken by a CSR count push-down (COUNT CHAIN PATHS, COUNT STAR JOIN) costs time proportional to the whole graph
- openCypher DETACH DELETE of a vertex with many relationships is superlinear (removes each one from the vertex's own striped list before deleting it); 11x slower than SQL DELETE at 48k
- openCypher x IN $list walks the list on every row: WHERE key IN $ids with an index seek is quadratic in the list (16k ids: 2.1 s vs 72 ms for UNWIND)
- SEARCH_INDEX over a small RID-list target costs the term's matches across the whole type (100 RIDs: 45 ms at 25k chunks, 436 ms at 400k)
- ArcadeDB: FOREACH alias refresh misses list-bound and MERGE-bound nodes in the same statement
- ArcadeDB: null-bound leading node in a pattern comprehension scans the whole graph
- ArcadeDB: pattern-comprehension and list-slice projections return null for unbound variables
- ArcadeDB: two consecutive RETURN clauses are accepted and the last one wins
- Docs
- not yet supported