TWI236803B - Method of converting geospatial database into compressive database for multiple dimensional data storage - Google Patents

Abstract

The present invention is a computer data converting process and method for converting or constructing computer stouage data language or format to be utilized by a user, and to a device for achiecing the method. The database conversion method for compressive multiple dimensional data storage comprises the steps of: analyzing the available storage size in a physical device and the original geospatial database; partitioning the original database into a plurality of data segments; selecting a particular position in each of the data segments as a reference point position (RPP); producing a local coordinate system for each of the data segments respectively; and converting a set of reference point positions and the local geodetic coordinates of each of the data segments to pixel coordinates in the form of a pixels coordinate system to form the specific digital map database.

Description

1236803 V. Description of the invention (1) Description of the invention Database first patent invention back invention collar This family uses the invention back number to talk about storage, not to let the data show that the number of independent questions is required to be compressed, such as compressed data base. No database, this is a structured application for the patent application of the number compression method for the patent application of the field of invention. The conversion of the database is to ask about the data, such as the important question form and the most used data for the data. The digital data reduction database does not need to be converted. It also needs to be 60/168, 183. The title is a kind of geography. The application date is November 27, 1999. The pre-application 0 is related to the computer and structural design. Such as the number of questions. Or access to the general database metadata is usually related to the process enhancement multi-purpose from the database, especially several kinds of 〇 conversion of the meaning of the task. The library has been changed. Most applications are related to the data conversion process, especially for computer storage languages, formats, or methods. A collection of information elements accessed by users. More generally generated by users and applications of the same level. Data size, easy access and easy access In general, the single application aspects of accessing the database can be combined formally, for example, data transfer, poor performance of databases for general purposes, and each is the language that will be accessed during the process of digital data conversion The conversion to an easy-to-understand language to meet the special process is to convert the general purpose database elements that are very close to the ideal compressed database, or questions, then the database user can directly access the data number application. It is necessary to understand the general purpose number performance to achieve the desired cost. , Broadening applications

1236803 V. Description of Invention (2) Field. In the recent industry, the cost of a letter from the host to the point of the cost of a special space to visit the space platform to generate language or application to save billions of inventions, domain 0. If you look at the machine, you can see the news. The special room and space geography download. This article outlines the current method of storing empty bytes in the format field so that each customer can pass through the interconnection. Although the text is used to send data to the space, it is not only used to occasionally increase the size of the data application network or large users. However, many networked data sources and libraries have been enhanced. Electronic data has not been invented to transmit data to create data. In response to the difficulties in managing user data conversion, business has been considered. The number of files that have been converted is limited. . The improvement of general data in the field of air database use has taken a long time. The special performance process between system points and storage is very rare. The number of data transfer purposes is special. The data with limited transfer performance is based on the application of imagery databases that acquire spatial geography and tabular text description resources. Obtaining application is fundamental. According to storage requirements. From the source, however, the largest database is similar to the organization. Because the handheld PC is generally an element that must be converted into data processing. The view of language transmission hardware is a lot of redundancy when 'increased application performance is large capacity. Users use large-capacity computers to produce special languages in the sense of application. Broadening the system of spatial geodatabases requires expensive storage facilities to manage databases. State-based spatial geodatabase approx. But currently the largest storage device is only megabytes. Hardware solutions are expensive and sometimes not feasible. The original purpose is to provide a data conversion process and application performance, to obtain the ideal cost, and to broaden the application domain. After conversion, the database size is reduced and hardware requirements are reduced.

