ASSIGN_02 current trends

1. SQL Azure with ASP Dot Net

SQL Azure (SSDS - SQL Server Data Services) is a cloud database system offered by Microsoft. We interact with the SQL Azure services by either issuing statements to it though a command prompt or developing Dot Net applications. This article will introduce and demonstrate development of SQL Azure ASP Dot Net applications.

2. IDMS
Automated Migration for the IDMS Database

The IDMS database life cycle is coming to the end. Many enterprises are making the decision to migrate their IDMS databases to relational ones: DB2, SQL Server or Oracle. Our database migration solution: a highly automated and efficient tool for IDMS conversion to the industry standard databases - DB2, SQL and Oracle. This solution gives you the benefits of automated migration, while allowing you to control the entire process.

Our solution is for IDMS running on z\OS, z\VSE and VME
Business Benefits

* Dramatically reduces license and maintenance costs
* Makes application enhancement easier
* Provides cost effective migration
* Eliminates the IT resources problem
* Uses proven automated tools, thereby mitigating many of the project risks
* Provides a complete solution for language, database, and platform modernization
* Utilizes BluePhoenix’s extensive experience with modernization projects (over 20 years)

ASSIGN_1

A hierarchical data model is a data model in which the data is organized into a tree-like structure. The structure allows repeating information using parent/child relationships: each parent can have many children but each child only has one parent. All attributes of a specific record are listed under an entity type.
In a database, an entity type is the equivalent of a table; each individual record is represented as a row and an attribute as a column. Entity types are related to each other using 1: N mapping, also known as one-to-many relationships.

A relational database matches data by using common characteristics found within the data set. The resulting groups of data are organized and are much easier for people to understand.
For example, a data set containing all the real-estate transactions in a town can be grouped by the year the transaction occurred; or it can be grouped by the sale price of the transaction; or it can be grouped by the buyer's last name; and so on.
Such a grouping uses the relational model (a technical term for this is schema). Hence, such a database is called a "relational database."
The software used to do this grouping is called a relational database management system. The term "relational database" often refers to this type of software.

My_Idea_Is

Part II

A. Relational database system is the arrangement of all the data that were been stored in the database. It is arranged precisely.

B.

Relational Database Management System

A short definition of an RDBMS may be a DBMS in which data is stored in the form of tables and the relationship among the data is also stored in the form of tables.A relational database aims to achieve normalization of data. Normalization helps to reduce redundancy and update anomalies.

Key Field

A key field is a field or set of fields of a database (typically a relational database) table which together form a unique identifier for a database record (a table entry). The aggregate of these fields is usually referred to simply as "the key".

Data Base Records

Represents a single, implicitly structured data item in a table. In simple terms, a database table can be thought of as consisting of rows and columns or fields. Each row in a table represents a set of related data, and every row in the table has the same structure.

Data Queries

Queries are the primary mechanism for retrieving information from a database and consist of questions presented to the database in a predefined format. Many database management systems use the Structured Query Language (SQL) standard query format.

DataType

A data type (or datatype) in programming languages is a set of values and the operations on those values.

Data Forms

Forms allows you to create and run sets of linked, interactive screens for data entry, retrieval and update. A complete set of screens, known as a form, is defined using commands. There are commands for defining what variables are on each screen, how they are displayed and edited, how the screen is to look, and for linking screens together.

Database File

A file database describes any of various means to encode a database model (most commonly a table) as a plain text file.

Relationship (Table Linkage)

Creating a correspondence between a row in a database table and the element. The table that contains the row must have a column named MSLINK, having datatype 32-bit integer. The element has a corresponding MSLINK 32-bit value, known as the database linkage or database attribute

MY_ASSIGNMNT

DATA TYPES
a.)What are they?
A data type in a programming language is a set of data with values having predefined characteristics. Examples of data types are: integer, floating point unit number, character, string, and pointer. Usually, a limited number of such data types come built into a language. The language usually specifies the range of values for a given data type, how the values are processed by the computer, and how they are stored.
---3 different DBMS Software---


3 Examples of data types in DBMS

STRING

