PHP Deployment with Dropbox

Deploying files over sFTP or scp is boring and takes a lot of time. Using git with commit-hooks to initiate the deployment process is comfortable, but there is a solution that's even faster:

Deploy your server(s) with a Dropbox!


Here we go, first create a new Dropbox account:

Then install the Dropbox client on your Desktop (if you haven't done yet):
Delete the example content in your local Dropbox folder:

Next install the Dropbox client on your server. Dropbox packages for Linux can be found here.
I'm using a 32bit version with my Ubuntu Server VM. Execute the following commands on the shell (as root): 

chown www-data:www-data /var/www
su - www-data -c bash
wget -qO - "https://www.dropbox.com/download?plat=lnx.x86" | tar xzf -
# or: wget -qO - "https://www.dropbox.com/download?plat=lnx.x86_64" | tar xzf -
.dropbox-dist/dropboxd
> This client is not linked to any account...
> Please visit https://www.dropbox.com/cli_link?host_id=d4b6c6b6bac2b
> 4b35619067a04b9751f&cl=en_US to link this machine.

Copy the URL given to your browser and confirm the action with your password:
Then we get: 

> Client successfully linked, Welcome Thomas!
^C
ls -lisa
> ...
> 401534 4 drwx------  3 www-data www-data 4096 Jul 10 02:33 .dropbox
> 401628 4 drwx------  3 www-data www-data 4096 Jul 10 02:33 Dropbox
> 400700 4 drwxr-xr-x  4 www-data www-data 4096 Jun 14 03:40 .dropbox-dist

Now let's make the Dropbox client start automatically: 

exit
# we are root again
echo "start-stop-daemon --start --background --chuid www-data --exec /var/www/.dropbox-dist/dropboxd" >/etc/init.d/dropbox
chmod +x /etc/init.d/dropbox
update-rc.d dropbox defaults

# start dropbox daemon
/etc/init.d/dropbox

# change Apache's document_root from /var/www to the Dropbox folder
find /etc/apache2 -type f -exec sed -i "s#/var/www#/var/www/Dropbox#g" {} \;

# protect cache folders
echo -e "\n<Directorymatch /\.>\nOrder deny,allow\nDeny from all\n</Directorymatch>" >>/etc/apache2/conf.d/security
/etc/init.d/apache2 restart

Then create a index.php in your local Dropbox folder:

Check the results on the server: 

ls -lisa /var/www/Dropbox/
> 400788 4 -rw-r--r-- 1 www-data www-data   29 Jul 10 03:56 index.php
And finally:

What about security and traceability?

That's the weak point, a this should have never happened thing already happened to Dropbox. Also Dropbox relies on Amazon S3, so there might be elements in the chain that can break. If security is critical to your business, don't deploy with Dropbox!
Compared to git, there is no detailed changelog indicating who changed what, why and when. But you can put your git repository in your Dropbox folder to get these features.

What about memory usage of Dropbox?

On 32bit, you can calculate about 20 MB.

Comments

Post a Comment

Popular posts from this blog

How to show only month and year fields in android Date-picker?

Image
Android default DatePicker show day/month/year fields but you have to customize this DatePicker as your requirements. Suppose that you want to show only month and year fields in android datepicker . To do this, you have to customize the Dialog DatePicker source code but it is not an easy task. In this tutorial I will show you a tricky way to solve this problem. Lets see how to show only month and year field in android DatePicker as a dialog.   Step to show only month and year fields in android date-picker: Some days ago I got this same problem and here I am trying to explain this in a sequential manner. I want to show a dialog datepicker when user click on an EditText. So if user click on EditText, A dialog datepicker will be invocked and it will show only month and year fields. To do this, at first we have to create a xml layout to hold the EditText fields. So create an android project and name it DatePickerExample. In the main.xml file just try to write this simple code....
Read more

How to construct a B+ tree with example

Image
A B+ tree contains n-1 search key values K1K2…….Kn-1 and have n pointers.   In a B+ tree the data are ordered  sequentially.  The leaf node may hold up to n pointers and must hold at least N/2 pointers. The root node must hold at least two pointers, unless the tree consists of only one node.  Now we construct a B+ tree. Construct a B+ tree for the following set of key values: (2,3,5,7,11,17,19,23,29,31) Assume that the tree is initially empty and values are added in ascending order. Construct a B+ tree where the pointer number is Four. Solution: When a node exceeds n-1 search key value then we split it into two nodes. First node contains (ceiling(n-1)/2) values.  2 nd node contains remaining node. Copy the smallest search key value of the second node to the parent node. Let's start, we know each node has N pointer and has N-1 search key values. In our example pointer number is 4, so the search key value is 4-1=3. So each node has 4 pointers and 3 search key val...
Read more

Conflict Serializability in database

Image
To maintains database state consistency we introduce serializability. Using serializability we can understand which schedule will ensure consistency, and which schedule will not. When we are capable of converting a concurrent schedule into a serial schedule then we cal it serializable schedule. A schedule is serializable if it is equivalent to a serial schedule. We divided this concepts into two parts 1. Conflict serializability  & 2. View serializability In this discussion I just clarify you the conflict serializability. Consider two instruction read, write and the data item A and B. When two instruction execute different data item such as read(A) and read(B), then we can swap the instruction without affecting the result of the schedule. But when the data item is equivalent to one another we need to consider following four condition.    a.   read (A ),    read ( A ).   they   don’t conflict.    b.   read ( Q),  ...
Read more