Page 61236803 5. Description of the invention (3) Another object of the invention is to provide a data conversion process and method to generate a compressed database from a given general meaning database and an application database from a provided meaning database. To enhance application performance, obtain ideal costs, and broaden application areas. Another object of this invention is to provide a method to evaluate the efficiency and performance of the data conversion process and the compressed database produced by the data conversion process. Summary of the invention The original purpose of the invention is to provide a data conversion process and method in order to enhance application performance, obtain ideal costs, and broaden application domains. After data conversion, the database size is reduced and hardware requirements are reduced. Another object of the invention is to provide a data conversion process and method to generate a compressed database from a given general meaning database, and to generate an application database from a provided meaning database to enhance application performance and obtain ideal cost. To broaden the application area. Another object of this invention is to provide a method to evaluate the efficiency and performance of the data conversion process and the compressed database produced by the data conversion process. Another object of this invention is to provide a method to convert a general spatial geodatabase language to a compressed language in order to achieve the smallest data storage size and the largest data access performance. Another object of the invention is to provide a method for converting a general-purpose geodatabase to a compressed multidimensional spatial geodatabase that has undergone coordinate transformation. Another object of this invention is to provide a compressed database structure to convert φ from a general-purpose geodatabase to a compressed multidimensional spatial geodatabase to meet application requirements. '

Page 7 1236803 V. Description of the invention (4) In order to achieve the above purpose, the invention provides a method to convert a general geographic database to a specific compressed database of two or three dimensions. It includes the following steps. (a) Analyze the physical storage geodatabase of physical devices (such as palm-size PCs) with available storage sizes, two- or three-dimensional geographic coordinates, and the costs associated with increasing storage. Based on the above analysis, determine the final maximum display resolution on the physical device. (b) The original spatial geodatabase of two-dimensional or three-dimensional geographic coordinates is divided into blocks, wherein each data block is displayed in part or all of the display area of the physical device according to the selected scale factor. (c) Select a specific position in each data block as the reference point (RPP), or use it as the reference coordinate origin (RC0P) of the entire data block to form an RPP set for the entire original spatial geodatabase. (d) Generate a local coordinate system for each data block. Each local coordinate system uses the R P P determined in step (c) as the coordinate origin. The original two-dimensional or three-dimensional geographic coordinates are transformed into corresponding local coordinates in separate data blocks. Each local coordinate has a relative positional relationship with the original coordinates of each data block. Example 1 · Consider point B 1 in a three-dimensional Cartesian coordinate system. The coordinate value of the point is xb = [1 0 0] τ. It is assumed that the coordinate element of this point varies between 0-2 5 5. Point B 1 only needs three bytes in the coordinate system to store the coordinate value. Consider _ another coordinate system B whose coordinate origin is the same as coordinate system A, which is obtained by rotating coordinate system A clockwise about 30 degrees around the Z axis. The coordinate value of point 1 in coordinate system B is

Page 8 1236803 V. Description of the invention (5) x [0.866025 0.5 〇 · 〇] τ. You need 24 subsections to store the same point double precision floating point value format without losing precision. Example 2: Consider a shape file stored in the ESRI (Environmental Systems Research Institute) shape file. It is a track record block that includes a series of longitude and latitude coordinates. For example = there are three points: Pl — (— 8080 05 0001 ,, 2 4G 34.0524,), ρ 2 — s " ^ 80. 05 · 0 0 0 3, 24034 · 0512,) and P3 — (― u〇g 〇5-〇〇〇〇, 〇 〇 5-24 '). For this street block 48 bytes of storage are needed. Such as' Bujia $ point P1 as the reference point coordinates, the next two points P2 and P3 are in the round (, 〇 ticket system is neutralized as RP1-(10. 00, 2, 0, 0010,) and PR2- 01 and / ㈣ 5 ', 〇 0 0 2 2'). If a scale factor of 1000 is introduced, then it is stored. Expressed as (-2, 1 0), (-5, 2 2), only 4 bytes are needed to store 4 bytes for two local coordinate points (RP1 and RP2 and (c)), street block records All bytes belonging to the block that the data block reference machine uses to store the title channel are 20, of which 16 bytes are used for \ LE position ρ 1 this /, \ v. Y 7 W ie% aG m to take the "quote", block RPP according to The selected reference coordinate system is represented as a local data size that is further reduced. The rule S 1) ^ turn $ to change a series of reference point positions and local positioning library for each data block, and send the pixel form in the positioning system to Form special digital map numbers. "Each data block in the transformation from double precision to short integer medicine 1 dataset analysis module segmentation module of Guangshi dataset 4 2-generation of basic reference coordinate system module generation module of sub-reference coordinate system 1236883 V. invention Explanation (6) 5-Data transformation module 7-Cost function comparison 1 0-Database 3 0-Specific database module 6-Decision function selection and calculation module 8-Data storage module 2 0-Detailed description of the preferred scheme of the data compression process First In the picture to the tenth Ming head, the structure of the data processor is transferred to the database 30. The number is selected by the selected party and the data is compressed. It represents a specific cost from the general purpose. The main purpose of the expansion is to evaluate the item. The main application database of the invention is shown in Figure 5. Figure 5 describes a method for a geographic database to send a two-dimensional to multi-dimensional compression storage database according to the item. A general database 10 is exported. The general database 10 is obtained in 20 passes, and then an application-specific language database is generated. 30. Based on the database application, in order to enhance the application performance, obtain the application scope of the general database and generate data conversion. Data conversion. Starting from the application requirements, create a special language to describe a general object database apparent turnover number or a second diagram for describing how to evaluate the performance of the data conversion process 20 the fundamental concepts. Conversion efficiency is defined as E

