Here is the synopsis of our sample research paper on COMPUTER DATABASE STRUCTURES. Have the paper e-mailed to you 24/7/365.
Essay / Research Paper Abstract
This 4-page paper discuuses database structures including flat file, relational and object oriented. Bibliography lists 3 souces.
Page Count:
4 pages (~225 words per page)
File: D0_MTcodast.rtf
Buy This Term Paper »
Unformatted sample text from the term paper:
chip on a computer was hard to believe. These days however, the term database is routinely tossed around as common language, with the merits of various computer database structures
constantly being debated. In this paper, we will examine three basic types of computerized database structures -- flat-file, relational and object-oriented.
Perhaps the original, or more traditional, database is called the flat file (Database Structures, 2003). The flat file is considered mainly to be a one-dimensional storage system; whereas the database
in its entirety tends to refer to multidimensional storage (Database Structures, 2003). One good example of a flat file data would be something that could be seen on a typical
spreadsheet program such as Lotus or Excel. Not a whole lot of data needs to be stored on these particular systems, but
the flat file database does allow for organization and dissemination of information. The one major advantage to a flat file database is
that all data is stored in a single location -- the user is not having to move from database to database to figure out where all the information is located
(George Mason University, 2003). Furthermore, the flat file database is familiar to most users -- meaning it is more familiar and easier to work with (George Mason University, 2003). Almost
everyone knows how to log onto Excel pull up necessary data and information. A flat file database pretty much allows only one
record or row per study, making this somewhat cumbersome (George Mason University, 2003). This can create problems, as only a limited number of entries can be calculated per each study
...