[GitHub] [age] TalhaMunir-JD commented on issue #934: Updating properties for multiple nodes in a graph database using a single query without specifying each node individually

2023-05-19 Thread via GitHub


TalhaMunir-JD commented on issue #934:
URL: https://github.com/apache/age/issues/934#issuecomment-1554127149

   Yes you can update property of multiple nodes without specifying every node 
individually. 
   
   If you want to update nodes based on some condition. You can do this in 2 
ways :
   Updating nodes based on a condition:
   1. You can use match clause with come condition that selects the node that 
you want to update 
   2. Then use set clause to update the desired properties.
   SQL:
   `MATCH (n:labelt)
   WHERE n.Property = 'random value'
   SET n.nProperty = 'new value'`
   In above case all nodes with labelt and with property 'Property' that equals 
to a new balue random value will be selected and their new property will be 
updated to new value.
   
   Another method can be to update nodes of a specific label:
   1. In above scenario by just eliminating the condition in match clause you 
can update all the nodes.
   SQL:
 `MATCH (n:labelt)
 SET n.newProperty = 'new value'`
   In above case all nodes with labelt will have new property updated to a new 
value 
   
   
   Using above 2 ways you can update properties of multiple nodes in graph 
database using a single query without specifying each node individually.


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org



Re: [VOTE] Apache AGE release 1.3.0 for PostgreSQL 11

2023-05-19 Thread John Gemignani
Dear Apache Community,

We would like to thank everyone who participated in the voting process and
are now closing this vote and will be sending out the results shortly.

John Gemignani

On Tue, May 9, 2023 at 2:30 PM John Gemignani 
wrote:

> Dear Apache Community,
>
> Please carefully read all instructions as they may have changed since the
> last vote thread.
>
> This is an official [VOTE] for Apache AGE release 1.3.0 for PostgreSQL 11.
>
> To learn more about Apache AGE, please see http://age.apache.org/
>
> Functionalities included and addressed in this release are:
>
> *
> Release Notes for Apache AGE release v1.3.0 for PostgreSQL 11
>
> Add additional comments for create_graph function. (#582)
> Optimize age_exists function. (#586)
> Implement plus-equal operator in SET clause. (#638)
> Implement CI test for python driver. (#587)
> Move from travis CI to github actions for build. (#673)
> Update all driver CIs to Github actions.
> Fix build warnings.
> Fix golang driver workflow (#563)
> Updated Readme for drivers folder. (#642)
> Removed async from function definitions. (#680)
> Barbell graph generation (#648) and Barbell regress tests. (#708)
> Updated Python Driver ANTLR 4.9.3 -> 4.11.1 (#706)
> Modify docker url for JDBC driver tests (#716)
> Fix WITH ignoring WHERE clause. (#646)
> Implement isEmpty() predicate function. (#710)
> Fix cypher function input argument checks. (#718)
> Fix Issue 693 - server termination from return exists(path). (#721)
> Update regression tests for cypher_with. (#725)
> Fix issue 733 - create_complete_graph() terminates the server. (#734)
> Prevent MATCH from following OPTIONAL MATCH. (#740)
> Fix property constraints against resolved variables. (#724) (#751) (#701)
> (#747)
> Include invalid labels in reused variables. (#751) (#762)
> Remove check for scalar agtypes in unwind. (#736)
> Update PG11 CI workflows.
> Update readme and version for python driver. (#780)
> Update README.md
> *
>
> The git tag to be discussed and voted on:
> https://github.com/apache/age/releases/tag/PG11/v1.3.0-rc0
>
> The git commit hash:
> commit 1a452595fe59975c1df4941e4f8eeb12c097bab7
>
> The release files for 1.3.0, can be found at:
> https://dist.apache.org/repos/dist/dev/age/PG11/1.3.0.rc0/
>
> Signatures used for AGE RCs can be found in this file:
> https://downloads.apache.org/age/KEYS
>
> The fingerprint of key to sign release artifacts:
> 4293 0603 8E35 AC05 4DBB  4B58 26B6 CD9D CD5B 0045
>
> For information about the contents of this release see:
> https://github.com/apache/age/releases/tag/PG11/v1.3.0-rc0
>
> !!! IMPORTANT PLEASE READ !!!
>
> Please note that Apache REQUIRES the following information to be in your
> response to the vote, in order for it to be valid -
>
> - If you are a binding vote, a PMC, then you MUST state it in your
>   response. Otherwise, leave it out. Do not mention it if you are
>   not a PMC.
>
> - You MUST state what you checked to support your vote. See
>   the samples given below for guidance.
>
> - You MUST, at a minimum, check the above tags, hash,
>links, and signatures for validity.
>
> - You CANNOT just say, +1 or 0. You need to state what items
>   you checked.
>
> If your vote DOES NOT follow the above guidelines or samples below, it may
> be thrown out.
>
> !!! IMPORTANT PLEASE READ !!!
>
> Please vote as follows -
>
> +1, Release this package as Apache AGE 1.3.0 for PostgreSQL 11.
>   0, I won't get in the way of the vote.
>  -1, Do not release this package because 
>
>  !!! Followed by what you checked !!!
>
> Sample responses, two for PMCs (binding) and two for regular committers.
> These are only samples, do not copy/paste.
>
> Remember, (binding) is ONLY for PMCs. If you are not a PMC, DO NOT say
> binding. If you are a PMC, you must state it.
>
>+1 (binding)   +1
>Checked the following:   Checked the following:
>- Signature and Hash.   - Signature and Hash.
>- Tags and Links.   - Tags and Links.
>- LICENSE and NOTICE.  - LICENSE and NOTICE.
>- No unexpected binary files. - No unexpected binary files.
>
> -1, Failed due to 0 (binding)
> Checked the following:   Checked the following:
>- Signature and Hash. - Signature and Hash.
>- Tags and Links. - Tags and Links.
>- BAD LICENSE and NOTICE.   - LICENSE and NOTICE.
>- No unexpected binary files.  - No unexpected binary files.
>
> Again, those are just samples for guidance, DO NOT copy/paste. However,
> your responses should be similar in form.
>
> Please note that it is not a good practice to copy/paste someone else's
> response, you may inadvertently misrepresent yourself or y

[RESULT][VOTE] Apache AGE release 1.3.0 for PostgreSQL 11

2023-05-19 Thread John Gemignani
Dear Apache Community,

The vote successfully passed with 3 +1 (binding) and 11 +1 (non-binding)

votes. There were no 0 or -1 votes.


Following are the detailed results :

Total of 14 (+1) votes.

3 +1(Binding): Nick Sorrel
Eya Badal Dehowe Feng 11 +1(Non Binding) Fatima Raza Carla Sanches Muneeb
Khan Arunabh Das Mohamad Mokhtar Muhammad Shoaib Rahimullah Shaheen Daniel
John Bhaskar Sharma Mahmudul Islam JawadAli Abbasi

VOTE thread:
https://lists.apache.org/thread/hc4znhck7k0074f8kvpfjfqkz341x09j

Thank you all for your participation!

John Gemignani


[GitHub] [age] safi50 opened a new issue, #935: Setting custom number of edges in create_complete_graph()

2023-05-19 Thread via GitHub


safi50 opened a new issue, #935:
URL: https://github.com/apache/age/issues/935

   I was trying to load sample data to my graph for some testing purposes. 
While creating  a sample 100 vertices using the following command: 
   ```
   SELECT * FROM create_complete_graph('test', 100, 'e', 'v');
   ```
   It creates a 100 sample vertices as expected:
   ```
   testdb=# select * from cypher('test', $$ match (n) return count(n)  $$) as ( 
a agtype);
 a  
   -
100
   (1 row)
   ```
   Whereas, it creates **9900** edges for those 100 sample vertices. 
   ```
   testdb=# select * from cypher('test', $$ match ()-[r]-()  return count (r)  
$$) as ( a agtype);
 a   
   --
9900
   (1 row)
   ```
   I found that this is because each vertex has an edge connection to every 
other node in the graph making the total edges 
   as `(n-1) * n` where n is the total number of vertices in the graph. 
   
   What I am trying to figure out is, is there any way to create a custom 
number of edges as we do for the vertices.  For example, if i'm creating a 100 
nodes , i would also like to set a custom number of edges i want in the graph. 
The edge connections, however, can be random. 


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org



[GitHub] [age] WendelLana commented on issue #935: Setting custom number of edges in create_complete_graph()

2023-05-19 Thread via GitHub


WendelLana commented on issue #935:
URL: https://github.com/apache/age/issues/935#issuecomment-1555046000

   A complete graph has edges connecting all pairs of distinct nodes. 
Therefore, in this function, you cannot set the number of edges. However, there 
are other graph generation algorithms that allow you to specify the number of 
edges. One example is the Watts-Strogatz Graph, which includes the argument 'k' 
where each node is joined with its 'k' nearest neighbors in a ring topology.


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org



[GitHub] [age] AbdulSamad4068 commented on issue #935: Setting custom number of edges in create_complete_graph()

2023-05-19 Thread via GitHub


AbdulSamad4068 commented on issue #935:
URL: https://github.com/apache/age/issues/935#issuecomment-1555063879

   the `create_complete_graph()` function you are using seems to generate the 
complete graph by default, connecting each vertex to every other vertex. If you 
want a different number of edges, you would need to modify the function or use 
a different approach.
   There are various algorithms and libraries available for generating random 
graphs, such as the Erdos-Renyi model, this model allows you to specify the 
number of vertices and edges to create a graph with a custom number of edges.


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org



[GitHub] [age] panosfol opened a new issue, #936: Dockerfile as a development environment

2023-05-19 Thread via GitHub


panosfol opened a new issue, #936:
URL: https://github.com/apache/age/issues/936

   **Is your feature request related to a problem? Please describe.**
   
   Contributors should also have an option to develop using docker containers. 
As of today, this is partially possible, except in some cases.
   
   Using docker containers as my development environment, solves two problems 
for me:
   * Having different Postgres & Age(e.g. PG11 & PG12) tags
   * Leave host Postgres installation intact, such that it won't disturb other 
databases running, which may or may not be irrelevant to AGE
   
   The current Dockerfile instructions cannot do that. I have locally developed 
an additional Dockerfile that I'm using as a developer.
   
   **Describe the solution you'd like**
   
   An additional Dockerfile called Dockerfile.dev that also provide the 
necessary infrastructure, such that regression tests can run during the 
building phase of the container, allowing us to catch regression failed tests 
early.
   
   **Describe alternatives you've considered**
   
   Manually attaching to the container and do what's necessary for tests to 
run. This is a very time consuming alternative.


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org



[GitHub] [age] dukeofhazardz commented on issue #934: Updating properties for multiple nodes in a graph database using a single query without specifying each node individually

2023-05-19 Thread via GitHub


dukeofhazardz commented on issue #934:
URL: https://github.com/apache/age/issues/934#issuecomment-1555194941

   In order to modify nodes that have a particular label, you can use the 
`MATCH` clause to locate all nodes with that specific label. Following that, 
you can utilize the `SET` clause to update the properties you desire. Here's an 
example of your modified:
   ```MATCH (n:label4)
   SET n.property = 'value'
   ```
   In this example, all the nodes with the label `label4` will have their new 
"property" set to the new 'value'.
   
   But if you want to update the nodes based on a specific property value, you 
can use the `MATCH` clause to specify the condition for the property value and 
then use the `SET` clause to update the desired properties. The updated query 
will be;
   ```
   MATCH (n:label4)
   WHERE n.property = 'value'
   SET n.property = 'value'
   ```
   So only the nodes with label "label4" which meets the `WHERE` condition will 
have their "property" set to 'value'. 


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org



[GitHub] [age] hammadsaleemm opened a new issue, #939: Retaining vertices after deleting edges using constraints

2023-05-19 Thread via GitHub


hammadsaleemm opened a new issue, #939:
URL: https://github.com/apache/age/issues/939

   I have a graph database where I want to delete specific edges while 
retaining the corresponding vertices. Currently, I'm using constraints to 
ensure data integrity and maintain referential integrity between the vertices 
and edges.
   
   My database schema includes two tables: vertices and edges. The vertices 
table represents the vertices in the graph, and the edges table represents the 
edges connecting those vertices. I'm using foreign key constraints between the 
edges table and the vertices table.
   
   The issue I'm facing is that when I delete an edge, the associated vertices 
are also deleted due to the cascading behavior defined in the constraints. 
However, I would like to retain the vertices even after deleting the edges.
   
   Is there a way to modify the constraints or define new constraints in such a 
way that the vertices are not deleted when deleting the edges? I want to ensure 
that the vertices remain in the database, even if they are not connected to any 
edges.
   
   Any guidance, suggestions, or code examples would be highly appreciated. 
Thank you!


-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: dev-unsubscr...@age.apache.org.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org