E || Da ⑽ where llil represents a number to measure the efficiency of the data conversion process and measure the performance of the process. Apply the following

Page 101236803 V. Description of the invention (7) & · Data storage size performance measurement Database processing performance measurement Data reading process performance evaluation Database query process performance evaluation ea: According to the definition E > 1, valid data Conversion process E < 1, The basic concept of redundant data conversion process is to create the data conversion process and search for a conversion efficiency that makes E > 1. Referring to the third figure, a set in a geospatial information database is used to create a digital map according to a preferred implementation. According to the second figure, the geospatial information database is described as a 'database A π digital map database is described as a database B π derived from the given geospatial information database. || DatabaseA ||: Storage space required by database A under normal circumstances || DatabaseB ||: Storage space required by database B under specific circumstances. Obviously, the storage or utilization language or geospatial data in the database is derived from the geographic coordinate system (Geodetic Coordinate, GDC), where the points are represented by latitude and longitude coordinates. The geographic coordinate system (G D C) is based on some approximation of the shape of the earth. Classic navigation instruments define the shape of the earth as a circle. More refined

Page 11 1236803 V. Description of the invention (8) The accurate geographic coordinate system requires that the earth be described as a rotating ellipsoid, or an ellipsoid formed by rotation. Latitude is defined as the angle between a straight line extending from a point on the ellipsoid and perpendicular to the ellipsoid at that point and the equatorial plane. At the north latitude, the value is positive, at the south latitude, the value is negative. Longitude is defined as the angle between a large circle passing through a point on the ellipsoid and the minor axis (polar axis) of a major large circle. The value of longitude east of the main great circle is positive, and the value of longitude west of the main great circle is negative. Unlike the latitude where the starting point is at the equator, the ellipse as the starting point for longitude measurement has no characteristics. The starting point of longitude can be any great circle. Historically, countries have often used the great circle passing through their national observatory as the starting point for longitude, which has produced many major great circles. According to current practice, the Great Circle passing through Greenwich, England is considered the standard major circle. The ellipsoid and reference point are the two main parts of a geographic coordinate. Many ellipsoids are currently used to simulate the earth, and any one of them can be used to associate its position and orientation with the earth in different ways. The World Geographic Coordinate System (w o r 1 d G e o d e c s s t e m 1 98, WGS-84), established in 1984, defines the current standard reference point for the US Department of Defense. WGS-8 is used as the reference system for GPS receivers. Mean Sea Level (MSL) is specified as the vertical reference point. When the spatial geodatabase uses different reference systems or reference points, it must be Switch between different reference systems. How to use a spatial geodatabase in a more efficient way to create a digital map on a physical display device

