Showing posts with label Relational Database. Show all posts
Showing posts with label Relational Database. Show all posts

Tuesday, February 9, 2016

B5 - Group A - Yuanjin LI


This blog will discuss the relational database theory. Database is well known as a collection of information this is organized so that it can be easily accessed, managed and updated. Databases are usually classified by organizational approach. Originally, databases were flat. All the information was stored in one long text file, called a delimited file. It is difficult to search for specific information and update those existed files. Then the relational database appears. It was invented by E.F.Codd who is an IBM researcher in 1970.

 

What is the difference between relational databases and normal databases? A relational database is a collection of data that can be accessed, managed and reassembled in many different ways. These data items are organized as a set of formally described table. When people access it the system do not need to reorganize these database tables. Today most of routine data transactions like accessing bank accounts, using credit cards and buying thing online are all use structures based relational database theory.

 

The structured query language (SQL) can not be ignored if we want to discuss the relational database theory. This structured query language is a kind of programming language designed for managing data in a relational database management system (RDBMS). It is the standard user and application program interface of relational database. It is used for information interactive query from a relational database and for gathering data to generate reports.

 

A relational database is a set of tables including data fitted into predefined categories. Files are represented by a table that stores information about different entries. Each table (or sometimes called relation) contains one or more data entries in columns. And each row represents an instant of data that related to the entries defined by the columns. Here is a simple example of the database of books.


In this example, each row corresponds to one tuple and a column corresponds to an attribute. An attribute is different named book’s information and each attribute is associated with a domain. The advantages of the relational database are it is easy to create and access because of the predefined categories. Except that, it is easy to extend as well. A new data category can be added without requiring the existing attributes.

 

 

 

Reference

http://computer.howstuffworks.com/question599.htm

http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/reldb/

http://searchsqlserver.techtarget.com/definition/database http://searchsqlserver.techtarget.com/definition/relational-database

http://www.techrepublic.com/article/relational-databases-the-inspiration-behind-the-theory/

 

 

Comment


B5 - Group C - Cristian Almendariz

            I will like to say that before this post, I did not know what databases or object-oriented databases were.  For this reason, I looked up several websites for a simple yet easy to understand definition.  I will like to start by defining what databases and objects are.  As it name describes, a database is a base of data.  The properties of databases depend on dead, static data meaning that this data will remain the same all the time.  On the other hand, objects will hide the non-static data under behaviors that can change.  Traditional database applications will manipulate temporal data while the data within the database is permanent.  On the other hand, object database application will manipulate both temporal and permanent data [1]. 
In my research, I was able to find that object oriented databases are also known as Object Database Management systems (ODBMS) [1] or Object-Oriented Database Management Systems (OODBMS) [2]. Object-oriented databases store their contents as objects rather than data (e.g. real numbers, integers, or strings).  These objects are utilized in object-oriented programs (e.g. C++, Smalltalk, Java, and others).  Objects are composed of attributes and methods.  The characteristics of an object are defined by data known as attributes.  This data may be really simple (e.g. strings, real numbers, integers) or be a reference to a more complicated object.  On the other hand, methods are procedures or functions that define the behavior of an object.  For this reason, objects have both executable code and data.  Furthermore, classes are typically used in object-oriented programming and they can be tough to be as a template to the object.  A class will not contain data or methods itself but instead define the data and methods the object will incorporate.  Additionally, classes may be used to recreate parts or methods of the object that are not stored in the database [1].  Object-oriented databases store data as objects and can be interpreted only by using the methods specified by its class [3].
             For a better understanding, object-oriented databases can be compared to relational databases.  Relational databases store data in two-dimensional tables that have rows and columns.  Typically, these tables will be “normalized” to prevent unnecessary data repetition.  Each column has a unique “value” identifier to allow a better sorting and understanding of data.  It allows data to be identified so it can be obtained or changed if necessary.  Objects can be put into relational databases but they must be described in terms of simple integers, strings, or real number data.  This breaking and sorting of complex information can be labor intensive and may require the writing of code [1].
            The use of object-oriented databases is recommended for complex data and/or complex relationships.  On the other hand, they should be used when are hardly any join tables and there is a lot of simple transactional data.  There a numerous advantages and disadvantages with using object-oriented databases compared with relational databases.  Advantages such as less required coding, easier navigation, reduced paging (length), better concurrency control, data model will be based on the real world, it will work well for distributed architectures, and object will not require assembly and disassembly saving coding time and execution time to assemble or disassemble this objects.  Disadvantages such as slow access speed due to late binding, lower efficiency for simple data and relationships, relational databases (RB) have simpler tables, support for RB is certain and less likely to change, RB has broader number of user tools, and RB has more stable standards [1].  For the most part it can be assumed that object oriented databases are better for more complex situations and relational databases should be used for simpler situations.

William,

