Home
Subjects
Textbook solutions
Create
Study sets, textbooks, questions
Log in
Sign up
Upgrade to remove ads
Only $35.99/year
Science
Computer Science
Databases
chapter 4
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
data modeling
Terms in this set (37)
agent (REA model)
"who" associated with events, ex: both a salesperson and a customer participate in creating a merchandise sale
business events (REA model)
events which do not affect financial statements but can impact an organization in an value-added way, ex: sales order
cardinalities
a notation reflecting the nature of relationships among entities as one-to-one, one-to-many, none-to-one, none-to-many, or many-to-many
child record
the lower level record of two adjacent records in a hierarchical data structure
data dictionary
description of the data fields in each database record of a database system
data hierarchy
storing data electronically in the following ascending order: bit, character, data field, record, table, database
data integrity controls
edit tests contained in the software used to create databases that guard databases from erroneous data entries
data modeling
term used to describe the process of designing databases
data type (access data field)
similar to data format, specifies whether data is, for example, numerical, text or currency
database
large collection of related data that are typically stored in computerized, linked files and manipulated by specialized software packages called data management systems
database administrator
person responsible for supervising the design, development, and installation of a large database system; this person is also responsible for maintaining, securing and revising the data within the database system
database management system
separate software system that enables users to create database records, delete records, access specific information, query records for viewing or analysis, alter database information, and reorganize records as needed
economic events (REA model)
events which impact an organization's financial statements, and AISs therefore record data about them in accounting transactions, ex: sale on account
entity (REA model)
data about objects of interest contained in databases including business and economic events, plus information about "who" and "what" were involved in those activities
entity relationship diagram
graphical documentation technique used by database designers to depict database elements and their direct relationships
Recommended textbook explanations
Introduction to Algorithms
3rd Edition
Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen
709 explanations
Introduction to the Theory of Computation
3rd Edition
Michael Sipser
389 explanations
Starting Out with Java: From Control Structures through Objects
6th Edition
Tony Gaddis
1,223 explanations
Python Programming: An Introduction to Computer Science
2nd Edition
John M Zelle
484 explanations
Sets with similar terms
Computer Concepts 2014 (Parsons; Oja) Chapter 11:…
52 terms
Ch.11A
32 terms
Chapter 11 - Databases
82 terms
Computer Concepts 2012 - Chapter 11
79 terms
Sets found in the same folder
chapter 15
46 terms
EPIC CLN250 Chapter 6
11 terms
EPIC - Frequently Heard Terms
85 terms
Physician 100 Flashcards-Lesson 1 ?
186 terms
Other sets by this creator
crime and violence part 2
26 terms
crime and violence final part 1
17 terms
strategy under uncertainty
12 terms
chapter 13
15 terms
Verified questions
COMPUTER SCIENCE
Prove that if p is prime and 0 < k < p, then p│(p k). Conclude that for all integers a and b and all primes p, $$ (a + b)^p ≡ a^p + b^p $$ (mod p).
COMPUTER SCIENCE
For any integer k > 0, an integer n is a kth power if there exists an integer a such that $$ a^k = n $$ , Furthermore, n > 1 is a nontrivial power if it is a kth power for some integer k > 1. Show how to determine whether a given β-bit integer n is a nontrivial power in time polynomial in β.
COMPUTER SCIENCE
In this problem, we will develop a new algorithm for finding minimum spanning trees. It is based upon the following property:Pick any cycle in the graph, and let e be the heaviest edge in that cycle. Then there is a minimum spanning tree that does not contain e. (a) Prove this property carefully. (b) Here is the new MST algorithm. The input is some undirected graph G = (V, E) (in adjacency list format) with edge weights $\left\{w_{e}\right\}.$ $$ \begin{matrix} \text{sort the edges according to their weights}\\ \text{for each edge $e \in E,$ in decreasing order of $w\_{e}:$}\\ \text{if e is part of a cycle of G:}\\ \text{G = G − e (that is, remove e from G)}\\ \text{return G}\\ \end{matrix} $$ Prove that this algorithm is correct. (c) On each iteration, the algorithm must check whether there is a cycle containing a specific edge e. Give a linear-time algorithm for this task, and justify its correctness. (d) What is the overall time taken by this algorithm, in terms of |E|?
COMPUTER SCIENCE
What types of networking does Windows support? How does Windows implement transport protocols? Describe two networking protocols.
Other Quizlet sets
Architecture History Exam 4 Short Answers
22 terms
Skeletal System
64 terms
AP HUG - Chapter 2 Population Study Guide - IN PRO…
48 terms
CPR
12 terms