Page 12 1236803 V. Description of the invention (9) The computer memory stores this spatial geodatabase (for example, minimizing the storage space of the database and maximizing the performance of database access and query) is the main topic of this invention. According to a preferred implementation scheme, a method for converting a universal geospatial information database into a special compressed database to implement multidimensional data storage consists of the following steps: (a) Available by analyzing a physical display device (such as a palm computer) Storage space, an original geospatial information database containing two-dimensional or multi-dimensional geographic coordinates, and the price required to increase storage space, determine a final display resolution for the physical display device selected with a certain display area The maximum value. (b) Converting the two-dimensional or multi-dimensional geographic coordinates in the original spatial geographic coordinate system database into a series of data fragments, where each data fragment is partially or entirely displayed on the physical display device according to the selected scaling index. Within range. (c) Select a specific point in each data segment as the reference point position (RPP) of the entire data segment or consider it as the reference coordinate system origin (Reference Coordinate 0 rigi η P oint, RC 0 P ) To generate a series of reference points for the original spatial geographic information database. (d) Provide a local coordinate system for each data segment. Each local coordinate system uses the reference point (RPP) determined in step (c) as the coordinate origin. Transform the two-dimensional or multi-dimensional geographic coordinates of the original spatial geodatabase in the data fragment into corresponding local coordinates,

Page 13 1236803 V. Description of the Invention (ίο) Each local coordinate is a local point, which corresponds to the original coordinates of the data segment. (e) Converting a series of reference point positions and local geographic coordinates of each data segment into pixel coordinates represented by a pixel coordinate system to form a special digital map database, where each data segment is converted from a double-precision format into Short precision format. In addition, according to a preferred implementation of the present invention, the storage and use language of the database B or the digital map database is a screen plane represented by pixel coordinates on a physical display device, and the display range is a surface area of the screen plane. = The coordinates of a point on the screen plane (in the pixel coordinate system) are expressed as integers. For VGA mode, the coverage of the screen plane is 640X480, and for Super VGA mode, the coverage of the screen plane is 800X600. In the traditional geographic coordinate system, the latitude and longitude coordinates need to be represented by a 64-bit word (double precision format), so || Database A || = 64 According to this invention, in the digital map database, when the digital map is in The pixel coordinate system is used when displayed on a physical display device. According to the most advanced display equipment indicators, the display range can be represented by a 10-bit word (short integer format), so || Database B || = 10

1236803 V. Description of the invention (11) Combining the above results, the performance of the database storage space can be obtained 6.4 c _ \\ Database A \\ s 64 XI ^ ~ ——— | | Database B || 5 j〇 According to the above conclusion, The conversion efficiency of the data storage language from the latitude and longitude coordinate system to the pixel graphics coordinate system is about 6.4, which indicates that the performance of the special database has been greatly improved. According to the performance calculation of the database processing, the data conversion process in this invention has another advantage. In order to obtain or query the latitude and longitude coordinates, the performance of the database processing is calculated by the following formula: || Database A || = Performance of the floating-point processor In the pixel coordinate system, the performance of the database processing is calculated by the following formula: || Database B || = Integer calculation performance The database processing performance during data conversion is defined as || Database A || p _ Performance of float processor || Database B \\ p Performance of Integer Calculation

Page 15 1236803 V. Description of the invention (12) In some applications or application platforms, there is no hardware that supports floating point processing. This either makes it impossible to handle double-precision data formats, or results in poor performance due to the use of software simulators. On an application platform not equipped with hardware supporting floating point processing, the database processing performance of the data conversion process is estimated as:

Ep > > 1 On an application platform equipped with hardware supporting floating point processing, the database processing performance during data conversion is estimated to be 1 < EP < 2 from the perspective of database processing performance, The data conversion process leads to an increase in database processing speed and improves the performance of the application system. The performance of data access and query is determined by the data storage language. In general, the performance of data access and query cannot be considered at a general level. After the data storage language is restructured, the performance of data access and query can be greatly improved, making:

EA EQ > > > > The fourth figure shows the process of generating a pixel-based plane. The fifth figure shows the flow of data conversion. General geodatabases are generated based on latitude and longitude coordinate systems

Page 16 1236803 V. Description of Invention (13). In a digital map database, the 'pixel coordinate system is used when a digital map is displayed on a physical device. According to the specific application, a specific database needs to be generated from the geodatabase to display the digital map on the physical device. The data conversion process is defined as the change from the language and form of geographic latitude and longitude coordinates to the language and form of pixel coordinates. There are several steps to complete such a data conversion. The sixth to eleventh diagrams illustrate the detailed process of creating two or more application databases and generating pixel-based planes. According to a preferred implementation solution of the present invention, the above step (a) further includes:

(a-1) Calculate the maximum display area of a specific display physical device to obtain the best performance. The maximum display area for a particular display device is 640x480 for VGA and 1024x780 for Super VGa. (a-2) Calculate the maximum scale factor based on a two-dimensional or multi-dimensional geodatabase (such as longitude and latitude) to enhance system performance. (A-2) is determined by the geodatabase. To clearly describe step (a-2), consider Example 2. A file stored street record snippet 'includes three points P 1-(18 0 ° 0 .5 0 0 0 1, 24 ° 34 · 0502'), P2-(-180 ° 05.0003, 24 ° 34.0512, ), And P3-(-180 ° 05.0006 ', 24 ° 34.0524'), are converted to RPP (-180 ° 05.0001 ', 2434.0502,) and the two precisions are 0.001 (ie 1/1 0 0 0 0) Two local locations RP 1 (-2,1 0) and RP 2 (-5,2 2) ° Among them, these three points can be stored by 20 bytes. If the accuracy is reduced to 0 · 0 〇 1 (1/1 〇 〇 〇) according to the two-dimensional or multi-dimensional geographic coordinate system, the following two points can be expressed

Page 171236803 V. Description of the invention (14) is ((K 0 0 0, 0 · 0 0 1) and (-0 · 0 0 1, 0 · 0 0 2). The scale factor is introduced as 1 0 0 0. Then PR1 and PR2 can be expressed as (0, 1) and (-1, 2) can be stored in 2 bytes. The total number of bytes used to store the street record segment is 18, of which 16 bytes are used as reference points p 1 and 2 bytes are used for the two locations (PR 1 and PR 2). (a-3) According to the pixel coordinate system, the maximum accuracy is determined so that the geographic data points reach the maximum in the two-dimensional or multi-dimensional geographic coordinate system. Precision. Among them, determine the actual size in a two-dimensional or multi-dimensional geographic coordinate system that can be represented by the maximum display area of a particular display device without loss of accuracy. When determining the maximum accuracy based on the pixel coordinate system, it is also considered to increase The cost of storage. In step (b), based on the actual database size expressed in two-dimensional or multi-dimensional geographic coordinates, the geographic database is optimally divided into several data segments whose two-dimensional or multi-dimensional geographic coordinates are based on the selected display device or The maximum display area of the unit is indicated without loss of precision. Each number The segment is displayed within the maximum display area of the selected display device or unit without loss of accuracy. The block diagram of this step is shown in Figure 8. The above step (c) further includes the following sub-steps: (c-1) worldwide In a coordinate system, analyze a general geographic database expressed in two-dimensional or multi-dimensional geographic coordinates to uniquely generate segmented data segments; (c-2) In each data segment, find a special point (called a reference point) , Used to represent the data segment. The selected point (PPR) is defined as the origin of the data segment. Among them, the absolute position of each point in the data segment can pass through the origin in two dimensions or Multidimensional geographic coordinates, accurate table

Page 18 1236803 V. Description of Invention (15). In step (d), the local position relative to the origin is expressed in double precision. Local position relationships can be transformed into a global coordinate system.

V local CT] 77original where β represents local coordinates and β Mginal represents the coordinates of the selected point in the original coordinate system. Matrix [T] represents the transformation matrix from the global coordinate system to the local coordinate system. In step (e), each data segment represented by two-dimensional or multi-dimensional geographic coordinates is converted into pixel coordinates:) i X e 1 τ

GP

V local where tpixel is the pixel coordinate form. The transformation matrix is used to convert a double-precision data segment into a short-precision data segment. In essence, step (E) is to convert two-dimensional or multi-dimensional geographic coordinates to pixel coordinates. The transformation matrix is a bridge for coordinate transformation from geographic space to pixel space. The sixth figure shows the analysis and processing of step 1 of the data set A. The seventh figure shows the process of establishing the basic coordinate system and the reference coordinate system of steps (A) to (E) of the data set A. The eighth figure shows a case where the data set A is divided into several sub-data sets according to a given decision function. The ninth figure shows the establishment process of the sub-coordinate system and the reference point obtained from the eighth figure, that is, the establishment of the sub-points of the data set A. The tenth figure shows a case where the data set A is transformed into a sub-data set B 6.

