1 outline of kiwi format kiwi-w consortium e-mail : kiwi-w@mapmaster.co.jp kiwi-w@mapmaster.co.jp
Post on 23-Dec-2015
248 Views
Preview:
TRANSCRIPT
1
Outline of Kiwi Format
Kiwi-W ConsortiumE-Mail : kiwi-w@mapmaster.co.jp
2
Conventional map database structure Database structure which depends on the requirement of
the Application Program
The real world
Map displayData
Positional reference
Data
Route planningData
Refer to data. (2)Application(2)
(positional calculation)
Refer to data. (n)Application(n)
(recommended route planning)
System control program
Database for each function
Application for each format
Database format for each system
Refer to data. (1)
Application(1)(map display)
3
Problem of the conventional map data It is difficult to maintain and renew the data
corresponding to developing of the system.– There’s no inter-operability between new
navigation system and old one.– There’s need to maintain the data corresponding
to the old version of the navigation system
The format is not disclosed– It is used only for navigation system
4
Kiwi format aims…..
To describe the real world To speed-up of data reference To compress the volume of the data To magnify the expandability To enlarge the field of application
5
Data base structure of Kiwi format The real world is described by information related to the shape
of the object, the attribute, and the connection (phase) etc.
The real world
Shape data Attribute data
Application(1)
Common data reference program
Application(2) Application(n)
Standard data format for data exchange
Relation of connection
6
The composition of Kiwi formatIndex Data
Drawing Parameters Data
Voice Data
Image Data
VICS
Main Map Data
Route Planning data
Road DataBackground DataText Data
Route Guidance Data
7
Kiwi format aims…..
To describe the real world To speed-up of data reference To compress the volume of the data To magnify the expandability To enlarge the field of application
8
Speed-up of Data Reference
Main map data (parcel)– Kiwi format refers to the data in a constant
area
Route planning data (region)– Kiwi format refers to the data of wide area
as much as possible
Hierarchical structure– Kiwi format quickly refers to the data which
exist between one level and another, or which exist nearby area
9
Main Map Data
They are used for Map-display, Location, and Route guidance
The area is divided by rectangles (parcel) Data has Hierarchical structure
level 1
level 2
level n
10
Main Map Data Data to be stored
– Management records– Road data
• Figure data and Road attribute data to be used for map-display and location.
• It has traffic regulation information and link connection information so that it may be used for the route calculation
– Background Data• Information containing the data of water etc. for map-display. It has height data as well.
– Text Data• They are used for the appellations in map-display, and appellations of
the road data and background data
– Guidance Data• Appellations of intersection etc. which is referred to intersections data
in Road Data
11
Map Display Data Frame
Map Display Distribution Header
:
Offset/Size of Road Data Frame
Offset/Size of BackGround Data Frame
Offset/Size of Text Data Frame
Road Data Frame
Distribution Header
:
Number of Display Class [ A ]
Offset to Display-class-classified Road Data
Number of MultiLink (for each Display calss)
Road Data List
Array of Display-class-classified Road Data
Display Scale Flag
Array of MultiLink Data Record
:
Back Ground Data Frame Basic Structure is same as Road Data Frame
Text Data Frame Basic Structure is same as Road Data Frame
Extension Data Frame
阪神高速
瀬戸内海
夢前川公園
Text
Road
Back Ground
12
Data Volume:
Data author IdentificationFormat Version NumberData Version Numver
:Management Header Table
:
Management Header Record1Pacel Data Management( )
Management Header Record1Region Data Management( )
Management Header Record1Index Data Management( )
Management Header Record1Drawing Parameters Data Management( )
Management Header Record48 Reserved( )
Management Header Record1Infrastructure Data Management( )
Management Header Record1Image Data Management( )
Management Header Record1Voice Data Management( )
Management Header Record Reserved8( )
Alldata.KwiData Volume
Management Header Table
Each Management Header Record represents position of management data, and size of management data
13
Parcel Data Control Frame
Parcel Data Control Distribution Header
Header Size
Coverage Area
Size of Level Control Record
Size of Block Set Control Record
Size of Block Control Record
Number of Level Control Record [N]Array of Level Control Record ( #1 to #N )
Number of Block Set (for Each Level ) [K]
Number of Block (for Each Level ) [L]
Number of Parcel (for Each Level ) [M]
Array of Block Set Control Record ( #1 to #K )
Address of Block Control Record
Array of Block Control Record ( #1 to #L )
Address of Parcel Control Information
Parcel Control Information
Attribute
Array of Parcel Control Record ( #1 to #M )
Address of Map Display Data Frame
Size of Map Display Data Frame
Array of Route Guidance Control Record ( #1 to #M )
Address of Route Guidance Data Frame
Size of Route Guidance Data Frame
Level 0
Level 1
Level n
Level n-1
:
:
14
Parcel Data Control Frame
Parcel Data Control Distribution Header
Header Size
Coverage Area
Size of Level Control Record
Size of Block Set Control Record
Size of Block Control Record
Number of Level Control Record [ N ]
Array of Level Control Record ( #1 to #N )
Number of Block Set (for Each Level ) [K]
Number of Block (for Each Level ) [L]
Number of Parcel (for Each Level ) [M]
Array of Block Set Control Record ( #1 to #K )
Address of Block Control Record
Array of Block Control Record ( #1 to #L )
Address of Parcel Control Information
Parcel Control Information
Attribute
Array of Parcel Control Record ( #1 to #M )
Address of Map Display Data Frame
Size of Map Display Data Frame
Array of Route Guidance Control Record ( #1 to #M )
Address of Route Guidance Data Frame
Size of Route Guidance Data Frame
Level i
Block Set
Block
Parcel
0
0
0
3
1
2
32
1
31
2
15
Main Map Data
Division and integration of a parcel
level n
level 1
level 2
Kiwi format divides and integrates a parcel into approximately same size of rectangle.
16
Route Planning Data They are used for Route planning The area can be divided into arbitrary size
(region) They have a Hierarchical structure.
Region divisions for each layerTree structure of region management records
Higher level
Lower level
0
0
0
1
23 4
51
2
6
0
0 1
3 41 52
2
0 6
Region number
17
Route Planning Data Data to be stored
– Management records– Information of node
• Information of intersections in road networks• Information which corresponds to upper level
– Link information• Information of road in road networks• Information which corresponds to upper level• Information of connection to border region
– Regulation information• Information of traffic regulation in intersection and
regulation for part of road in intersection
18
Route Planning Data Frame
Route Planning Distribution Header
:Offset / Size of each Data Frame
Node Data Frame
Total Number of Node Records [N]
Array of Node Record ( #1 to # N)
Attribute
Number of Link Record [ K ]
Offset to Link Record
Number of Regulation Record [L]
Link Data Frame
Link Cost Data Frame
Data Frame Corresponding to the Upper Level Node
Passage Code Data Frame
:
Structure of Route Planning Data (1)
Route Planning Data Frame
19
Structure of Route Planning Data (2)
Route Planning Data Frame
Route Planning DistributionHeader
Node Data Frame
Link Data Frame
Array of Link Record [ #1 to #K for each Node ]
Link Cost Record Number
Attribute
Array of Regulation Record [ #1 to #K for each Node ]
Upper Level Correspondence Record Number of the Node
:Link Cost Data Frame
Array of Link Cost Data Record
Link ID
Cost (Ex. Link length , Average Traveling Time ) :
Data Frame Corresponding to the Upper Level Node
Passage Code Data Frame
:
20
Level i
Level i+1Structure of Route Planning Data (3)
Route Planning Data Frame
Route Planning DistributionHeader
Node Data Frame
Link Data Frame
Link Cost Data Frame
Upper Level Correspondence Data Frame of the Node
Number of Nodes Corresponding to the Upper Level [ N ]
Array of Upper Level Correspondence Record of the Node (#1 to #N)
Adjacent Information
Upper Level Node ID Number
Offset to the Upper Level Correspondence Record of the Link
Upper Level Correspondence Data Frame of the Link
Array of Upper Level Correspondence Record of the Link
Passage Code Data Frame
:
21
Kiwi format aims…..
To describe the real world To speed-up of data reference To compress the volume of the data To magnify the expandability To enlarge the field of application
22
Compression of the Volume of the Data Data management by the size of data
– Kiwi format sets the fixed size for each data block and manages whole size of the data
Data management by flags– Kiwi format manages the existence of fluid data by flags
which correspond to bits.
Multi link structure– Kiwi format integrates the roads which have same attribute,
and describe the existence of a intersection.
23
Data-Compression by size or flag ( Example)
Data Frame A
Control Header
Size of Data Frame A
Control Flags 、 Header Size
Size of Data B
Size of Data E
Size of Data F
Expansion Data
Data B ( always stored )Data C ( fixed length , always stored )Data D ( fixed length )Data E
Data F
Expansion Data
Delete flag of Data Frame A
Existence flag of Data D
Existence flag of Data E
Existence flag of Data F
Existence flag of Expansion Data (Data Frame A)
Size of Control Header
24
R o ad A
NA0 NA1 NA2 NA3 NA4 LA0
LA1 LA2 LA3
Attribute B Attribute 1
Attribute B Attribute 3
Attribute B Attribute 4
Attribute C Attribute 5
Attribute BAttribute 2
Attribute A Attribute 0
NA0 NA2 NA4 LA0
LA1 LA2 LA3
Attribute 1 Attribute 2 Attribute 3 Attribute 4
Attribute B
Attribute forindividual link
Common attribute
NA1 NA3
R o ad B
Links
Multilink
Multi LinkLink
Node shape
25
Flags for managements
・ MultiLink Delete Flag
・ Temporal Information
Size of each Infomation
・ MultiLink Data Record
・ MultiLink Header
・ MultiLink Shape Information
・ Additional Node Information
・ Altitude Information
・ Passage Regulation Information
Node Record
Identical Node Infomation
Flags of each Additional Node Infomation
Offset to Additional Node Record
Additional Node Record
:Offset to route guidance data
Offset to Street Name data
Offset to Passage Regulation Information
:
NA0 NA2 NA4 LA0
LA1 LA2 LA3
Attribute 1 Attribute 2 Attribute 3 Attribute 4
Attribute A
Individuallink attribute
NA1 NA3
Detailed attribute
Multilink
MultiLink Data Record
MultiLink Header
Flags for management 、 Size of each Infomation
Number of Nodes (N)
Attribute of MultiLink
MultiLink Shape Information ( Array of Link Shape N)
Attribute of Link ( Example : Number of Shape Point(K))
( X 、Y ) of Node
Array of ( X 、Y ) of Shape Point (K)
Node and Link Connection Information ( Array of Node Record N)
Additional Node Information ( Array of Additional Node Record N)
Altitude Information
Passage Regulation Information
Temporal Information
Expansion Data
26
Kiwi format aims…..
To describe the real world To speed-up of data reference To compress the volume of the data To magnify the expandability To enlarge the field of application
27
The expandability of basic data– Kiwi format prepares the expanding part so that expansion
may not have any effect on the data reference• Kiwi format manages the data by the number of elements
and the volume of the data• Kiwi format controls the expansion by the flags which
correspond to the bits– The expandability enables Kiwi format to expand in the
future and to store the individual data by each manufacturers
The structure of file– Kiwi format enables each manufacturers to store the
individual data.• Html
The Expandability of the Data
28
How to store expansion data( Example)
Data Frame A
Control Header
Size of Data Frame A
Control Flags 、 Header Size
Size of Data B
Size of Data E
Size of Data F
Expansion Data
Data B ( allways Stored )
Data C ( fixed length, allways stored )
Data D ( allways stored )
Data E
Data F
Expansion Data
Delete flag of Data A
Existence flag of Data D
Existence flag of Data E
Existence flag of Data F
Existence flag of Extension Data (Data Frame A)
Size of Control Header
Control by Size
Control by Size and Flag
29
Data Frame A
Control Header
:
Offset and Size for each Basic / Extension Data Frame
Basic Data Frame 1 ( Define Format )Basic Data Frame 2 ( 〃 )Basic Data Frame 3 ( 〃 )Extension Data Frame 1 ( Undefined Format )Extension Data Frame 2 ( 〃 )
Control Frame of Data Frame A
:
Number of Basic / Extension Data Frame
Address / Size of Data Frame A
How to store original data (Example)
Extension Data Frame 1
User ID
Data ID
Original Data
Extension Data Frame 2
User ID
Data ID
Original Data
cf.
30
The Structure of Physical Data
All datamanagement frame
Root directory( Address
Map )
Area
ISO9660( Volume )
KIWI format file
Metadata
DSA to main mapmanagement frame
Main map data management frame
Route planning datamanagement frame
DSA to route planning data frame
Main map dataRoute planning
data・・
Data Volume
Start-up record
Root Directory
Loading
Directory
DirectoryPointer to
ALLDATA.KWI
Pointer to META.DATA
Pointer to LOADING.KWI
ALLDATA.KWI
Realdata frames
Go back
31
Index Data
Information of index data to select the destination
Search frame to narrow down the data and point data to store the result of the search
The composition can be defined freely on search frame and POI information
32
Structure of Index Data
Management Data
Volume Management Frame
Search Frame 1
POI Information 1
地点情報 3
Volume Management Frame 2 Volume Management Frame 3
POI Information 2
Search Frame 2 Search Frame 3
Search Frame 4
33
Index Data It defines the form of the search facility and
search data by signature of 4bits– Management of the volume
• Layer search DSRC : Define for Search• B-Tree search DSBT : Define for Search of Balanced
Tree
– Search frame• SR50 : Search by 50 on• SRJP : Search by Japanese area
– Point information• Point information ( normal )
PINR : Point Of Interest ( normal)
• Point information(data declaration)
DPOI : Define for Point Of Interest
34
An Example of Address SearchDetailed search information record
( Address search )
Prefecture-specificcategory
A Aichi prefecture
Nagoya city
Aomori prefecture
・
I Ishikawa prefecture
・
Wakayama prefecture
WA
City/Ward/Town/Village-specific category
主
主
Main area
Akabane town
Akubi town
・
NA Nagoya city
・
Main area
Main
A
Atsuta wardA
・
Main area
・
Main area主
・
Oaza/koaza/banchi-specific category
主
主
主 Main area
1-chome Akabane
2-chome Akabane
・
O 1-chome Akabane
・
Main area主
A
1-chome AkubiA
・
Main area主
・
Main area主
・
(Main area, Aichi prefecture)
(Main area,Akabaneprefecture)
(1-chome, Akabane, Akabane town,Aichi prefecture)
・
(main area Akubi town,Aichi prefecture)
・
(main area Nagoya city)
(main area Atsuta ward, Nagoya city)
・
(main area Kita ward, Nagoya city)
・
(main area Aomori prefecture)
・
Matching data
To POI information
Main
Main
Main
Main
Main
Main
(1-chome, Akabane, Akabane town,Aichi prefecture)
(1-chome, Akubi, Akubi town,Aichi prefecture)
35
Applicability to Many Countries Kiwi format has succeeded to overcome the difference
between Japan and U.S.A ( Ver1.22 )Japan
US
prefecture cities,towns,and villages
chou, azabanchi
(lot number)
street house numberstatecities,towns,and villages
Go back
36
The Specifications of Kiwi Format
It is disclosed on the following web site.– http://kiwi-w.mapmaster.co.jp– Japanese version and English version are
ready as well
top related