• Character string, has a fixed size up to 64 Kbytes.

POINTER

• This field is a pointer to a record in another Class. Physically it contains the sub-Class record number. Size can be from 1 to 4 bytes. Having pointers makes ConteXt somewhat different than traditional DBMS systems. Connection between tables in relational databases is done through the common indexing of two tables with common keys. In this case, the keys must be present in both tables, which means size overhead. To perform search for related records in two tables both indexes are needed. In ConteXt there is no need to search. The number of a record in a sub Class is contained in the field of the main Class. (Terms "main Class" and "sub-Class" in the future will only be used for clarity, but in reality all Classs in ConteXt are equal.) Since there are no keys, the performance is much better In this case it is important to understand that fields are not linked together, only records. The field simply points to a record.

VARIANT

• It is an even more exotic field type. The standard POINTER field can only link two Classs. The value of a POINTER field is the sub-Class record number. The name of this sub Class is contained in the header of the main Class. At times there is a need to have the POINTER to several different Class. EXAMPLE: There is a "CHECK" Class with "PAY_TO" field. A check made out for supplies will have the pointer point to "SUPPLIES", whereas a payment for employee salaries will use the pointer to "STAFF" Class, etc. VARIANT consists of two ponters, the first points to a name of the sub Class the second to a record in this Class.

MVvsdataF

Memory Variable

The memory of a computer is organized into a regular pattern of containers for information. These containers for information are called "words". Each one has a numeric address and each one is the same size as each of the others. For most applications, it is inconvenient to refer to portions of memory by their numeric addresses, so programming languages allow us to allocate portions of memory by name. When we store information in the memory of a computer we need to decide on how much we need for various purposes and on how it will be organized. Programming languages provide mechanism for "types" of information in memory. They also provide mechanisms to identify repetitive arrays of items of the same type and to aggregate possibly heterogeneous types under a common name.

 

Portion of word	Number of bits
nibble	4
character	8 or 16
byte	8
octet	8
half-word	16
word	32

The ambiguity on the size of characters is because we are in a time of transition to richer and more complex character sets for which the limit of 256 characters imposed by an 8-bit character size is inappropriate. We may also be starting on a transition to 64-bit words. Time will tell.

Data Field

A data field is a place where you can store data. Commonly used to refer to a column in a database or a field in a data entry form or web form.

The field may contain data to be entered as well as data to be displayed.

The data-store is composed of a number of data records which are, in turn, composed of a number of predefined data fields. Each of these data fields must be defined within the Load Definition File with a unique name.

TEMCONTRAST

Information vs Data
-information as a concept has a diversity of meanings, from everyday usage to technical settings.
Generally speaking, the concept of information is closely related to notions of constraints,
communication, control, data, form, instruction, knowledge, meaning, mental stimulus, pattern, perception, and representation.
-data are pieces of information that represents the qualitative or quantitative attributes of a variable or set of variables.


Computer Storage vs Computer Data Storage
-computer storage; memory, components, devices and media that retain digital computer data used for computing for some interval of time.
Any data storage device; that records(stores) or retrieves (reads) information(data) from any medium itself.
-computer data storage, often called storage or memory, refers to computer components, devices, and recording media that retain digital data used for computing for some interval of time.


Operating System vs Computer System
-operating system(commonly abbreviated to either os or o/s) is an interface between hardware and user; it is responsible for the management and coordination of activities and the sharing of the resources of the computer.
-computer system - A complete, working computer. The computer system includes not only the computer, but also any software and peripheral devices that are necessary to make the computer function. Every computer system, for example, requires an operating system.

Primary Storage
1. RAM -Random Access Memory
-has no exact order
2. ROM
3. Cache Memory - Buffer
4. Virtual Memory - Extended memory
- Emulate the RAM

Secondary Storage
1. Hard Disk Drive
2. Flash Drive
3. Floppy Disk
4. Compact Disc
5. Digital Video Disc

Tertiary Memory
1. Zip Drive
2. External Drive

SORTS