I think you made an excellent point by saying that object-oriented databases simplify storage and data use.  I believe that object-oriented databases were the foundation for nowadays-complex software’s.  Without it, many of them would not be possible or they will take significantly higher computing processing requirements.  Moreover, object-oriented databases have made programing less labor intensive and allow it to become more complex.  I also think that Revit is a program that employs and takes great advantage of object-oriented databases to create really complex models.  Your post’s sentence completion example helped me have a better understanding of what object-oriented databases are and how they work.  I was able to see how each element of an object-oriented database plays a significant role and without any of them it would not work.  Additionally, the method is really important in determining what this database will do “change the meaning of the sentence”.

Alexis,


I like the your comparison between relational database and object oriented databases.  From your information, I am able to deduct that object oriented databases could and should be used for more complex situations/operations.  I was able to find that, although object oriented databases are really good for complex operations they are not reliable for simple operations.  For this reason, it is recommended that relational databases to be used for simple operations.  Going along with the fact that CAD uses object-oriented databases, I believe that Revit also uses it specially for creating families. 

Reference





Group A - B5 - Samuel Boyce

Relational Database Theory

When databases first began, they were flat. This meant that they were not stored in a table, such as that which we are used to when using Excel. The flat file, was called a tab delimited file. Information was entered into these in a way which you will be used to if you have used Matlab. In Matlab, you must enter tables/matrices in a single line, with a ";" separating the entries. The linear nature of the data meant that searches had to be performed by progressing through the whole document, and there was no way to identify records by their particular fields.

This is where relational databases come into play. This breakthrough meant that tables could be created that were accessible to those who were not specialists in computing. All the data was gathered and stored in a way that it was readily accessible. The math behind the idea ensured this. The programming meant that the computer was able to figure out how and where the information was stored. The data was linked instead of being separate instances. By storing data in rows and columns, you allow for it to be accessed very quickly. This aids the computer in manipulating the data. 

By linking the data, you are able to nest thousands of tables within one larger one. Many retail companies use this. One of which you will all be familiar with is Amazon. The advantages of this are clear. By nesting these tables, you are able to create a situation where requests for data can change often, such as when a customer requests certain items that are under $100 and over three stars. This is made possible by relational databases. 

Sources:
http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/reldb/
http://web.cecs.pdx.edu/~maier/TheoryBook/TRD.html
http://computer.howstuffworks.com/question599.htm

Comments:
http://ae-510-ay15-16.blogspot.com/2016/02/b5.html?showComment=1455033817037#c4547866277158625962

http://ae-510-ay15-16.blogspot.com/2016/02/b5-sql-group-b-kai-waechter.html?showComment=1455033903425#c767823399232845177

Gary Reiff - B5 - Group A

A database can be described as relational when it has been design to conform, or mostly conform to a set of practices known as the rules of normalization.  In order to understand relational database, the basics of a database need to be know first.  A database is typically constructed in two different stages.  The first stage is creating a logical data model.  A logical data model allow you to lay out the design and organization of the database.  The second stage is the creation of the physical data model.  The physical data model sets up the parts of the database visible to users, such as columns and tables.  In fact, relational databases story highly structured tables in columns of specific types and many rows of the same kind of information.  This is why the organization, and really the logical data model part of a relational database is so important.

Now that you know a little about databases, it’s time to discuss some terminology specific to relational databases.  The first relational database term I am going to discuss is entity.  An entity stores information in a database regarding something of interest in the real world, such as departments within an organization.  Next, an attribute represents information regarding an object that will be tracked, such as the birth date or social security number of an employee.  One last crucial concept within relational databases is a primary key.  A primary key identifies a specific instance or object of an entity, meaning no two instances or objects can have the same primary key.  A great example of a primary key in relational databases are ID numbers, such as the IP Address of a computer.

One popular language used for querying relational databases is SQL.  SQL can be used in many different ways for querying relational databases.  For instance, one use of SQL is for read-only operations, while other times it is used for read/write operations.  This way, only certain people can make changes to the database at certain times.

Lastly, relational databases should not get confused with graph databases, although they can be very useful for graph databases.  As neo4J states, “relationships are first-class citizens of the graph data model, unlike other database management systems, which require us to infer connections between entities using special properties such as foreign keys, or out-of-band processing like map-reduce.  In other words, relational databases are like the stepping stone for graph databases.  Some people even view graph databases as an evolution of relational databases. 

References



Comments
1.) Janet Tran's Comment
2.) Laura Worley's Comment

Monday, February 8, 2016

B5: Janet Tran Group A

  Relational Database Theory
   
In 1970 a mathematician Edgar F. Codd, published the concept that would allow people to access information from databases without having to know how they are structured. Common relational database software are Microsoft Access and Oracle. 

To understand the basic concepts there are a few key terms to identify. A database can be defined as one that contains one or more tables of information. The rows within a table are referred to as records and the columns are referred to as fields or attributes. A relational database requires two or more related tables. Sometimes in order to increase efficiency and reduce error normalizing data is required. This involves dividing information into multiple tables that are organized differently so that there is not redundant information. Primary keys are values within a field that are composed of all unique values. For instance if a table has fields: student identification number, age, and degree. The primary key in this case is student identification number because there is not repeated value, each student has a unique identification number. When normalizing data the tables are structured as either parent, child, or orphan. When two tables have an unequal relationship, the independent one is referred to as the parent and the dependent one is the called the child. However, if there a record within the child table that does not appear in the parent table, that record is called an orphan. The number of records in one table that can be related to the records of another is table is identified as cardinality

