nichtich

Deploy your site with git

This gist assumes:

• you have an online remote repository (github / bitbucket etc.)
• you have a local git repo
• and a cloud server (Rackspace cloud / Amazon EC2 etc)
  • your (PHP) scripts are served from /var/www/html/
  • your webpages are executed by Apache
• the Apache user is named www-data (may be apache on other systems)

bmaupin

See also:

• Free database hosting
• https://free-for.dev/#/?id=iaas
• https://free-for.dev/#/?id=paas

Service	Type	RAM	Storage	Limitations
👉 Adaptable	PaaS	256 MB	Non-persistent? (1 GB database storage available)
AWS EC2	IaaS	1 GB		⚠️ Only free for 1 year

bmaupin

See also:

• Free backend hosting
• https://free-for.dev/#/?id=dbaas

Service	Type	Storage	Limitations
Amazon DynamoDB	⚠️ Proprietary NoSQL	25 GB	⚠️ Payment method required
Amazon RDS	⚠️ Proprietary RDBMS		⚠️ Only free for 1 year
Azure SQL Database	MS SQL Server		⚠️ Only free for 1 year
👉 Clever Cloud	PostgreSQL, MySQL, MongoDB, Redis	256 MB (PostgreSQL)	Max 5 connections (PostgreSQL)

ignat

Calculating distance between two nodes in SurrealDB

Current version of SurrealDB doesn't have yet graph::shortest_path(node1, node2) function. It sure will be added later to a stable release. However if the task is simplified a little bit we can calculate the distance with the available functions already.

Assume we have a graph of users that resembles a social network where users can connect (make friends). And we want to label the connection distance between two users similar to LinkedIn:

• direct connections are labeled as 1st
• connections with the shortest path of 2 are labeled as 2nd
• connections with the shortest path of 3 are labeled as 3rd
• connections with the shortest path of 4 and more are labeled as nth

oskar-gmerek

Calculating distance between two nodes in SurrealDB

Current version of SurrealDB doesn't have yet graph::shortest_path(node1, node2) function. It sure will be added later to a stable release. However if the task is simplified a little bit we can calculate the distance with the available functions already.

Assume we have a graph of users that resembles a social network where users can connect (make friends). And we want to label the connection distance between two users similar to LinkedIn:

• direct connections are labeled as 1st
• connections with the shortest path of 2 are labeled as 2nd
• connections with the shortest path of 3 are labeled as 3rd
• connections with the shortest path of 4 and more are labeled as nth