2017/11/16
Methods & Forms of Data Visualization Chapter Exam
Methods & Forms of Data Visualization
Chapter Exam
Question 1
Which of the following is NOT an example of data visualization?
Text on a we
The Relational Model
1
Overview
Conceptual design (last chapter)
Understand the data storage and access requirements
No direct relationship with database technologies
ER Model
Logical design (thi
Entity Relationship Model
Overview
Database design is essentially to decide the set of tables needed to
store all the data in the underlying applications;
capture the relationships among data.
Des
Relational Algebra
1
Overview
Query languages (e.g. SQL): Allow manipulation and retrieval of
data from a database.
Two mathematical Query Languages form the basis for real
languages (e.g. SQL), and f
COMP7640
Database Systems & Administration
http:/buelearning.hkbu.edu.hk/
Instructors:
Prof. Jianliang Xu and Dr. Zhiwei Zhang
1
Contact Information
Dr. Zhiwei Zhang (Section 1)
Office: RRS 631B
E-m
Computational Geometry
Computational Geometry
Study algorithms for solving geometric problems, arisen in
the fields of computer graphics, robotics, VLSI design,
computer-aided design, etc.
A computa
Data Structures for Disjoint Sets
Suppose we have N distinct items and want to partition the
items into a collection of sets such that:
each item is in a set
no item is in more than one set
Example
Q2: Determining whether any pair of
segments intersects
We use a technique known as sweeping.
In sweeping, an imaginary vertical sweep line passes
through the given set of geometric objects, usually f
Approximation Algorithms
Why approximate algorithms?
Many important problems are NP-complete, but are too
important to abandon merely because obtaining an optimal
solution is intractable.
If a problem
NP-Completeness
O( ): analyze the complexity of algorithm only, but not
problem
Given a problem, O( ) cannot tell us whether or not there
could be a better algorithm for the problem at hand.
Decidable
Online Analytical Processing
1
Agenda
To discuss OLAP operations
SQL vs MDX
2
Data in a Data Warehouse
Taken from E. Lo, B. Kao, W. S. Ho, S. D. Lee, C. K. Chui and D. Cheung. OLAP on sequence data.
Data Warehouse Modeling
Business Intelligence and Decision Support
1
Acknowledgements
Prof E. Turban the author of the textbook
W. H. Inmon the Father of data warehousing
Prof J. Han and Prof Y. Kotid
Decision Making and
Decision Support
1
Characteristics of Decision Making
Groupthink
group members accept the solution without
thinking for themselves can lead to bad
decisions
Evaluating what-if scen
Decision Making and
Decision Support
1
Characteristics of Decision Making
Groupthink
group members accept the solution without
thinking for themselves can lead to bad
decisions
Evaluating what-if scen
COMP3005 Design and Analysis of Algorithms
Pre-requisite Courses:
COMP1210/COMP2015 Data Structures and Algorithms,
MATH1130/MATH1205 Discrete Structures
1
Lecturers:
CHEUNG, Yiu Ming () (up to Octobe
Chapter 5
B-Trees and Binomial Heaps
1
B-Trees
B-tree
a balanced search tree;
designed to work well on magnetic disks or other
direct-access secondary storage devices;
Many database management systems
Greedy Algorithm
The greedy approach constructs a solution to an
optimization problem through a sequence of steps:
COMP3005
make a sequence of choices
each choice is the one that seems best so far, on
Chapter 4: Algorithms in Linear Time
Sorting in Linear Time
Medians and Order Statistics
1
1. Sorting in Linear Time
How fast can we sort n inputs?
Merge Sort
Average Case: (nlgn);
Wost Case: (nlgn).
Chapter 2: Growth of Functions and
Recurrence
Outline of this chapter
Describe growth of functions - a way to describe behavior
of functions in the limit.
How we indict running times of algorithms.
Wh
Chapter 6: Red-Black Trees
Red-black trees
A binary search trees with one extra bit of
storage per node: its color;
Color can be either Red or Black;
Red-black trees ensure that no such path is
more
Chapter 3 Probabilistic Analysis and
Randomized Algorithms
Analyze an algorithm
Best case (the easiest)
Worst Case
Average case (the most difficult)
Why?
This chapter deals with the average
case
1
Th
Algorithm Design and Analysis
Techniques
Dr J. Feng
Email: [email protected]
Office: RRS 723
Tel: 3411 7084
COMP3005
HKBU/CS/JF/2016
1
Warm Up Why study Algorithms?
To run computer programs effic
Dynamic Programming
A class of problems can be mathematically expressed
recursively.
Any recursive mathematical formula could be directly
translated to a recursive algorithm.
Example: compute Fibonacc
Amortized Analysis
Amortized Analysis - a new analysis method
We have seen a number of data structures and analyzed the
worst-case running time of each individual operation.
Sometimes the cost of an o
CHAPTER 9
Data Management Layer
Design
INTRODUCTION
Applications are of little use without data
Data
The data management layer includes:
must be stored and accessed efficiently
Data access and manipu
CHAPTER 10
Human-Computer Interaction
Layer Design
INTRODUCTION
Interface Design defines how the system will interact with
external entities (e.g., customers, users, other systems)
System Interfaces a
CHAPTER 4
Business Process and
Functional Modeling
INTRODUCTION
Now
begin the process of turning the requirements
into functional models
Models
are logical; i.e., independent of how they are
implemen
C H A P T E R
8
8-1
DATA MODELING
AND ANALYSIS
Data Modeling
Data modeling a technique for organizing
and documenting a systems data.
Sometimes called database modeling.
Entity relationship diagram (E
CHAPTER 8
Class and Method Design
INTRODUCTION
Detailed
design is important:
Actual
code can be generated by CASE tools from detailed design
Preexisting classes and components need to be
understood,
CHAPTER 6
Behavioral Modeling
INTRODUCTION
Behavioral
models describe the internal behavior of
a system
Behavioral model types:
Representations
of the details of a business process
identified by use