Chng 5

M T THNG TIN TRONG HTTTL

56

Mc m t thng tin

H5.1 Mc m t thng tin

Nhng MHDL HTTTL Mt CSDL HTTTL th hin mt kha cnh th gii thc. Mi CSDL HTTTL l mt tp hp ca d liu c lin quan ti khng gian, nhng s kin phn nh thc t. Ta c khi nim: M hnh (Model) l mt tp hp cc nguyn tc m t nhng d liu c t chc hp l trong CSDL, i khi n ng c nhng ch thch, ch gii m t d liu v tp hp nhng thao tc vn hnh d liu ny

57

Trong HTTTL, chng ta s dng MHDL xy dng m hnh my tnh trnh by nhng mt kha cnh ca th gii thc m chng ta quan tm.

MHDL s dng trong HTTTL

Qu trnh t chc thng tin lin quan vi qu trnh t chc d liu (miu t, biu din th gii thc bng cch s dng d liu). Mc thp nht ca m t thng tin c s dng thut ng m hnh d liu-MHDL (Peuquet, 1991). C nhiu MHDL c s dng trong HTTTL, gm: M hnh tng qut
M hnh m ng (Spaghetti model)

MHDL c bn (Basic data models)

Vector Raster

M hnh khng gian (Spatial models)

M hnh hnh hc phng. M hnh topology phng

M hnh b mt - (Surface models)

M hnh s cao-(Digital Elevation Models -DEMs) M hnh mng tam gic (Triangular Irregular Network -TIN)

M hnh ton hc-(Mathematical models) M hnh khi nim-(Conceptual models)

M hnh Thc th - mi quan h (Entity-Relationship (ER))
58

 M hnh Thc th - mi quan h nng cao (Enhanced Entity-

Relationship (EER))
M hnh thc thi (An implementation model) M hnh quan h-(Relational model)

M hnh ng ngha (Semantic models)

M hnh hng i tng (Object-oriented model) M hnh chc nng (Functional model)

Nhng m hnh c th bc-(Hierarchical models)

quadtrees, strip trees

M hnh c quyn (Proprietary models)

Arc/Info ERDAS Geovision Grass Caris DBMS based Ingres Oracle Postgres

Mt s m hnh s c ni ti trong sch ny, phn ln chng l nhng MHDL m t.

59

HTTTL gm nhng m hnh m t nhng kha cnh la chn ca th gii thc. Thc t khng c gii hn nhng kha cnh ny, v vy khng c gii hn v nhng MHDL . Do vy, ngha MHDL l s hu ch ca n. Cu trc d liu Mc cao hn MHDL l cu trc d liu, lin quan vi thit k v qu trnh t chc thng tin. Th hin nh hng t chc d liu thng lin quan ti phn mm khng xem xt phn cng. Cu trc file Th hin nh hng phn cng ca d liu, lu tr vt l d liu trong mt s loi nh cng, bng t hay lin quan ti phn cng c lp no .

Cu trc d liu m t
Cu trc d liu m t th hin thit k v thc hin ca qu trnh t chc thng tin phi thuc tnh khng gian (non-spatial data). Nh phn ln cc h thng thng tin thc hin ngy nay da trn m hnh CSDL Quan h- relational v hng i tng object-oriented. Cu trc d liu quan h

60

5. 3 Cu trc d liu quan h

c im cu trc d liu quan h (Hnh 5.3) Mi quan h l mt tp hp (k hiu, biu tng, c im ca mt yu t) tng ng nh nhng hng trong bng. S lng ca tp hp ca yu t trong mi quan h c gi l phn t. Cc phn t to nn thuc tnh ca i tng tng ng vi ct trong bng S lng thuc tnh gi l mc Mi mi quan h xc nh duy nht gi l kha gc. Kha gc l ct hay phi hp ct sao cho gi tr mt hng c cng PK l duy nht, iu ny cho php s dng PK lin kt d liu trong nhng bng khc nhau.
61

 Nhng bng d liu khc c cng kha gc nhng c gi l kha ngoi foreign keys . m bo tnh ton vn d liu, mi quan h phi chun ha v da trn dng chun ha. Cu trc d liu hng i tng (Object-oriented data structure)

Hnh 5.4 Cu trc d liu hng i tng

Khng ging m hnh quan h, there is not a formalized object-oriented data structure Cu trc da trn s thc hin cc hng i tng khc nhau s c cu trc khc nhau, c th gii thch trong thut ng tng qut khi nim tnh xc nh62