1. Personal - Data structures is a subject that discussing about stacks, trees, queues, arrays & lists. Data atrre the gathered information on what you had experienced or on what you had studied. The data will be arrange precisely to become a useeful one. It must be understandable to be able for the reader to apply the information. Arranging the data on its precised manner will be called the structure so therefore data structure will become an information. The information will be stored so that we can retrieve it easily or immediately when it is needed.

2. http://en.wikipedia.org/wiki/Data_structure

A data structure in computer science is a way of storing data in a computer so that it can be used efficiently. It is an organization of mathematical and logical concepts of data. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.

3. http://www.itl.nist.gov/div897/sqg/dads/HTML/datastructur.html

Definition: An organization of information, usually in memory, for better algorithm efficiency, such as queue, stack, linked list, heap, dictionary, and tree, or conceptual unity, such as the name and address of a person. It may include redundant information, such as length of the list or number of nodes in a subtree.

4. http://www.webopedia.com/TERM/D/data_structure.html

In programming, the term data structure refers to a scheme for organizing related pieces of information. The basic types of data structures include:
files, list, arrays, records, trees, tables. Each of these basic structures has many variations and allows different operations to be performed on the data.

5. http://en.wikibooks.org/wiki/Data_Structures

This book is about the creation and analysis of efficient data structures. This book covers:
the primitive node structure;
asymptotic notation for mathematically discussing performance characteristics;
built-in arrays;
list structures built from either nodes or arrays;
iterators as an abstract model of enumerating the items in a sequence;
stacks and queues for computing with last-in/first-out and first-in/first-out orderings;
binary and general tree structures for searching or representing hierarchical relationships;
min and max heaps for representing ordering based on priorities;
graph structures for representing more general relationships between data elements;
hash tables for the efficient retrieval of strings and other objects; and finally
trade-offs between the structures, and strategies for picking the most appropriate ones.
To understand the material in this book you should be comfortable enough in a programming language to be able to work with and write your own variables, arithmetic expressions, if-else conditions, loops, subroutines (also known as functions), pointers (also known as references or object handles), structures (also known as records or classes), simple input and output, and simple recursion.
Because many different languages approach the construction of data structures differently, we use pseudo-code so that you can translate the code into your own language.

6. http://en.wikibooks.org/wiki/Data_Structures/Introduction

Data Structures
Computers can store and process vast amounts of data. Formal data structures enable a programmer to mentally structure large amounts of data into conceptually manageable relationships.
Sometimes we use data structures to allow us to do more: for example, to accomplish fast searching or sorting of data. Other times, we use data structures so that we can do less: for example, the concept of the stack is a limited form of a more general data structure. These limitations provide us with guarantees that allow us to reason about our programs more easily. Data structures also provide guarantees about algorithmic complexity — choosing an appropriate data structure for a job is crucial for writing good software.

7. http://searchsqlserver.techtarget.com/sDefinition/0,,sid87_gci804744,00.html

- A data structure is a specialized format for organizing and storing data. General data structure types include the array, the file, the record, the table, the tree, and so on. Any data structure is designed to organize data to suit a specific purpose so that it can be accessed and worked with in appropriate ways. In computer programming, a data structure may be selected or designed to store data for the purpose of working on it with various algorithms.

8. http://www.answers.com/topic/data-structure

A means of storing a collection of data. Computer science is in part the study of methods for effectively using a computer to solve problems, or in other words, determining exactly the problem to be solved. This process entails (1) gaining an understanding of the problem; (2) translating vague descriptions, goals, and contradictory requests, and often unstated desires, into a precisely formulated conceptual solution; and (3) implementing the solution with a computer program. This solution typically consists of two parts: algorithms and data structures.

9. DATA STRUCTUREA logical arrangement of data used by a specific computer system for data management, storage, and retrieval. It includes a reference linkage system between data items. The logical and physical way of organizing digital data in a database.Interrelationship among data elements that determine how data is recorded, manipulated, stored, and presented by a database. An organization in software of data that allows more optimal searching, categorizing, or storage of information.Examples: matrix, stack, queue, dequeue, list, vector, scene graph.

10. http://courses.csail.mit.edu/6.851/spring07/

