ARTICLES RE DATABASES
Depending on your job specs, you may work solely with SQL Server, or you may use SQL along with various front-end applications, written in .NET, Java, or Delphi. In such languages, you are accustomed to the concept of reusability. However, SQL developers rarely (if ever) think of re-using databases.
Consider this: You write the same thing over and over—from customers to sales orders to purchase orders and so on. That's the atomic level, but you can abstract this redundancy to even higher levels, such as the modules you typically write for an accounting system: Accounts Receivable, Accounts Payable, Inventory Management, etc. Each module requires a group of tables that don't vary much from customer to customer, or database to database. So why not design them as separate databases?
In part, the answer is deadline pressure. Developers seldom have time to abstract the common objects in our databases. This is where we could learn something from our object-oriented colleagues; they have persuaded management that reusability is both architecturally valid and economically sound. And yet, most of us in the database development and management trenches have not done the same.
It's time we begin thinking about database development in these terms. On a basic level, customers, vendors, and employees have a lot in common. One level up, the way you model addresses (cities, regions, countries) remains pretty much the same despite the particular database. One more level up, sales-order-entry is essentially the same regardless of what you sell.
We can rise above the specifics of a database design in the same way that our object-oriented colleagues have risen above the specifics of a user application. The biggest step in this process is simply deciding that we can do it. Once I realized that the same principles applied to database design and object-oriented design, it only took me about two weeks to load my existing projects into a data-modeling tool and abstract the useful portions. Using the same tool, I can now quickly import simple (i.e., customer table) and complex (i.e., Accounts Receivable) objects into any new database that I create. The gains in development time are amazing.
Two ways to go about re-using databases
There are two ways that you can approach this transition. I'll present with you the pros and cons of each method, but I'll leave it up to you to decide which approach will work best for your situation.
The first approach is to connect to numerous databases, each containing the tables of interest to the particular "object" of interest (such as Accounts Receivable). This means that your production database contains views, stored procedures, and UDFs that address the other databases so the client programs see just one database. The advantage to this approach is that, if you change an object within the Accounts Receivable "object", the virtual database will “inherit” the change. The downside to this approach is that foreign keys don't work across database boundaries; therefore, you must use triggers, which are slower.
The second approach is to import the “object” databases into your current project. The upside is that you can use foreign keys rather than triggers. The downside is that if you change one of the objects, such as the Accounts Receivable model, then you will have to propagate that change manually.
I'll reiterate that you can gain a lot by thinking about your databases as objects. You don't need an object-oriented database to make this transition—you just need a change of perspective.
Thursday, December 10, 2009
Wednesday, November 18, 2009
ASSIGN 01
hieritical vs. relation database
Hieratic is a cursive writing system used in pharaonic Egypt that developed alongside the hieroglyphic system,[1] to which it is intimately related. It was primarily written in ink with a reed brush on papyrus, allowing scribes to write quickly without resorting to the time consuming hieroglyphs. The word hieratic derives from the Greek phrase γράμματα ἱερατικά (grammata hieratika; literally "priestly writing"), which was first used by Saint Clement of Alexandria in the second century AD,[2] as at that time hieratic was used only for religious texts, as had been the case for the previous thousand years.
Relational database
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.
Relational databases are currently the predominant choice in storing financial records, manufacturing and logistical information, personnel data and much more.
Hieratic is a cursive writing system used in pharaonic Egypt that developed alongside the hieroglyphic system,[1] to which it is intimately related. It was primarily written in ink with a reed brush on papyrus, allowing scribes to write quickly without resorting to the time consuming hieroglyphs. The word hieratic derives from the Greek phrase γράμματα ἱερατικά (grammata hieratika; literally "priestly writing"), which was first used by Saint Clement of Alexandria in the second century AD,[2] as at that time hieratic was used only for religious texts, as had been the case for the previous thousand years.
Relational database
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.
Relational databases are currently the predominant choice in storing financial records, manufacturing and logistical information, personnel data and much more.
Thursday, November 5, 2009
Data structure
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.
List of data structures
Trees-a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. It is an acyclic connected graph where each node has a set of zero or more children nodes, and at most one parent node.
A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent.
stacks-a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO). Stacks are used extensively at every level of a modern computer system.
linked list- a linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.
queue-is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position.
arrays-is a data structure consisting of a group of elements that are accessed by indexing. In most programming languages each element has the same data type and the array occupies a contiguous area of storage.
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.
List of data structures
Trees-a tree is a widely-used data structure that emulates a hierarchical tree structure with a set of linked nodes. It is an acyclic connected graph where each node has a set of zero or more children nodes, and at most one parent node.
A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent.
stacks-a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO). Stacks are used extensively at every level of a modern computer system.
linked list- a linked list is one of the fundamental data structures, and can be used to implement other data structures. It consists of a sequence of nodes, each containing arbitrary data fields and one or two references ("links") pointing to the next and/or previous nodes.
queue-is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and removal of entities from the front terminal position.
arrays-is a data structure consisting of a group of elements that are accessed by indexing. In most programming languages each element has the same data type and the array occupies a contiguous area of storage.
SORTS
SORTS
I."Meaning of Data structures" PERSONAL
1.Data structure is a way of storing data in the computer.In using data stucture,the users could easily stores data in the computer.They can also retrieve i easily when they need i.It is a collector of the rraw data.Data stuctue is important so tha we can learn and understand and elaborate the suctue of its algorithm.It is an acual implemantaion of a particular abstract data type.
2.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.Data structure 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.DAta structure is a collection of data components that are constructed in a regular and characteristic way.
5.Data structure 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.
6.Data structure is a group of data elements grouped together under one name. These data elements, known as members, can have different types and different lengths. Data structures are declared in C++ using the following syntax:
7.Data structures are a feature that can be used to represent databases, especially if we consider the possibility of building arrays of them:
8.Data structures play a central role in modern computer science.Interact with data structures much more often than with algorithms. In addition, data structures are essential building blocks in obtaining efficient algorithms.
9.Data structures optimized for external memory, and cache-oblivious data structures. Any problem (e.g., sorting, priority queues) is different when you're dealing with disk instead of main memory, or you care about cache performance. Memory hierarchies have become important in practice because of the recent escalation in data size.
10.Data structure used ot maintain the sequence of characters is an important part of a text editor.
I."Meaning of Data structures" PERSONAL
1.Data structure is a way of storing data in the computer.In using data stucture,the users could easily stores data in the computer.They can also retrieve i easily when they need i.It is a collector of the rraw data.Data stuctue is important so tha we can learn and understand and elaborate the suctue of its algorithm.It is an acual implemantaion of a particular abstract data type.
2.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.Data structure 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.DAta structure is a collection of data components that are constructed in a regular and characteristic way.
5.Data structure 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.
6.Data structure is a group of data elements grouped together under one name. These data elements, known as members, can have different types and different lengths. Data structures are declared in C++ using the following syntax:
7.Data structures are a feature that can be used to represent databases, especially if we consider the possibility of building arrays of them:
8.Data structures play a central role in modern computer science.Interact with data structures much more often than with algorithms. In addition, data structures are essential building blocks in obtaining efficient algorithms.
9.Data structures optimized for external memory, and cache-oblivious data structures. Any problem (e.g., sorting, priority queues) is different when you're dealing with disk instead of main memory, or you care about cache performance. Memory hierarchies have become important in practice because of the recent escalation in data size.
10.Data structure used ot maintain the sequence of characters is an important part of a text editor.
II."Three more other Data stucture"
II."Three more other Data stucture"
1.
A.Deque in computer science theory, a deque (short for double-ended queue—usually pronounced deck) is an abstract list type data structure, also called a head-tail linked list, for which elements can only be added to or removed from the front (head) or back (tail).
B.Data buffer in computing, a buffer is a region of memory used to temporarily hold data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a keyboard) or just before it is sent to an output device (such as a printer). However, a buffer may be used when moving data between processes within a computer. This is comparable to buffers in telecommunication. Buffers can be implemented in either hardware or software, but the vast majority of buffers are implemented in software. Buffers are typically used when there is a difference between the rate at which data is received and the rate at which it can be processed, or in the case that these rates are variable, for example in a printer spooler.
C.Cache in computer science, a cache (pronounced /kæʃ/) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (owing to longer access time) or to compute, compared to the cost of reading the cache. In other words, a cache is a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in the cache, future use can be made by accessing the cached copy rather than re-fetching or recomputing the original data, so that the average access time is shorter.
2.Basic description of DAta structure.
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.Data accomditation in data entry
Computer data processing is any computering process that converts datas into information or knowledge.[1] The processing is usually assumed to be automated and running on a computer. Because datas are most useful when well-presented and actually informative, data-processing systems are often referred to as information systems to emphasize their practicality. Nevertheless, the terms are roughly synonymous, performing similar conversions; data-processing systems typically manipulate raw data into information, and likewise information systems typically take raw data as input to produce information as output
4.Data retrieval is possible only from the HTML-format output document. Spectra may be retrieved individually or in groups, and multiple retrieval of concatenated, high resolution spectra can be restricted to a specific wavelength interval. Spectra are delivered as FITS files, and are easily imported into standard image processing packages such as IDL, IRAF (via the external TABLES package) or MIDAS.
1.
A.Deque in computer science theory, a deque (short for double-ended queue—usually pronounced deck) is an abstract list type data structure, also called a head-tail linked list, for which elements can only be added to or removed from the front (head) or back (tail).
B.Data buffer in computing, a buffer is a region of memory used to temporarily hold data while it is being moved from one place to another. Typically, the data is stored in a buffer as it is retrieved from an input device (such as a keyboard) or just before it is sent to an output device (such as a printer). However, a buffer may be used when moving data between processes within a computer. This is comparable to buffers in telecommunication. Buffers can be implemented in either hardware or software, but the vast majority of buffers are implemented in software. Buffers are typically used when there is a difference between the rate at which data is received and the rate at which it can be processed, or in the case that these rates are variable, for example in a printer spooler.
C.Cache in computer science, a cache (pronounced /kæʃ/) is a collection of data duplicating original values stored elsewhere or computed earlier, where the original data is expensive to fetch (owing to longer access time) or to compute, compared to the cost of reading the cache. In other words, a cache is a temporary storage area where frequently accessed data can be stored for rapid access. Once the data is stored in the cache, future use can be made by accessing the cached copy rather than re-fetching or recomputing the original data, so that the average access time is shorter.
2.Basic description of DAta structure.
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.Data accomditation in data entry
Computer data processing is any computering process that converts datas into information or knowledge.[1] The processing is usually assumed to be automated and running on a computer. Because datas are most useful when well-presented and actually informative, data-processing systems are often referred to as information systems to emphasize their practicality. Nevertheless, the terms are roughly synonymous, performing similar conversions; data-processing systems typically manipulate raw data into information, and likewise information systems typically take raw data as input to produce information as output
4.Data retrieval is possible only from the HTML-format output document. Spectra may be retrieved individually or in groups, and multiple retrieval of concatenated, high resolution spectra can be restricted to a specific wavelength interval. Spectra are delivered as FITS files, and are easily imported into standard image processing packages such as IDL, IRAF (via the external TABLES package) or MIDAS.
MyContrast
MyContrast
1.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.The operating system acts as a hosts for computing applications that are run on machine.
2.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.
3.Data are pieces of information that represent the qualitative or quantitative attributes of a variable or set of variables. Data (plural of "datum") are typically the results of measurements and can be the basis of graphs, images, or observations of a set of variables. Data are often viewed as the lowest level of abstraction from which information and knowledge are derived.
4.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 constraint, communication, control, data, form, instruction, knowledge, meaning, mental stimulus, pattern, perception, and representation.
5.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. Computer data storage provides one of the core functions of the modern computer, that of information retention.
6.A data storage device is a device for recording (storing) information (data). Recording can be done using virtually any form of energy, spanning from manual muscle power in handwriting, to acoustic vibrations in phonographic recording, to electromagnetic energy modulating magnetic tape and optical discs.
1.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.The operating system acts as a hosts for computing applications that are run on machine.
2.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.
3.Data are pieces of information that represent the qualitative or quantitative attributes of a variable or set of variables. Data (plural of "datum") are typically the results of measurements and can be the basis of graphs, images, or observations of a set of variables. Data are often viewed as the lowest level of abstraction from which information and knowledge are derived.
4.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 constraint, communication, control, data, form, instruction, knowledge, meaning, mental stimulus, pattern, perception, and representation.
5.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. Computer data storage provides one of the core functions of the modern computer, that of information retention.
6.A data storage device is a device for recording (storing) information (data). Recording can be done using virtually any form of energy, spanning from manual muscle power in handwriting, to acoustic vibrations in phonographic recording, to electromagnetic energy modulating magnetic tape and optical discs.
Mv vs. DataF
Mv vs. DataF
1.Memory variable-You use the Memory Variables page of the Cold Fusion Administrator to enable application and session variables server-wide. By default, application and session variables are enabled when you install Cold Fusion Server. If you disable either type of variable in the Memory Variables page, you cannot use them in a Cold Fusion application.Memory variable files are a way to store the status of memory variables that are currently stored in memory and use them later in the same program or in another session of Fox Pro.
2.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.
1.Memory variable-You use the Memory Variables page of the Cold Fusion Administrator to enable application and session variables server-wide. By default, application and session variables are enabled when you install Cold Fusion Server. If you disable either type of variable in the Memory Variables page, you cannot use them in a Cold Fusion application.Memory variable files are a way to store the status of memory variables that are currently stored in memory and use them later in the same program or in another session of Fox Pro.
2.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.
MY-ASSIGNMENt
MY-ASSIGNMENt
"Data types"
Abstract data types-In computing, an abstract data type or abstract data structure is a mathematical model for a certain class of data structures that have similar behavior; or for certain data types of one or more programming languages that have similar semantics. An ADT is defined indirectly, only by the operations that may be performed on it and by mathematical constraints on the effects (and possibly cost) of those operations[1].
Algebraic data type-
In computer programming, an algebraic data type (sometimes also called a variant type[1]) is a datatype each of whose values is data from other datatypes wrapped in one of the constructors of the datatype. Any wrapped datum is an argument to the constructor. In contrast to other datatypes, the constructor is not executed and the only way to operate on the data is to unwrap the constructor using pattern matching.
Composite data types-In computer science, composite data types are data types which can be constructed in a program using its programming language's primitive data types and other composite types. The act of constructing a composite type is known as composition
Function types-
Machine data types-All data in computers based on digital electronics is represented as bits (alternatives 0 and 1) on the lowest level. The smallest addressable unit of data is a group of bits called a byte (usually an octet, which is 8 bits). The unit processed by machine code instructions is called a word (as of 2008, typically 32 or 64 bits). Most instructions interpret the word as a binary number, such that a 32-bit word can represent unsigned integer values from 0 to 232 − 1 or signed integer values from − 231 to 231 − 1. Because of two's complement, the machine language and machine don't need to distinguish between these unsigned and signed data types for the most part.
Object types-
In computer science, an object commonly means a compilation of attributes (object elements) and behaviors (methods) encapsulate on an entity.
Objects are the foundation of object-oriented programming, and are fundamental data types in object-oriented programming languages. These languages provide extensive syntactic and semantic support for object handling, including a hierarchical type system, special notation for declaring and calling methods, and facilities for hiding selected fields from client programmers. However, objects and object-oriented programming can be implemented in any langua
Pointer and reference data types-
In computer science, a reference is a value that enables a program to directly access a particular data item, such as a variable or a record, in the computer's memory or in some other storage device. The reference is said to refer to the data item, and accessing that data is called dereferencing the reference.
Primitive data types-In computer science, primitive data type can refer to either of the following concepts:[citation needed]
a basic type is a data type provided by a programming language as a basic building block. Most languages allow more complicated composite types to be recursively constructed starting from basic types.
a built-in type is a data type for which the programming language provides built-in support.
3.What types of 3 dbms software?
A database can be a set of flat files stored on computer tape or disk or it could consist of database tables that are managed by a Database Management System (DBMS).
There are different types of DBMS products: relational, network and hierarchical. The most widely commonly used type of DBMS today is the Relational Database Management Systems (RDBMS).
Some Data Base Management Systems can be accessed directly using programming languages such as COBOL while others provide their own programming language for interacting with the database. Many DBMS applications also provide reporting and query tools to view data in the database.
"Data types"
Abstract data types-In computing, an abstract data type or abstract data structure is a mathematical model for a certain class of data structures that have similar behavior; or for certain data types of one or more programming languages that have similar semantics. An ADT is defined indirectly, only by the operations that may be performed on it and by mathematical constraints on the effects (and possibly cost) of those operations[1].
Algebraic data type-
In computer programming, an algebraic data type (sometimes also called a variant type[1]) is a datatype each of whose values is data from other datatypes wrapped in one of the constructors of the datatype. Any wrapped datum is an argument to the constructor. In contrast to other datatypes, the constructor is not executed and the only way to operate on the data is to unwrap the constructor using pattern matching.
Composite data types-In computer science, composite data types are data types which can be constructed in a program using its programming language's primitive data types and other composite types. The act of constructing a composite type is known as composition
Function types-
Machine data types-All data in computers based on digital electronics is represented as bits (alternatives 0 and 1) on the lowest level. The smallest addressable unit of data is a group of bits called a byte (usually an octet, which is 8 bits). The unit processed by machine code instructions is called a word (as of 2008, typically 32 or 64 bits). Most instructions interpret the word as a binary number, such that a 32-bit word can represent unsigned integer values from 0 to 232 − 1 or signed integer values from − 231 to 231 − 1. Because of two's complement, the machine language and machine don't need to distinguish between these unsigned and signed data types for the most part.
Object types-
In computer science, an object commonly means a compilation of attributes (object elements) and behaviors (methods) encapsulate on an entity.
Objects are the foundation of object-oriented programming, and are fundamental data types in object-oriented programming languages. These languages provide extensive syntactic and semantic support for object handling, including a hierarchical type system, special notation for declaring and calling methods, and facilities for hiding selected fields from client programmers. However, objects and object-oriented programming can be implemented in any langua
Pointer and reference data types-
In computer science, a reference is a value that enables a program to directly access a particular data item, such as a variable or a record, in the computer's memory or in some other storage device. The reference is said to refer to the data item, and accessing that data is called dereferencing the reference.
Primitive data types-In computer science, primitive data type can refer to either of the following concepts:[citation needed]
a basic type is a data type provided by a programming language as a basic building block. Most languages allow more complicated composite types to be recursively constructed starting from basic types.
a built-in type is a data type for which the programming language provides built-in support.
3.What types of 3 dbms software?
A database can be a set of flat files stored on computer tape or disk or it could consist of database tables that are managed by a Database Management System (DBMS).
There are different types of DBMS products: relational, network and hierarchical. The most widely commonly used type of DBMS today is the Relational Database Management Systems (RDBMS).
Some Data Base Management Systems can be accessed directly using programming languages such as COBOL while others provide their own programming language for interacting with the database. Many DBMS applications also provide reporting and query tools to view data in the database.
Wednesday, November 4, 2009
My_Idea_Is
1 Discuss what you have learned and understood about what database Management is?
What I have learned and understood about what database Management is that it is a component of database; that database is a computer program tan can store and manage and the database components are Table,Queries,Forms,Reports,Pages,Marcos,and
Module.
2. Define have each of the following fit and function with in the frame in which of relational DBMS System.
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.
Forms- Allow us to build user friendly interfacefor our users.
Queries- Allow us to view data in different ways.
Reports- Allow us to format data to be printed.
Records- This is the records of your file/data that you save in the computer.
Foreign Key- Defines the important things anywhere in the table.
What I have learned and understood about what database Management is that it is a component of database; that database is a computer program tan can store and manage and the database components are Table,Queries,Forms,Reports,Pages,Marcos,and
Module.
2. Define have each of the following fit and function with in the frame in which of relational DBMS System.
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.
Forms- Allow us to build user friendly interfacefor our users.
Queries- Allow us to view data in different ways.
Reports- Allow us to format data to be printed.
Records- This is the records of your file/data that you save in the computer.
Foreign Key- Defines the important things anywhere in the table.
Subscribe to:
Posts (Atom)