The major advantage and use of relational models is its uniformity. All value stored in a table is organized to comply with the same structure. That is each record (row) are formatted the exact same. However, the fields can be unique to each primary key. Additionally, data is only stored once and allows for more efficient storage of information. It also allows for better security since data can be organized into multiple tables. This separation allows one to limit access to certain tables.

Works Cited
[1] http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/reldb/
[2]http://webs.wofford.edu/whisnantdm/Courses/CS101/PDF/Database/Relational_database_concepts.pdf


Student Comments
Comment on Schroeder's post
Comment on Redus' post 



Sunday, February 7, 2016

B5 Relational Database Theory- Rebecca Lynch (Group A)

Relative database theory is a method of storing and manipulating data that simplifies these processes so that the user can access information without knowing the exact structure of the database and having an advanced knowledge of programming. The basic principle behind the theory is the grouping of objects into tables, referred to as relations, which share the same defined attributes. In each table, a row represents an object, that can be either a physical entity or abstract, and is given a primary key that is used to reference to other tables. Each column then represents a specific attribute of the object. The definition of each attribute must fall in the same domain and follow the same constraints in each table. This allows for a definition of constraints for all members of a relation, rather than each individual and ensures all objects are defined with the right type of value, such as making sure it is defined with a number or letter. Derived relations can then be created by referencing other relations with relational operators to create a new table that is then treated as a single entity. This can either be done as a one-to-one link, or a combination of different objects using functions such as union or difference.


As Laura Worley mentioned, relational databases are widely used. This type of database is useful because it allows the user to link changes to the relevant objects so only one change needs to be made for the entire system to be updated. In addition, indexes can be used to obtain data quickly and easily, in the way that you want it to be presented. For example, banks use relational databases to store customers’ information, where each row is a customer and each column is more information for that customer, such as the name, address, and financial information. This allows employees to search a customer’s name or account number and obtain all the relevant information for that customer. In addition, the use of splitting the data into derived relations that can be classified as confidential and non-confidential information allows for increased security as the users can be allowed to see only the tables they are granted access to. In the bank example, for instance, a bank teller can add money to your account without being able to see your private information such as your social security number.

Sources:
"Advantages of a Relational Database." Teach-ICT. N.p., n.d. Web. 07 Feb. 2016. <http:// www.teach-ict.com/as_as_computing/ocr/H447/F453/3_3_9/database_design/miniweb/pg8.htm>.
Hull, Sean. "RELATIONAL DATABASE – WHAT IS IT AND WHY IS IT IMPORTANT?" Scalable Startups. N.p., 05 July 2011. Web. 07 Feb. 2016. <http://www.iheavy.com/2011/07/05/ relational-database-what-is-it-and-why-is-it-important/>.
"Relational Database." Icons of Progress. IBM100, n.d. Web. 07 Feb. 2016. <http://www-03.ibm.com/ibm/history/ibm100/us/en/icons/reldb/>.
"Relational Database." Wikipedia. Wikimedia Foundation, 18 Jan. 2016. Web. 07 Feb. 2016. <https://en.wikipedia.org/wiki/Relational_database>.

Comments:
Yuanjin Li
Haoying Ye

Friday, February 5, 2016

B5, Worley Relational Database Theory

Relational Database Theory was thought of by Edgar F. Codd, who was an educated mathematician working for IBM in the research lab. He initially published a paper explaining how he thought that information could be kept in large databases and accessed without knowing how all of the information was placed in the system or how to access it. Prior to this concept, accessing information took a lot of time and had a high cost. At this time period in the 1960s, mainframe computations could cost up to hundreds of dollars for each minute that is used.
The first idea of relational databases was originally described in math terms. This was due largely in part to the fact that Codd originally studied as a mathematician. Codd then added a computer science major so that he could then program the computer to search for similar information and thus creating databases. The systems were set up so that the same information could be found over and over again rather than being able to search for new information using spark words or other similarities. There are many ways in which relational databases are used today.
Originally many people thought that the idea of relational databases was very simplistic and did not have the capability to perform well. The rational database theory was developed and enhanced and soon became a large database system. These systems were used to track the materials that were used in NASAs Apollo Space Program. There are many other cases currently in which relational databases are used. In most of the popular search engines we can see the use of relational databases. We are able to open up a search engine and type in any information we may need and it will show up with various different options related. Some search engines and databases can populate information that is similar to the searched information rather than just a word search.
In any sense the development of Relational databases has proved to be very useful in many senses and allows for research and storage of information to be much more easily accessible.

Sources:

http://web.cecs.pdx.edu/~maier/TheoryBook/TRD.html

Comments:

http://ae-510-ay15-16.blogspot.com/2016/02/sql-stands-for-structured-query.html?showComment=1454866446006#c5610257769563304987

http://ae-510-ay15-16.blogspot.com/2016/02/b5-group-b-dianna-vogel.html