Data structures play a central role in modern computer science. You interact with data structures much more often than with algorithms (think of Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms.

Other Definition of Data Structures
1.
Data structures provide a way to organize the data for your program in a way that is efficient and easy to use. For example, in an air combat game, there would likely be a data structure keeping track of the thirty missiles your plane has fired, the six other planes in your squadron, and the fifty alien ships that you are trying to shoot down. There are many different data structures that might be used to keep track of these objects, each of which is suited to organizing the data differently. This article is the first in a series that is intended to be a guide to using data structures in games, and should help you decide which data structure is best suited for a task. The articles are designed to be at an introductory level. However, the series also contains examples of applications of data structures to games, so programmers who are strong in other areas, but with little game experience, may benefit as well.
2.
One thing that's important to note about all of the data structures that have been discussed so far is that none of them are well suited to searching their contents. For example, say we have a collection of players in our game. We want to find the player named "Bob" in that collection, because we have just aimed a gigantic missile attack at him. Every one of the collections so far will take O(n) time to find Bob: they all have to go through their contents from beginning to end, checking each player to see if he has the desired name. In many cases, it can be desirable to quickly search through an entire collection to see if an element exists, or to jump straight to an element you know exists. The .NET Framework provides this with the Dictionary.
3.
The decision of which data structure to use, then, boils down to an analysis of how the data is likely to be used. To use the previous example of an air combat game, how often will you need to add new missiles? Will they be added every frame, or is the number of missiles a constant? How will you examine the data that makes up a missile? Will you always access missiles one after another, or will you need access to any missile at any time? Once you have a sense of how your data is likely to be used, you can decide which data structure is appropriate.

1. http://www.cs.utexas.edu/users/novak/datastr.html

Describing the Structure

The Automatic Programming Server produces versions of generic procedures that are specialized for your data structures. This document tells how to describe your data structures to the system.
When you start the Automatic Programming Server, it creates a window containing an input area and a command menu. Click the mouse in the input area, then enter the description of your data; the input editor is an Emacs subset. After the description of your data structure is complete, click the mouse outside the input area; the system will respond with a confirming message. Repeat the process as needed to define other data types.

2. http://www.wipo.int/pctdb/en/wo.jsp?wo=2002097632

Data accomodation for new data entries

The present invention provides a storage means to store digital data entries, chronometer means arranged to provide chronological information to the device, and data entry arrangement means to manipulate data entries, wherein the data entry arrangement means is configured to utilise the chronometer means to provide a chronological data entry coding to data entries based on the chronological sequence in which the data entry is stored on and accessed from the data storage means, and wherein the data entry arrangement means is further configured to analyse the data entry chronological data coding and based on the coding, compress the data entry during a data entry compression cycle.

3. http://www.gottagetarecovery.com/

Data Retrieval

A hard drive, or hard disk drive (HDD), is the storage device you use in your personal computer (PC). These are non-volatile storage devices used to store the data of your computer?meaning you can be assured that whatever data is stored in these devices, it cannot easily be erased. However, there is no guarantee that your HDD would not encounter problems causing it to crash and causing you to eventually loose your data. Inside the HDD, there are many mechanisms that move around to perform read and write functions. The HDD is made of rotating platters, commonly called disks. Each of these platters has a planar magnetic surface where the data is stored. This data is sent to a read-write head, which sends an electrical charge, executing the transaction. These moving parts and electrical charges could possibly cause the breakdown of your HDD, but manufacturers have already designed firmware into the HDD to allow more efficient scheduling of reads and writes if the HDD surface and the remapping of sectors of the disk fail. Also, HDD manufacturers have collaborated with motherboard makers in developing the Self-Monitoring, Analysis, and Reporting Technology, or S.M.A.R.T., that can warn you of possible failures, allowing you to make necessary backups before data loss occurs.

Stack Data Structure

The process or steps involved in consecutively accommodating the following data into stack is this....
Push: Data_1
Push: Data_2
Push: Data_3
Push: Data_4
Pop: Data_4
Pop: Data_3
Pop: Data_2
Pop: Data_1
Done ;-)