Page 19 1236803 V. Description of the invention (16) The twelfth figure shows the new hierarchical data storage structure of the present invention. After step (e), the performance index of data storage

Ec || Database Λ || 5 _ 64 II Database B || 5 10 6.4 can be reached. After step (e), in order to greatly improve the access and query speed of the generated database, the present invention further includes an additional step (f), establishing an index file connected to the data transformation process of steps (a) to (e). Step (f) is used to improve the speed of database access and query to achieve: EA > > 1 EQ > > 1 As shown in the fifth figure, the implementation of the present invention includes 7 modules, namely a data set analysis module 1 , Basic reference coordinate system generation module 2, original data set segmentation module 3, sub-reference coordinate system generation module 4, data transformation module 5, decision function selection and calculation module 6, cost function comparison module 7, and data storage module 8. Any point in the data set can be considered as a point in a specific parameter space, where the dimension of the space is determined according to the requirements of a specific problem

Page 20 1236803 V. Description of Invention (17). We know that the same parameter space can be represented by different coordinate systems. A point in the parameter space can have different expressions. There are specific relationships between different coordinate systems. We define the relationship between the coordinate system A to the coordinate system B in the parameter space as an image, expressed as

R: A = > B An expression of a point p in a coordinate system such as the A coordinate system is considered to be a coordinate value. The complexity of the p-point expression varies with the different coordinate systems of the parameter space selected. therefore. For point p, there must be a coordinate system. In point P, there is the simplest form of expression. This also reduces the size of the data store, that is, we use the simplest form of representation to represent or record the same points and data sets. Generally, there are two types of coordinate transformations between any two coordinate systems of a two-dimensional or multi-dimensional geographic coordinate system. That is, translation transformation and rotation transformation. As an example, we consider a general coordinate transformation in a three-dimensional Cartier coordinate system. It is assumed that the coordinate system xbybzb is obtained by translating x0 by the basic coordinate system xyz and rotating about the X-, or y-, or z-axis. Then, the coordinate value xb corresponding to the p point and the coordinate system xbybzb can be converted into a value X corresponding to the basic coordinate system xy z, which can be expressed as X = x0 + R xb where X-, or y-, or z- The rotation matrix R of the axis rotation is used to represent the processing of coordinate and function space transformation. By defining azimuths relative to the rectangular coordinate system, a set of _

