Home Cart Quotation About-Us
www.ChineseStandard.net
SEARCH

GB/T 19711-2021 English PDF

US$11899.00 · In stock
Delivery: <= 30 days. True-PDF full-copy in English will be manually translated and delivered via email.
GB/T 19711-2021: Data model and data exchange format for navigable spatial database
Status: Valid

GB/T 19711: Historical versions

Standard IDUSDBUY PDFLead-DaysStandard Title (Description)Status
GB/T 19711-202111899 Add to Cart 30 days Data model and data exchange format for navigable spatial database Valid
GB/T 19711-2005RFQ ASK 3 days Data model and data exchange format for navigable spatial database Obsolete

Similar standards

GB/T 41452   GB/T 42056   GB/T 35641   GB/T 19710.1   GB/T 19710.2   

Basic data

Standard ID: GB/T 19711-2021 (GB/T19711-2021)
Description (Translated English): Data model and data exchange format for navigable spatial database
Sector / Industry: National Standard (Recommended)
Classification of Chinese Standard: A75
Word Count Estimation: 630,684
Issuing agency(ies): State Administration for Market Regulation, China National Standardization Administration

GB/T 19711-2021: Data model and data exchange format for navigable spatial database

---This is a DRAFT version for illustration, not a final translation. Full copy of true-PDF in English version (including equations, symbols, images, flow-chart, tables, and figures etc.) will be manually/carefully translated upon your order.
Data model and data exchange format for navigable spatial database ICS 07.040;01.040.35 A75 National Standards of People's Republic of China Replace GB/T 19711-2005 Navigation geographic data model and exchange format [ISO 14825.2011,Inteligenttransportsystems- Released on 2021-10-11 2021-10-11 implementation State Administration for Market Regulation Issued by the National Standardization Management Committee

Table of contents

Preface ⅩⅪ Introduction ⅩⅫ 1 Scope 1 2 Normative references 1 3 Terms and definitions 1 3.1 General terms 1 3.2 Mathematical terms 2 3.3 Measurement terms 3 3.4 Terminology for geographic data files 5 4 Model expression symbols and instructions 7 4.1 Modeling Symbolization Method 7 4.2 UML notation 7 4.2.1 Overview 7 4.2.2 Class 7 4.2.3 Class relations 8 4.2.4 Convention 11 5 Overall conceptual model 11 5.1 Conceptual Data Model 11 5.2 Overall Data Model 11 5.2.1 Feature Model 11 5.2.2 Topology Type 12 5.2.3 Levels of GDF 15 5.2.4 Elevation modeling and time modeling 17 5.3 Attribute Model 18 5.4 The relational model 20 5.5 Linear Referencing 21 5.6 Element expression method 21 5.7 Time modeling 22 5.8 Data management. feature data organization based on layers and partitions 22 6 Classification of elements 25 6.1 Overview 25 6.1.1 Elements and element themes 25 6.1.2 Feature classification code 25 6.1.3 Simple and complex elements 25 6.1.4 Feature hierarchy 25 6.1.5 Data model for feature classification 26 Navigation geographic data model and exchange format

1 Scope

This standard specifies the conceptual data model, logical data structure and physical coding format of navigation geodatabases. Given that the database can be Can have content (elements, attributes and relationships), and explain how to express these content and how to define metadata. This standard focuses on the description of roads and road-related information, and also includes other relevant information required for the application of intelligent transportation systems (ITS). Interest, such as. Example 1.ITS application needs to use address system information to specify the location and/or destination. Therefore, this standard regards administrative divisions and postal divisions as information One of the important content. Example 2.Map display is an important part of ITS application. In order to improve the effect of map expression, this standard includes land cover, water cover, etc. information. Example 3.Points of interest or service information are important content that travelers pay attention to, and this standard describes them. Typical application areas of this standard are in-vehicle and portable navigation systems, traffic management centers, or services related to road management systems (such as Public transportation system, etc.). This standard applies to ITS applications and services. Among them, the conceptual data model is not only suitable for ITS applications, but also for other related applications. use. The conceptual model is application-independent and can be integrated with other geographic database standards. This standard only specifies the representation method of geographic data and does not involve the specific content of the data. In the process of using this standard, if the user adopts The content of the electronic map data used conflicts with the confidentiality principle of the national map, and the confidentiality principle of the national map data should be followed first.

2 Normative references

