Step by step blog creation tutorials using PHP & MySQL: Part-2

Today I will discuss Entity or Database analysis of a personal blog. I hope you will enjoy my tutoring. Before starting our tutorial at first read out our first PHP blog creation tutorial. 

Step by step blog creation tutorials using PHP & MySQL: Part-1

In this day our discussion is about database analysis. So that we need to know what is database. I say that database is nothing but a storage house that store information with secured way. There are various types of database such as MySQL database, Oracle database, Microsoft SQL server etc. In our whole tutorial we user MySQL database. Because it is free and open source.
So guys lets start with us We hope you will enjoy every tutorials from us.


PHP blog Database Design:

Now we try to design our database for personal blog. Actually we represent all functional features in Database. We represent each function in the database as a table.  Note that we think every feature as a database table. So guys think how many tables we will create for our database. Take a look at the PHP blog database tables that is essential for blog creation.

Post: All posts will include here.
Category: We create category table for category.
Comments: All comments will store here.
User: All user information will be found here.

Now take a look at the graphical representation for those sections. 


Each section has different attributes such as user_id, user_first_name, user_last_name, user_email etc. Here I give all attributes

User: user_id, user_first_name, user_last_name, user_email, user_role.
Post: post_id, post_body, post_date.
Category: category_id, category_name.
Comments: comment_id, commeter_name, comment_date. 

We will create E-R diagram by consolidating all attributes in our next tutorial. E-R diagram is very important of developing any kind of PHP web application.  So wait for  our next tutorial. If you face any problem from our tutorials… please make sure your comment. We try our best to solve your problems.

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