duckpgq-extension
duckpgq-extension copied to clipboard
cwida
DuckDB extension that adds support for SQL/PGQ
This issue serves as a way to track the progress on the PathFindingOperator Working on in https://github.com/cwida/duckpgq-extension/tree/pathfindingoperator and https://github.com/cwida/duckdb-pgq/tree/pathfindingoperator (Make sure to be on the correct branch in both repositories)...
### What happens? After opening a persistent database (rather than a transient in-memory DuckDB database), I expected PGQ objects to persist after exiting and re-starting. But I got this error...
Test in `shortest_path.test` ```sql -FROM GRAPH_TABLE (snb MATCH p = ANY SHORTEST (a:Person where a.name = 'Daniel')-[k:knows]->{2,3}(b:Person) COLUMNS(element_id(p), a.name, b.name) ``` Potential cause: The lower and upper bounds are 1...
Right now the translated query contains a LIMIT between lower and upper. However this is only enforced after the path-finding UDFs are finished. It would potentially save time if the...
Prepared statements are currently not supported: -PREPARE is5 AS FROM GRAPH_TABLE (snb MATCH (m:message where m.id = $1)-[au:hasAuthor]->(p:person) COLUMNS (p.id, p.firstName, p.lastName) ) tmp; Will return `Binder Error: PREPARE has...
The current error when using element_id(o) is: ``` Catalog Error: Scalar Function with name element_id does not exist! Did you mean "element_at"? ``` As the way element_id is implemented is...
Running `test/sql/scalar/get_csr_w_type.test ` leads to a segfault: ``` Member access within misaligned address 0xbebebebebebebebe for type 'std::__hash_node_base', which requires 8 byte alignment at 0x127c77df8 std::__1::__hash_iterator std::__1::__hash_table::find(int const&) (__hash_table:2319) at 0x127c76f9c...
The way bounded paths are currently checked is with a post-op filter: `iterativelength(0, (select count(*) from Person), a.rowid, b.rowid) between 2 and 3` In this case, if the shortest path...
See graphs here https://github.com/neo4j/neo4j/blob/5.1/community/community-it/algo-it/src/test/java/org/neo4j/kernel/impl/traversal/TestBidirectionalTraversal.java (Also use the nice ascii art to avoid having to draw the graph a million times)
Very similar to IS6 #74, this query is slow to terminate and requires a lot of memory. ```sql FROM GRAPH_TABLE (snb_projected MATCH p = ANY SHORTEST (person:Person WHERE person.id =...