The following documents are indispensable for the application of this document. For dated reference documents, only the dated version applies to this article Pieces. For undated reference documents, the latest version (including all amendments) is applicable to this document. GB/T 2659-2000 Codes for names of countries and regions in the world (eqvISO 3166-1.1997) GB/T 4880.2 Language Name Code Part 2.3-letter Code (GB/T 4880.2-2000, eqvISO 639-2.1998) GB/T 15273.1-1994 Information Processing Eight-bit Single-Byte Coded Graphic Character Set Part 1.Latin Alphabet One (ISO 8859-1. 1987, IDT) GB/T 16831-2013 Coordinate-based standard representation of geographic point location (ISO 6709.2008, IDT)

3 Terms and definitions

The following terms and definitions apply to this document. 3.1 General terms 3.1.1 Cartographicprimitive Primitives in cartographic representations, such as nodes, edges, and faces. 3.1.2 Datafile A collection of related data records with the same structure.

Appendix D

(Informative appendix) Divide the data set D.1 Purpose of division The purpose of dividing data is to effectively organize the data records in geographic data files to reduce the processing of large amounts of data. It just organizes the data to make its processing more optimized, rather than defining the coverage area of a database. A specific geographic data file The file area is defined by the sub-units of data set, layer, and partition. Partition is the smallest logical unit of division. Just like the layer boundary and the dataset boundary, the layer boundary always coincides with the partition boundary Together, there will be no other situations larger than the boundary of the layer or dataset. D.2 Definition Element. any geographic data file 0 layer, 1 layer, 2 layer Object. node (Node), edge (Edge), face (Face), point element (Point), Line features (Line), area features (Area) and compound features (Complex). Local. Defined in the same partition. If two elements are defined in the same partition, they are called local to each other. One yuan Elements are considered local where they are defined as level 0, level 1, and level 2 elements. External. Defined in different partitions. If two elements are defined in different partitions, they are called external to each other. One yuan Elements are considered external when they are referenced by a conversion record. Divided elements. any element that intersects the boundary, and those geometric bodies that contain the element that intersects the boundary. Local and external are relative. An element is local in one partition and can be external to another partition. D.3 Division rules D.3.1 Introduction Rules are used to describe how elements are defined in the relevant partition, which elements can be defined as external, and how to define them. Rules are also used Describe how to encode the elements that cross the partition boundary to ensure that these elements can be reconstructed. D.3.2 Determine the partition Because partitions are used to reduce the amount of processing of large data volumes, the elements in a partition should be geometrically related. But how There is no strict restriction on the partitions, and the partitions can overlap or cover. There is no uniform standard for the partition boundary. According to the description of the 0-level set elements, it is consistent with the description method of other partitions. D.3.3 Level 0 elements Since layer 0 is the only one that contains the geometric description of the real world, it should be defined as a feature in the same partition. Therefore, All elements of level 0 that are referenced by elements of level 1 or 2 must be placed in the same partition as the element that refers to it and defined as this Ground. Any part of the level 1 or level 2 elements defined in a certain zone must define the level 0 geometric elements in the zone. There is no requirement that the elements sharing geometric elements are defined in the same partition, so the level 0 elements may be repeated in multiple partitions Appear. D.3.4 Tier 1 and Tier 2 elements Because it is too large or intersects with the boundary of the partition, many layer 1 and layer 2 features cannot be completely defined in a partition. In this case, a layer 1 and layer 2 element is divided into several parts defined in different partitions, and these elements will be marked so that When processing the data, it can be re-established to form a single object. In order to divide the features of the first layer, additional The 0-level element. These elements should be defined in the following way. ---Level 1 point features may never intersect the boundary of the partition, therefore, level 1 point features are always single and local. ---If a layer 1 line feature intersects the boundary of the partition, a point should be added at the position where the line intersects each boundary. This situation may be Occurs many times. Line elements should be defined in each intersecting zone. These elements only point to local 0-level elements. These Line features will be marked as "divided" features, and the edges that make up a "divided" line feature should not overlap. ---If a level 1 element intersects with a partition, the supplementary edges and necessary nodes on the partition boundary will be added to the two adjacent partitions. In the area, to form the two complete areas of this area element. This situation will appear in each intersecting partition, and these elements will Point to the local 0-level geometry, these area features will be marked as "segmented", those areas that constitute a "segmented" area feature Should not overlap. Since the 2-level complex elements are composed of 1-level elements, there is no need to introduce new geometry to the 2-level elements. If a 2-level The feature intersects a partition boundary (because the feature is composed of features that intersect the partition boundary, or is defined in a different partition Element composition), it should be defined in each partition where the 1-level elements that compose it are located, and these 2-level complex elements will be marked as "segmentation of". All 1-level or 2-level elements that make up a "divided" element should not overlap. Only administrative divisions are an exception, in order to be able to According to the actual grading, allow those administrative divisions defined at a higher level to have one for other administrative divisions at a higher level The local definitions of these administrative divisions defined in different districts can be identified by the names of higher-level administrative divisions. Like the same administrative divisions as the elements. These elements are marked as "duplicate definitions in other districts". This situation is only for administrative The regional element is valid. D.3.5 Name The name can be repeated in any partition where an element containing name information is located. The name record cannot be externally quoted. because Therefore, the names of all elements must be defined locally within the defined partition. D.3.6 Relationship In order to reduce the amount of data processing, all relationships have at least one local element, and each element is not required to be defined as a local of. If an element is defined as both local and external, the relationship record must point to the local definition. For example. if an administrative district The plan is divided, and the top and bottom are carried out in the local and external partitions. Then the road element in the administrative division must point to the local definition All the pointers to other elements (including names and attributes) in the relationship record must point to local elements. D.3.7 Properties The attributes in the partition where any element containing attributes is located can be repeated. Property records cannot be externally referenced. Therefore, The attributes of an element must be defined locally within the defined partition. All pointers to other elements in the attribute record (including Sub-attributes and time domains) cannot point to external elements, and the segment of attribute records is based on local elements. D.3.8 The relationship between partitions, layers and datasets The relationship between partitions, layers, and datasets. Except that the dataset must contain one or more layers, the layer must contain one or more partitions at a time. Outside the zone, there is no uniform requirement. It can be negotiated between the data provider and the user.

