Kiwiディスクについて - Kiwi

1
Outline of Kiwi Format
Kiwi-W Consortium
E-Mail：[email protected]
2
Conventional map database structure
 Database structure which depends on the
requirement of the Application Program
The real world
Map display
Data
Positional
reference
Data
Route planning
Data
Refer to data.
(1)
Application(1)
(map display)
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
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
Standard data format
for data exchange
Relation of
connection
Shape data
Attribute data
Common data reference program
Application(1)
Application(2)
Application(n)
6
The composition of Kiwi format
Index Data
Main Map Data
Road Data
Background Data
Text Data
Route Guidance Data
Route Planning data
Drawing
Parameters Data
Voice Data
Image 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 n
level 2
level 1
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
Text
：
公園
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 [Ａ]
Offset to Display-class-classified Road Data
Road
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
Back
Ground
Ａｌｌｄａｔａ．Ｋｗｉ
Data Volume
：
Data author Identification
Format Version Number
Data Version Numver
：
Management Header Table
Management Header Record１
（Pacel Data Management）
Management Header Record１
（Region Data Management）
Management Header Record１
（Index Data Management）
Management Header Record１
（Drawing Parameters Data Management）
Management Header Record１
（Infrastructure Data Management）
Management Header Record１
（Image Data Management）
Management Header Record１
（Voice Data Management）
Management Header Record８（Reserved）
：
Management Header Record48（Reserved）
Data Volume
Management Header Table
Each
Management
Header Record
represents
position of
management data,
and size of
management data
12
13
Parcel Data Control Frame
Parcel Data Control Distribution Header
Level n
Header Size
Coverage Area
Size of Level Control Record
Level n-1
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 ）［Ｋ］
Number of Block (for Each Level）［Ｌ］
Number of Ｐａｒｃｅｌ (for Each Level）［Ｍ］
Array of Block Set Control Record （#1 to #K）
:
Level 1
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
14
Ｌｅｖｅｌ i
Parcel Data Control Frame
Parcel Data Control Distribution Header
２
Header Size
Coverage Area
Block Set
３
Size of Level Control Record
０
Size of Block Set Control Record
1
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 ）
［Ｋ］
Number of Block (for Each Level）［Ｌ］
Number of Ｐａｒｃｅｌ (for Each Level）［Ｍ］
Block
２
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
Parcel
２
Array of Route Guidance Control Record （#1 to #M）
Address of Route Guidance Data Frame
Size of Route Guidance Data Frame
０
３
１
３
15
Main Map Data
 Division and integration of a parcel
level n
level 2
level 1
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.
0
Higher
level
0
1
0
0
2
0
1
2
3
4
5
Region divisions for each layer
0
6
Lower
level
Region
number
1
1
2
2
3
4
5
Tree structure of region
management records
6
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
Structure of Route Planning Data (1)
Route Planning Data Frame
Route Planning Distribution Header
：
Offset / Size of each Data Frame
Node Data Frame
Total Number of Node Records ［Ｎ］
Array of Node Record （#1 to #Ｎ）
Attribute
Number of Link Record [Ｋ]
Offset to Link Record
Number of Regulation Record ［Ｌ］
Link Data Frame
Link Cost Data Frame
Data Frame Corresponding to the Upper Level Node
Passage Code Data Frame
：
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
Structure of Route Planning Data (3)
Level i+1
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 [Ｎ]
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
：
Level i
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
Delete flag of Data Frame A
Size of Data Frame A
Existence flag of Data D
Control Flags、Header Size
Existence flag of Data E
Size of Data B
Existence flag of Data F
Size of Data E
Size of Data F
Existence flag of Expansion
Data (Data Frame A)
Expansion Data
Size of Control Header
Data B （always stored）
Data C （fixed length , always
stored）
Data D （fixed length ）
Data E
Data F
Expansion Data
24
Multi Link
Node
Ｒｏａｄ
B
Ｒｏａｄ
Ａ
Links
ＮＡ０ＬＡ０ＮＡ１
Attribute A Attribute B
Attribute 0 Attribute 1
Multilink
shape
Attribute B
Attribute 2
ＮＡ０ＬＡ０ＮＡ１
Attribute 1
ＬＡ１ＮＡ２
ＮＡ３
Attribute B
Attribute 3
ＬＡ１ＮＡ２
Attribute 2
ＬＡ２
ＬＡ２
Attribute B
Attribute B
Attribute 4
ＮＡ３
Attribute 3
ＬＡ３
ＬＡ３
Attribute 4
Common
attribute
ＮＡ４
Attribute C
Attribute 5
ＮＡ４
Attribute for
individual link
25
Multilink
ＮＡ０ＬＡ０
Attribute 1
ＮＡ１
ＬＡ１ＮＡ２
Attribute 2
ＬＡ２
Attribute 3
Attribute A
MultiLink Data Record
MultiLink Header
Flags for management、Size of each Infomation
Number of Nodes （Ｎ）
Attribute of MultiLink
MultiLink Shape Information （Array of Link Shape Ｎ）
Attribute of Link （Example ：Number of Shape Point（Ｋ））
( X、Ｙ ) of Node
Array of ( X、Ｙ ) of Shape Point （Ｋ）
Node and Link Connection Information （Array of Node Record Ｎ）
Additional Node Information （Array of Additional Node Record Ｎ）
Altitude Information
Passage Regulation Information
Temporal Information
Expansion Data
ＮＡ３
ＬＡ３
Attribute 4
ＮＡ４
Individual
link attribute
Detailed attribute
Flags Record
for managements
Node
Identical Node
Infomation
・MultiLink
Delete
Flag
of each
Additional Node
・ Flags
Temporal
Information
SizeInfomation
of each Infomation
to Additional
Node Record
・ Offset
MultiLink
Data Record
Additional Node Record
・MultiLink Header
：
・ MultiLink Shape Information
Offset to route guidance data
・ Additional Node Information
Offset to Street Name data
・ Altitude Information
Offset to Passage Regulation Information
・ Passage Regulation Information
：
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 the Data
 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
28
How to store expansion data（Example）
Data Frame A
Control Header
Delete flag of Data A
Size of Data Frame A
Existence flag of Data D
Control Flags、Header Size
Existence flag of Data E
Size of Data B
Size of Data E
Size of Data F
Expansion Data
Data B （allways Stored）
Existence flag of Data F
Existence flag of Extension
Data (Data Frame A)
Size of Control Header
Data C（fixed length, allways stored）
Data D （allways stored）
Control by Size
Data E
Data F
Expansion Data
Control by Size and Flag
29
How to store original data (Example）
Control Frame of Data Frame A
cf.
：
Number of Basic / Extension Data Frame
Address / Size of Data Frame A
Extension Data Frame 1
Data Frame A
User ID
Control Header
Data ID
：
Offset and Size for each Basic / Extension
Data Frame
Original Data
Extension Data Frame 2
Basic Data Frame 1 （Define Format）
Basic Data Frame 2 （
〃
）
User ID
Basic Data Frame 3 （
〃
）
Data ID
Extension Data Frame 1 （Undefined Format）
Extension Data Frame 2 （
〃
）
Original Data
30
The Structure of Physical Data
（Address Map）
Start-up record
Root directory
Directory
Root Directory
Directory
Pointer to
ALLDATA.KWI
Area
Data Volume
ISO9660
（Volume）
KIWI format
file
DSA to main map
management frame
DSA to route planning
data frame
Main map data
management frame
Route planning data
management frame
Pointer to
META.DATA
All data
management
frame
Pointer to
LOADING.KWI
ALLDATA.KWI
Main map data
Route planning
data
・
・
Metadata
Loading
Real
data 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
Volume Management Frame 2
Search Frame 2
Volume Management Frame 3
Search Frame 3
Search Frame 4
POI地点情報3
Information 2
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 Search
Detailed search information record
（Address search）
Prefecture-specific
category
A
Aichi prefecture
Nagoya city
City/Ward/Town/
Village-specific category
Main
A
Aomori
prefecture
・
I
WA
Ishikawa
prefecture
・
NA
主
Main area
Akabane town
主
Oaza/koaza/banchispecific category
Main
主
A
・
・
Nagoya city
O
Atsuta ward
Main
主
A
・
Main
Main area
Main area
・
1-chome Akabane
Main
主
(Main area,Akabaneprefecture)
(1-chome, Akabane, Akabane
town,Aichi prefecture)
(1-chome, Akabane, Akabane
town,Aichi prefecture)
・
(main area Akubi town,Aichi
prefecture)
Main area
(1-chome, Akubi, Akubi town,Aichi
prefecture)
1-chome Akubi
Main area
・
主
Main
(Main area, Aichi prefecture)
・
・
・
Main
主
1-chome Akabane
主
2-chome Akabane
・
A
主
Main area
Akubi town
Main area
Wakayama
prefecture
Matching data
Main area
・
・
(main area Nagoya city)
(main area Atsuta ward, Nagoya
city)
・
(main area Kita ward, Nagoya city)
・
(main area Aomori prefecture)
・
To POI
information
35
Applicability to Many Countries
 Kiwi format has succeeded to overcome the difference
between Japan and U.S.A （Ver1.22）
Japan
prefecture
cities,towns,
and villages
chou, aza
banchi
(lot
number)
ＵＳ
state
Go back
cities,towns,
and villages
street
house number
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

Download Report