1 / 64

資料庫系統實驗室

資料庫系統實驗室. 指導教授:張玉盈. Attributes. Relational Database. SNOOPYFAMILY. Male Female. Primary Key. Domains. 利用 SQL 做查詢:. Select NAME From SNOOPYFAMILY Where SEX = ‘ Male ’ ;. Cardinality. 結果:. Tuples. Degree. S. M. H. T. ( a) An image picture. Image Databases.

sturges
Download Presentation

資料庫系統實驗室

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 資料庫系統實驗室 指導教授:張玉盈

  2. Attributes Relational Database SNOOPYFAMILY Male Female Primary Key Domains • 利用SQL做查詢: SelectNAME FromSNOOPYFAMILY WhereSEX = ‘Male’; Cardinality • 結果: Tuples Degree

  3. S M H T (a) An image picture Image Databases (b) The corresponding symblic representation 2D String : x : M<H<T=S y : H=T<M<S

  4. Pe Fr Lucy Marc Linu Char Image Database • 應用層面:辦公室自動化、電腦輔助設計、醫學影像擷取…等等。 • 影像資料庫中的查詢(Queries): • Spatial Reasoning(空間推理) : 在一張影像中推論兩兩物件之間的空間關係。 • Pictorial Query(圖像查詢) : 允許使用者給予特定的空間關係以查詢相對應的影像。 • Similarity Retrieval(圖形相似擷取) : 藉由使用者所提供的資訊在影像資料庫中找尋出最相似的圖形。 (a) An image picture (b) Symbolic Picture

  5. 13 A 1 A %* < B B A 11 A 3 | ]* B B A 8 A 5 [ / B B A 6 A 7 ] /* B B 4 A A 9 % |* B B A 10 2 A = <* B B A 12 [* B Uids of 13 spatial operators

  6. Another View of 169 relations

  7. Contain : A B Inside : B A Partly Overlap : A B 5 Category Relationships(CAB) Disjoin : A B Meet : A B

  8. Decision tree of the CATEGORY function oid , oid > 4 x y T F oid , oid > 2 7 ≦ oid , oid ≦ 10 x y x y T F T F 10 ≦ oid , oid ≦ 13 Contain Join Disjoin x y T F Belong Part_Overlap

  9. a b c d a b c d UID Matrix representation(cont.) a b d c f1

  10. Similarity Retrieval based on the UID Matrix(1) • Definition1 Picture f’ is a type-i unit picture of f, if (1) f’ is a picture containing the two objects A and B, represented as x: A rx’A,BB, y: A ry’A,B B. (2) A and B are also contained in f. (3) the relationships between A and B in f are represented as x: A rxA,B B, and y: A ryA,B B. Then, (Type-0): Category(rx’A,B , ry’A,B) (Type-1): (Type-0) and (rx’A,B =rxA,B orry’A,B =ryA,B) (Type-2): rx’A,B =rxA,B andry’A,B =ryA,B

  11. A B B A type-0(A/*B, A%*B) f(A/B, A/*B) A B B A type-2 (A/B, A/*B) type-1 (A/B, A[*B) 3 type-i similarities

  12. Image Mining: Finding Frequent Patterns in Image Databases Setting the minimum support to ½. Charlie Brown often appears to the right of Snoopy.

  13. Video : Image + Time …… Time Image 1 Image 2 Image 3 Image 4 Image N 範例: 一幕幕的Snoopy影像,編織成一部精彩的Snoopy影片 + + + + +

  14. Multimedia Database - Pictures - Pictures with the depicted texts -Voice -Video - Flow Chart

  15. Spatial Database : Nearest Neighbor Query Where is the nearest restaurant to our location ?

  16. Query Types • 精確比對查詢:哪一個城市位在北緯43度與西經88度? • 部分比對查詢:哪些城市的緯度屬於北緯39度43分? • 給定範圍查詢:哪些城市的經緯度介於北緯39度43分至43度與西經53度至58度之間? • 近似比對查詢:最靠近東勢鎮的城市是?

  17. Difficulty • No total ordering of spatial data objects that preserves the spatial proximity. c c d d a a b b a b c d ? / a c b d ?

  18. Space Decomposition and DZ expression

  19. The Bucket-Numbering Scheme Bigger Smaller (c) (a) the uptrend of the bucket numbers of an object N-order Peano Curve

  20. Example O(l,u) = (12,26) The total number of buckets depends on the expected number of data objects. maximum bucket number: Max_bucket = 63

  21. the data (b) the corresponding NA-tree structure (bucket_capacity = 2) Example

  22. The basic structure of the revised version of the NA-tree

  23. Nearest neighbor of q Query point NN (Nearest Neighbor) NN problem is to find the nearest neighbor of q (query point). q Managed by a Peer

  24. Spatial Databases: KNN Keyword Query Where are the 2 nearest points with keywords B and C?

  25. Road Network Databases: K Nearest Neighbor Query Where are the 3 nearest restaurants?

  26. Spatial Databases: Top-k Spatial Keyword Query Where are the top-1 ‘Snoopy hotel’ near Kaohsiung?

  27. RNN (Reversed NN) The q is the nearest neighbor of the blue points. RNN is a complement of NN problem. Reverse nearest neighbor of q Reverse nearest neighbor of q Query point Reverse nearest neighbor of q q Managed by a Peer

  28. Reverse Nearest Neighbor(RNN) Query means : to obtain the objects which treat the query as their nearest neighbor. • Application : Business strategy Location B Location A Five residents treat Location B as their NN. Three residents treat Location A as their NN. Location B is a better place to run the store. Query q Residents

  29. Reverse Nearest Neighbor(RNN) Query means : to obtain the objects which treat the query as their nearest neighbor. • Application : Traffic police B A Traffic smooth Traffic jam Five cars treat Location A as their NN. Three cars treat Location B as their NN. Location A is a better place to the police for patrol. Query q A Query move Cars

  30. E S Spatial Database : Continuous Nearest Neighbor Query Find the nearest gas stations from the starting point to the ending point.

  31. Spatio-temporal Database What is the traffic condition ahead of me during the next 30 minutes? Where is the available gas station around my location after 20 minutes?

  32. P2P System I want to eat a pumpkin. Who has it? I have it and let’s share it.

  33. Client-server vs. Peer-to-Peer network • Example : How to find an object in the network • Client-server approach • Use a big server store objects and provide a directory for look up. • Peer-to-Peer approach • Data are fully distributed. • Each peer acts as both a client and a server. • By asking.

  34. Data Grids I want File-A. I want File-X. 34

  35. Protein Database Find the patterns from the protein database. 判斷蛋白質所屬家族 判斷蛋白質功能

  36. Data Mining 收銀台 Peanuts Supermarket 大家排隊來結帳 PC 顧客通常在買麵包時也會買牛奶 利用資料挖礦的技術對大家購買的紀錄作分析

  37. Data Clustering 形成三個較為單純群集再做分析較為容易 一組非常雜亂的資料,分析困難 Girl Animal Boy 產生三個相似的群集 找到資料間彼此相似的特性

  38. Example object cluster age income

  39. 從目前的 資料中學習 對新的資料 做準確的 預測分類 GIRLS Classification

  40. ClassificationofUroflowmetryCurves Uroflow patterns: (a) Bell-shaped; (b) Tower-shaped; (c) Staccato-shaped; (d) Interrupted-shaped; (e) Plateau-shaped; (f) Obstructive-shaped.

  41. Sample Training Data

  42. A Complex Decision Tree Predictive power low

  43. A Compact Decision Tree Its predictive power is often higher than that of a complex decision tree.

  44. Subspace Clustering Subspace Cluster : {gene1, gene2, gene3} x {b, c, h, j, e} {gene1, gene3} x {c, e, g, b}

  45. Web DB Profile Interests Profile index Web Pages Matching process Filtered result Recommend the page which introduces “basketball” to those people whose interest is “ basketball ” .

  46. Web Mining

  47. Data Stream Mining 從封包的Stream Data中找出DOS攻擊的IP

  48. Traditional vs. Stream Data • Traditional Databases • Data stored in finite, persistentdata sets. • Stream Data (Big data in cloud) • Data as ordered, continuous, rapid,huge amount, time-varyingdata streams. (In-Memory Databases)

  49. Landmark Window Model … … … time tj+2 t0 t1 t2 t i tj tj+1 W1 W2 W3 Figure 1. Landmark Window

More Related