Appendix E

(Informative appendix) Rules for the construction of two-tier elements of roads and vehicles E.1 Basic method E.1.1 Introduction The two-story road, level crossing and overpass structure are complex elements (high See Figure E.17~Figure E.20 for examples of overpasses on express highways. The construction of roads and intersections is determined based on driving rules. One way An intersection can be considered as an intersection from the perspective of a functional unit. The connection between two adjacent intersections can be defined as having a specific function Of a road. The construction of interchanges contains more conceptual features. Intersections can be seen as intersections between higher-level roads mouth. It should be noted that the rules used to define road sections and intersections and the rules used to define intersections are not strictly distinguished. This kind of rule It may lead to a certain degree of abstraction, on the other hand, it will also affect some objects that may have functional characteristics. The functional characteristics of the intersection and A driving decision is related (e.g., turn left), and the functional characteristics of an intersection are generally related to a group of driving decisions (e.g., at Xizhimen Bridge, to Zizhu Drive towards the bridge). Especially in less complicated situations (e.g. at the intersection of two one-way roads without ramps) intersections and confluences. The intersection may be exactly the same. The construction rules of road sections and intersections are highly related. The definition of an intersection directly affects the definition of the road section connecting the intersection. Vice versa, the start and end of a road section are both intersections, so the definition of road sections also affects the definition of intersections. The basic construction rules for intersections are. at an ordinary intersection that gathers more than 3 one-way or two-way traffic lanes to form a connected connection. The collection of junctions and road elements forms the intersection. The construction rules for intersections and road sections defined in this way will affect the level 1 expression of the road network. At a certain point, there is only one lane connected with the auxiliary road, and a 2 should be added to the lane opposite to the connection point that expresses the connection with the auxiliary road. Price connection point. These connection points are added to ensure consistency with layer 2 data. These connection points are called "two-price opposite connections point". An intersection is a location expression with clear practical significance in the road network. The concept of intersection is related to synthesis, and when the degree of abstraction is sufficient When high enough, the connection between the two highways can be regarded as an object, and this object can be expressed as an intersection (see Figure E.16). When the connecting road is a road with a lower level than a highway (such as an urban area), the intersection may overlap with a simple intersection where two single-lane lanes intersect. E.1.2 The difference between an intersection and an intersection. roundabout The roundabout can be described in two completely different ways on the 2nd floor. This description method can make the junction and the intersection The difference is more obvious. One is to treat the entire roundabout as a functional point, which is composed of all the road elements and connection points that make up the roundabout An intersection. Another option is to treat roundabouts as many road elements with specific functions (see Figure E.15). E.2 Detailed rules for intersection construction E.2.1 Intersection E.2.1.1 Overview Intersections include various situations, which require specific construction rules. The general rule for judging whether an intersection should be regarded as a functional unit is. whether the roads converge at the same point. This rule is shown in Figure E.1 The explanation is as follows, if the connection points between several roads are all located in the public area formed by the extension lines of different road sidelines Within the domain, these connection points together constitute an intersection. E.2.1.2 Road intersections with only one-way lanes These intersections are classified according to their traffic lanes. ---Intersection of two roads. Except for two-way two-lane, it should not be regarded as part of the intersection, but should be together with the road Think of it as part of the road. ---Intersection of three roads. A typical intersection of three roads is a T-shaped intersection, and such an intersection is described in the 1st floor It is a connection point, and is described as an intersection in the 2nd floor. The description method for Y-shaped intersections or fork-shaped intersections is the same. When the centerline of the road does not intersect at a point at the intersection, we can still use the rule described in Figure E.3 at the beginning of this chapter. Then describe. ---Intersections of four or more roads, see Figure E.4 and Figure E.5 for some common examples. See the figure for a more special example E.6 to Figure E.8.Commonly used rules can be used as specifications, but there are no strict requirements, so they can be regarded as examples. In some cases, the rules are not fully applicable, but they can still be used as uniform regulations. E.2.1.3 Road intersections with dual carriageways In general, the construction of two-way traffic lane intersections is shown in Figure E.2, Figure E.7, Figure E.8 and Figure E.9. Two roads separated from the upper and lower lines form an intersection, and the road connection point and the connecting road in the intersection form the intersection together, see Figure E.9. The road where the single-lane lane separates from the upper and lower lines forms an intersection. For forks, three different situations may occur. ---Single-lane only connects one side of a multi-lane road, see Figure E.2.In this case, the connection points of single-lane and multi-lane roads The junctions on the other side of the lane road together form an intersection. ---Two single lanes are connected to both sides of a multi-lane road, see Figure E.10.In this case, single-lane and multi-lane roads The two intersections formed by the sides together form an intersection. ---Two single-lane roads and a multi-lane road intersect on each side, and there is a small section of road elements between the two lanes, see Figure E.7. In this case, the connection point between the two single-lane and multi-lane roads and the connection road between the two single-lane roads will be together Constructed into an intersection. When two two-way driving lanes are not clear, they should be treated as one lane. When the center line of each two-lane is located on the wheel of the two-lane When within the profile, the intersection can be regarded as a functional unit. Such an intersection can be described as an intersection. See Figure E.10 for special circumstances. There is a gap in the middle of the two-way lane, which is used to make a U-turn (that is, a U-turn). Follow 2 in level 1 Two intersections and a short section of r......
Image     

Tips & Frequently Asked Questions:

Question 1: How long will the true-PDF of GB/T 19711-2021_English be delivered?

Answer: Upon your order, we will start to translate GB/T 19711-2021_English as soon as possible, and keep you informed of the progress. The lead time is typically 25 ~ 30 working days. The lengthier the document the longer the lead time.

Question 2: Can I share the purchased PDF of GB/T 19711-2021_English with my colleagues?

Answer: Yes. The purchased PDF of GB/T 19711-2021_English will be deemed to be sold to your employer/organization who actually pays for it, including your colleagues and your employer's intranet.

Question 3: Does the price include tax/VAT?

Answer: Yes. Our tax invoice, downloaded/delivered in 9 seconds, includes all tax/VAT and complies with 100+ countries' tax regulations (tax exempted in 100+ countries) -- See Avoidance of Double Taxation Agreements (DTAs): List of DTAs signed between Singapore and 100+ countries

Question 4: Do you accept my currency other than USD?

Answer: Yes. If you need your currency to be printed on the invoice, please write an email to Sales@ChineseStandard.net. In 2 working-hours, we will create a special link for you to pay in any currencies. Otherwise, follow the normal steps: Add to Cart -- Checkout -- Select your currency to pay.

Question 5: Should I purchase the latest version GB/T 19711-2021?

Answer: Yes. Unless special scenarios such as technical constraints or academic study, you should always prioritize to purchase the latest version GB/T 19711-2021 even if the enforcement date is in future. Complying with the latest version means that, by default, it also complies with all the earlier versions, technically.