Page 21 1236803 V. Description of the invention (18) Coordinate variables. The roll angle, pitch angle, and heading angle (RPY) can be defined as the rotation angles (r, / 5, and α) that rotate relative to the reference coordinate system around the X, γ, and Z axes. The relative and reference coordinate system coordinate transformation (RPY) represented by roll angle (7), pitch angle (/ 3), and heading angle (α) can be expressed as the following continuous rotation operations, where the axis of the reference coordinate system is parallel to the basic Axis of the coordinate system: RPY (Y, P, a) = Rz (y) R / (P) Rx ^ (α) = cos 7 cos β cos γ sin j8 sin oc-sin y cos a cos γ sin β cos a + sin 7 sin a sin 7 cos β sin y sin / 3 sin a + cos 7 cos a sin γ sin β cos a cos y sin sa-sin) 8 cos sin a cos cos a (abc) Assume that the point P is in the coordinates The coordinates in the system xbybzb are the values of the point P in the basic coordinate system χ are: 'a cos 7 cos β + b (cos γ sin / 3 sin a-sin γ cos a) + c (cos 7 sin / 3 cos a + sin y sin a) 'a sin γ cos j8 + & (sin 7 sin j3 sin a + cos y cos a) + c (sin 7 sin j3 cos a-cos 7 sin a (-sin j8) + b (cos The expression of β sin a) + c (cos β cos a) in the basic coordinate system is obviously more complicated than the expression of the coordinate system xbybzb. The twelfth figure is the data structure of the internal structure of each data. This data Structure can be indexed to increase data access and queryability The data segment includes from 1 to N records. Each record includes content and containing several offset value. Partial

Page 22 1236803 V. Description of the invention (19) The value is an index of the content. The content records the actual value. Other files are used to record the bias of each record. The designed storage data structure improves data access and query performance, and realizes: E a > > 1 Eg > > 1 The third figure is a block diagram of data search and query. The data query process starts with each record. If the queried data belongs to the searched data segment, it starts to search its child records until the data query is completed. There is a trade-off in data structure design in order to achieve the best performance. The fourteenth figure is a GPS or I MU-based spatial query program of the present invention. This step is another important part of the invention. The point query program based on GPS or IMU is an improved program for creating a pixel-based applicable database. The program looks up the GPS or IMU input for pixel coordinates associated with a display device that contains a graphical representation of the data. Spatial query is a program that accesses a spatial geodatabase to obtain the attributes or characteristics of a spatial object, such as points. The spatial object is defined by GPS or IMU input at a specific location on a display device containing a graphical representation of the data. In order to obtain information about the spatial object, the query algorithm must first search the index file. The spatial index obtained by the spatial query gives the relevant data fragment, because the spatial index file belongs to the data fragment directory. therefore,

Page 23 1236803 V. Description of the invention (20) When the appropriate number of data fragments is passed through the data fragments that are directly direct. The next step within the Amax] or the multi-dimensional coordinate representation is changed from the pixel to the fifteenth pass. Coordinates displayed as [xs, ys] are displayed at a point on the screen: ·, between queries. The picture is turned to empty, and the empty query is searched for a few dozens of minutes in one minute. In the original ten sits, there is a time interval 1 = Fan Jizi shown in the first record of the collection. The schedule of the digital output MU is very clear. The U line is used to determine and record the location. The limit of entry, > the shape of the curtain or the small envelope is an evidence-based empty screen. The S5 contraction library tη checks the number and shape to the on-line GP, according to which it is the standard set, and the data is based on the number of use. The abrupt map can only be accessed in the relevant geographic data range. Assume that the correlation, η) is entered into min, must be max, and the search for the target record describes the process of converting from a two-dimensional library to pixels. The flow of geographic coordinates is based on the original system shown in the table below. The flat screen on the left side of the standard screen on the left side of the standard position is located at the left corner of the screen. Add the y phase XO amount C to the downward direction. As shown in the table above, the angle of the sitting angle of the standard system, the straight angle of the sitting plane, and the straight angle of the flat angle face, and the result [xs, ys] = [xs, ys] + [kiXs, k2ys J. In the above formula, ki and k 2 are the scaling factors on the horizontal and vertical axes, respectively. In general, kn and k2. Next, the point [X · y] on the plane is converted into a point on the ellipsoid

Page 24

1236803 V. Description of the invention (21) [0. Λ]. There are two steps involved in this conversion process. Step 1: Replace the point [X.y] on the plane in the data segment with [0.λ] expressed in geological latitude and longitude coordinates. This is a modification of the process described in the fourth figure. Step 2: Use the created spatial index file to obtain spatial information. The algorithm for re-establishing spatial coordinates is to transform the data from the local coordinate system of the block to the global coordinate system.

Page 25, 1236883 The drawings are briefly explained and illustrated the first picture: the second picture: the third picture: the fourth picture: the fifth picture: the sixth picture: the seventh picture: the eighth picture: the ninth picture: the tenth picture : Eleventh figure Twelfth figure Thirteenth figure Fourteenth figure Fifteenth figure. According to the figure, the method and function produced by the block producer should be replaced by Zhuanhe and the word data. The number of data can be changed and the transfer data should be replaced. The block graph square block equation's conversion is based on the basic radix rate description effect is the block square's energy. The work chart is compact and the square-by-step data is based on a number of maps. The ground is plain and the image is created. The project is created. ¾ Yes. A number is set according to FIG it with the present έκ Su \ LY data according to several embodiments of the present data the number of stem-yl standpipe 1¾ to FIG built Registration Number as component A landmark set when sitting. Figure 8 shows the set data obtained from the set of data and the description of the reference data of the reference system and the reference system of the system. In the first episode, the subdata of the 6B episode, which is changed from the first episode, to the first episode of A, is described in reference. The new data of the block in the structure layer of the data structure are stored in the structure data structure, and each item should be explicitly described as the operation of the block side. The number of items issued by G's visit to Mingku should be described + the standard 9th pass of the task has been searched for and entered into the input screen mouse swipe slip. Description

Page 26

Claims (1)

1236803 VI. Scope of patent application 1. A method for structural compression of a geodatabase for multidimensional data storage, comprising the steps: (a) Obtaining the original database and multiple information units such as image and text descriptions, geodatabases, a set of numbers Music movie data, and any form of digital information; (b) access to multiple compressed database requirements, including accuracy and easy access, easy to query performance; wherein the compressed database requires physical devices to represent the The maximum limit of the original database; (c) analyzing the requirements of the original database and the compressed database, establishing a definition for measuring performance, distinguishing between the language used by the compressed database and the storage language of the original database, and obtaining the physical limitations of the compression computing platform, This can maximize the use of the compressed database without loss of accuracy of the original database; (d) generate a multi-dimensional structure of the compressed database; (e) perform conversion from the original database to the compressed database; (f) from The compressed database takes metric data, and Physical display device by the geographic data. 2. The method for compressing the structure of a geodatabase for multidimensional data storage as described in item 1 of the scope of the patent application, further comprising the steps of converting the received geographic data into the multidimensional structure and storing the received Geographic data to the compressed database. 3. As described in item 2 of the scope of the patent application, "Structural Compression Method of Geographic Database for Multidimensional Data Storage", further comprising the step of converting the compressed database into the original database. Page 27 1236883 VI. Scope of patent application 4. The method of structural compression of a geodatabase for multidimensional data storage as described in item 1 of the scope of patent application, wherein the step (c) includes the following steps: (c- 1) From the compression requirements and the original database, define the most obvious inaccuracy, (c-2) Perform a performance measurement analysis to provide a validity index to estimate the data conversion performance; (c-3) is The data store determines the multidimensional structure. 5. The "structure compression method of a geodatabase for multidimensional data storage" as described in item 1 of the scope of patent application, wherein said step (d) includes the following steps: (d-1) calculating the physical display device's Maximum display area; (d-2) obtaining the highest accuracy in the form of geographic coordinates; (d-3) determining the highest accuracy in the form of pixel coordinates for the physical display device; (d-4) in the original database Determine a real size that can be represented without loss of accuracy by the maximum display area of the physical form device; (d-5) optimally divide the original database into multiple data segments, without loss of accuracy Reaching the maximum display area of the physical form device; (d-6) establishing a global coordinate system in the form of geographic coordinates to connect the divided data segments; in each of the data segments, selecting A specific point represents the divided data segment, and the selection Page 28 1236883 6. The point of the scope of patent application is defined as the origin of the data segment; (d-7) Based on its origin, a local coordinate system is established for each of the divided data segments; The local coordinate system is relative to its origin in a double-float format; a plurality of local coordinates in the local coordinate system can be converted into a plurality of coordinate persons in the global coordinate system. 6. The method of structural compression of a geodatabase for multidimensional data storage as described in item 1 or 5 of the scope of the patent application, wherein the step (e) includes the following steps: (e-1) transform the The data segment in the form of geographic coordinates is in the form of a pixel coordinate system; (e-2) establishing an index file related to the data conversion process. 7. The "structure compression method for a geodatabase for multidimensional data storage" as described in the second item of the scope of the patent application, further comprising the following steps: matching the geographic data with the data segment and converting the geographic data from all The global coordinate system to the local coordinate system; a person that converts the local coordinates to pixel coordinates on a physical display device. 8. The "structural compression method of a geodatabase for multidimensional data storage" as described in item 3 of the scope of the patent application, further comprising the following steps: transforming the geographic data in the multidimensional database to the local coordinates; The local coordinates are converted into global coordinates. 1236803 6. Scope of Patent Application