object identify, Cu trc-object structure v type constructors (Elmasri and Navathe, 1994) Mt i tng phc tp c cu trc t nhng i tng n gin. Mi i tng c xem nh 3 phn (i, c, v) trong : i = Xc nh duy nht (he object's unique identifier (OID)) c = Cu trc (ch ra c ch to ra gi tr i tng) v = gi tr i tng (object value)

MHDL khng gian

C hai m hnh c bn biu din thnh phn khng gian ca thng tin a l l raster v vector.

63

Hnh 4.8 M hnh raster v vector biu din Th gii thc

M hnh Raster (Raster model) M hnh raster da trn h thng hin th, nh v v lu tr d liu a l bng cch s dng ma trn li (cell). Nhng biu din ta ca mi pixcel l trung tm (centroid) ca n. Ln lt mi cell hay pixel c nhng thuc tnh d liu ring bit c gn cho chng. phn di d liu raster ty thuc vo kch c pixel hay kch c li, c th t vi milimet ti nhiu kilomet. M hnh raster l nhng d liu mng hai chiu (two-dimensional), cc thng tin khc nhau c lu tr nh lp ph rng (forest cover), kiu t (soil type), s dng t (land use), mi trng t t (wetland habitat), hay nhng kiu d liu khc.
64

Vi m hnh raster, din tch nghin cu c chia thnh li u n ca nhng , gm cc hng v ct, to pixel t nh t gc tri trn. M hnh Vector (Vector model) M hnh vector l m hnh "im-ng-vng" biu din cc i tng dng im, ng v vng. H ta cac (Cartesian coordinates) (v d x, y) v nhng thut ton my tnh v ta xc nh nhng im c s dng trong h thng vector. Nhng ng hay cung l mt chui cc im. Din hay vng (polygon) l cng lu tr nh th t cc im, nhng im u v cui c cng v tr, din c ng kn v xc nh.

Cu trc d liu ha (Graphical data structures)

Cu trc d liu Raster (Raster data structure)

65

Cu trc d liu Raster

Trong Cu trc d liu Raster khng gian c chia nh thnh nhng li (vung) u n hay li bit nh nhng yu t nh-picture elements (pixels). V tr mi xc nh s hng v s ct ca n. Din tch i din mi xc nh phn di khng gian ca d liu. V tr yu t a l ch xc nh bi pixel gn nht. Gi tr lu trong mi li ch th nhng kiu i tng, hin tng hay iu kin tm thy trong chng v tr ring bit. Nhng kiu gi tr khc nhau c th m ha: s nguyn (integers), s thc (real numbers) v th t.
66

 Gi tr nguyn thng l m s i tng, tham chiu ti tn trong bng lin kt (gi l look-up table) hay ch dn. Nhng thuc tnh khc nhau cng mt v tr c lu tr trong nhng ch khc nhau hay nhng lp for example, raster data pertaining to the soil type, forest cover and slope covering the same area are stored separately in a soil type theme, a forest cover theme and a slope theme there are several variants to the regular grid raster data structure, including: irregular tessellation (e.g. triangulated irregular network (TIN)), hierarchical tessellation (e.g. quad tree) and scan-line (Peuquet, 1991) Mt cch tng qut, d liu raster i hi t x l hn d liu vector, nhng n s dng nhiu khng gian lu tr trong my tnh hn. Trong k thut vin thm, qu trnh qut ca b cm nhn (sensor) trn v tinh lu tr d liu dng raster. M hnh a hnh - Digital terrain models (DTM) v m hnh s cao-digital elevation models (DEM) l nhng v d d liu raster (Koeln et al 1994 and Huxhold 1991).

67

Hnh 4.5 Raster biu din th gii

Cu trc d liu Vector (Vector data structure) H thng vector c kh nng phn gii rt cao ( 0.001 inch) v in n xut bn tng t nh bn lm bng tay. H thng ny lm vic tt vi phng v, khong cch v nhng im, nhng n i hi nhng cu trc phc tp v t tng thch vi d liu v tinh (remote sensing data). D liu vector cn t khng gian lu tr v duy tr mi quan h hnh hc d dng.

68

Hnh 4.6 Vector biu din th gii (Koeln et al 1994; and Huxhold 1991)

C nhiu cu trc d liu vector, bao gm:

Spaghetti
Spaghetti

C l n gin nht trong cc m hnh HTTTL l m hnh spaghetti model, V bn cht l m hnh v bn , vi chng nhng im, ng v nhng chui k t c biu din n thun l v tr. Hu nh khng c m t r rng cu trc Topology. Ranh gii chung gia 2 polygon k nhau c ghi 2 ln.
69

M hnh ny khng hu hiu trong phn tch khng gian, tuy nhin n rt hu hiu trong vic ti sn xut bn s m khng cn lu tr quan h khng gian.

Hnh 4.9 MHDL Spaghetti

M hnh (line-for-line) tng t nh bn giy thng l d liu tm thi trong s ha.

70

Spaghetti

Hierarchical (cu trc phn cp)

71

hierarchical

72

Hnh 4.3 MHDL phn cp

Topological (cu trc hnh hc)

Cu trc d liu vector tr gip mc ch duy tr mi quan h khng gian bng cch lu gi thng tin lin k nhau.

73

topological

M hnh topology c s dng rng ri trong vic m ha cc mi quan h khng gian. Topology l phng php ton hc c dng nh ngha cc quan h khng gian. Mt s khi nim trong m hnh topology trong phn mm ArcInfo: Arc (cung): chui cc im bt u v kt th ti node. Node (im nt): - L im giao nhau ca 2 hay nhiu arc. - im kt thc 1 arc
74

- im ring bit Polygon (vng): l chui khp kn ca cc arc th hin ranh gii ca vng. Topology c ghi trong 3 bng d liu cho 3 loi yu t khng gian: polygon, node v arc. D liu v ta c ghi trong bng th t. D liu thuc tnh thng c lu tr trong cc bng quan h, trong 1 trng cha ID ca i tng khng gian. u im: Phn tch khng gian c thc hin khng s dng d liu ta , gim thi gian phn tch. Nhc: Cp nht ha m hnh topology mt nhiu thi gian.

Hnh 4.10 node topology

75

Hnh 4.11 arc topology

76

Hnh 4.12 polygon topology

4.3. So snh h thng Raster v Vector (Vector hay Raster?)

PP Thun tin
Cu trc n gin Tng thch vi d liu v tinh v Raster d liu nh qut. Chuyn i h thng ta kh khn Qui trnh phn tch khng gian n gin. Rt kh m t mi quan h hnh hc Cu trc phc tp Yu cu lu tr t Vector Mi quan h hnh hc c duy tr To nhng bn in p Khng thch hp d liu vin thm Phn cng v phn mm rt t tin Mt s phn tch khng gian rt kh khn. phn tch chng lp cc bn vector (Overlaying) mt nhiu thi gian 77

Khng thun tin

Yu cu lu tr nhiu trn my tnh Ty thuc vo kch c pixel, sn phn in n khng p

So snh hai m hnh, cu hi c t ra khng phi l m hnh no l tt? m l di iu kin no th ci ny tt hn ci kia?. Tr li cu hi th hai, chng ta xem xt bn vn :
chnh xc ta . coordinate precision Tc x l. speed of processing Nhng yu cu lu tr. storage requirements Kiu ca d liu i din. type of data being represented

5.4 Cu trc d liu quan h a l (The georelational data structure)

CTDLQHL c pht trin iu khin, x l d liu a l: N cho php lin kt, kt hp gia khng gian (graphical) v d liu phi khng gian (non-spatial) (m t). N l cu trc s dng cc phn mm vector HTTTL. C d liu khng gian v phi khng gian lu tr trong nhng bng quan h.
D liu im, ng, vng lu tr trong nhng bng thuc tnh ring

bit (separate feature attribute tables (FAT) (Hnh )

78

Nhng yu t ha c bn

79

Cu trc d liu quan h a l

Trong FAT, mi thc th gn duy nht feature identifier (FID) Thng tin hnh lu tr dng phng php tng t cu trc d liu hnh hc m t bn trn. D liu phi khng gian lu tr trong nhng bng quan h o Nhng thc th khng gian v nhng bng quan h phi khng gian lin kt bng FID cchung (hnh)

80

4.1. T chc d liu thuc tnh

HTTTL s dng m hnh raster v vector m t v tr, nhng nhng bn ghi v nhng hin tng th gii thc theo tng v tr v nhng thuc tnh v chng c biu din nh th no ?. HTTTL d cung cp mi lin kt gia d liu khng gian v phi khng gian. Nhng mi lin kt ny lm cho HTTTL thng minh "intelligent", hn na ngi s dng c th lu tr v kim tra thng tin v Ci u ?where things are? v Chng l ci g-what they are. D liu khng gian-Spatial Data <<< >>> Phi khng gian (Non-Spatial Data )
81

Yu t a l-Geographic Features <<< >>> Thuc tnh-Attributes C th khi qut y l mi quan h gia: V tr biu tng <<< >>> ngha chng Trong h thng raster, nhng k hiu l v tr li trong ma trn. Trong h thng vector, nhng k hiu nh v c th l im, ng (line), curve, boundary, or vector; hay vng: area, region, hay polygon. Mi lin kt biu tng v ngha ca chng l vic gn cho bt k mt yu t a l t nht mt ngha xc nh, tn hay ch s gi l ID ca n, d liu phi khng gian ca yu t thng lu tr trong mt hay nhiu file ring bit theo s ID ny. Thng tin v tr c lin kt ti nhng thng tin xc nh trong CSDL.

82

Hnh 4.1 Ni kt d liu khng gian v thuc tnh

83