Flight data-oriented spatiotemporal trajectory data management and analysis method and device

By establishing spatial index and spatiotemporal polygon range query algorithms, combining KNN query and spatial domain traffic statistics, the efficiency and scalability problems of existing systems in spatiotemporal data management and analysis are solved, and efficient spatiotemporal data query and analysis are achieved.

CN113656670BActive Publication Date: 2024-12-06NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202110965172.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-08-23
Publication Date
2024-12-06
Estimated Expiration
2041-08-23

AI Technical Summary

Technical Problem

Existing data management systems cannot efficiently process and analyze massive spatiotemporal data, especially when querying spatiotemporal polygon ranges, which are inefficient and cannot scale. Traditional databases and distributed query frameworks lack effective spatiotemporal indexing and analysis algorithms.

Method used

A spatiotemporal trajectory data management analysis method for flight data is proposed. By establishing a spatial index and using a spatiotemporal polygon range query algorithm, the minimum outsourcing rectangle of the polygon is calculated, intersected data blocks are filtered, and the target data blocks are determined based on the time dimension, and KNN query is used. The algorithm calculates neighboring points and counts the airspace traffic to improve query efficiency.

Benefits of technology

It realizes rapid query and precise analysis of spatiotemporal data, improves the efficiency of spatiotemporal query and the scalability of the system, enriches the spatiotemporal analysis operation algorithm, and improves the performance of data processing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113656670B_ABST
    Figure CN113656670B_ABST
Patent Text Reader

Abstract

The present invention discloses a method and device for managing and analyzing spatiotemporal trajectory data for flight data, which is used to solve the problem that the existing system cannot well support spatiotemporal data range query. The method includes: obtaining spatiotemporal trajectory data and establishing a spatial index, wherein the spatial index includes multiple data blocks; and using a spatiotemporal polygon range query algorithm to query target data blocks in which all trajectory points in multiple data blocks belong to a target polygon area within a target time period; wherein the spatiotemporal polygon range query algorithm includes: calculating the minimum outer bounding rectangle of the target polygon area; screening data blocks that intersect with the minimum outer bounding rectangle and the target polygon area from multiple data blocks, and adding them to a candidate result set; determining data blocks in the candidate set whose trajectory points are located in the target polygon area and whose trajectory time is within the target time period as target data blocks.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of data management and analysis, and in particular relates to a method and device for managing and analyzing spatiotemporal trajectory data for flight data. Background Art

[0002] In recent years, with the widespread application of positioning technology, IoT sensors, GPS wearable devices, smart phones, satellites and other application devices are widely used, and these different application sources continue to generate massive spatiotemporal data. A large amount of spatiotemporal data exceeds the storage, processing and analysis capabilities of the original system. Spatiotemporal data is closely related, large in volume, complex in structure, diverse, and has low value density, making it difficult to be efficiently stored, managed and analyzed. Traditional relational databases are limited by single-machine architecture and cannot cope with scenarios with massive data; and distributed query processing frameworks such as Spark and Hadoop lack effective spatiotemporal indexes and spatiotemporal analysis algorithms, making it difficult to efficiently process spatiotemporal data.

[0003] Therefore, in view of the limitations of existing data management systems and based on the performance requirements of data management and analysis, researchers have proposed secondary development for platforms such as Spark, Hadoop, and NoSQL, embedded spatial indexes and spatial query algorithms, and used MapReduce tasks to parallelize spatial query algorithms, thereby increasing the speed of data processing. However, this method does not consider the time dimension when processing spatiotemporal data, nor does it support spatiotemporal indexes, resulting in a large amount of invalid data being scanned when executing spatiotemporal range queries, and the efficiency of the query cannot be guaranteed.

[0004] For range query algorithms, current research has only studied coarse-grained rectangular range queries, without considering the problem of polygon range queries under spatiotemporal conditions. In practical applications, the polygon query range is a set of non-overlapping complex polygons, usually in the order of thousands, while the input is a large dataset containing hundreds of millions or even billions of spatial points. Performing data analysis or computing aggregation tasks on these spatiotemporal data points will add additional CPU cost overhead, and the system may not scale well as the spatiotemporal data increases.

[0005] The information disclosed in this background technology section is only intended to enhance the understanding of the overall background of the invention and should not be regarded as an acknowledgment or any form of suggestion that the information constitutes the prior art already known to a person skilled in the art. Summary of the invention

[0006] The purpose of the present invention is to provide a flight data-oriented spatiotemporal trajectory data management and analysis method to solve the problem that the existing system cannot well support spatiotemporal data range query.

[0007] To achieve the above object, the present invention provides a method for managing and analyzing spatiotemporal trajectory data of flight data, comprising:

[0008] Acquire spatiotemporal trajectory data and establish a spatial index, wherein the spatial index includes a plurality of data blocks; and,

[0009] Using a spatiotemporal polygon range query algorithm to query a target data block in which all trajectory points in the plurality of data blocks belong to a target polygon area within a target time period;

[0010] The space-time polygon range query algorithm includes:

[0011] Calculate the minimum enclosing rectangle of the target polygon area;

[0012] Filtering data blocks intersecting with the minimum bounding rectangle and the target polygonal area from the multiple data blocks, and adding the data blocks to the candidate result set;

[0013] The data blocks whose trajectory points in the candidate set are located in the target polygonal area and whose trajectory time is within the target time period are determined as target data blocks.

[0014] In one embodiment, the method further includes counting the target airspace traffic based on the spatiotemporal polygon range query algorithm; specifically including:

[0015] Divide the target airspace sector into a plurality of regular cylinders;

[0016] Based on the space-time polygon range query algorithm and using the upper and lower bounds of the height of each cylinder as constraints, the trajectory points located in each cylinder are filtered out to add to the counting queue;

[0017] The trajectory points in the counting queue are deduplicated to obtain the target airspace traffic.

[0018] In one embodiment, deduplication of the trajectory points in the counting queue is performed to obtain the target airspace flow, specifically including:

[0019] Define the track id attribute and the cylinder Vid to which the track point belongs for the track point in the counting queue;

[0020] When executing the spatiotemporal polygon range query algorithm on each cylinder, if the trajectory point is within the cylinder, the Vid of the trajectory id attribute is marked as the Vid of the current cylinder to form a composite key<Trajid,Vid> ;

[0021] The composite key of each row of records is used to deduplicate data of the trajectory points of the counting queue.

[0022] In one embodiment, the method further includes calculating k trajectory points adjacent to the target query point based on a KNN query algorithm, thereby capturing the correlation of spatiotemporal trajectory data; specifically including:

[0023] Finding a data block intersecting with the target query point among the multiple data blocks, and adding the data block to the first priority queue;

[0024] Calculate the distance dist between each data block in the first priority queue and the target query point p ;

[0025] Calculate the kth shortest distance dist between the trajectory points of each data block in the first priority queue and the target query point k ;

[0026] will satisfy dist p <dist k The data block corresponding to the trajectory point is determined as a candidate data block;

[0027] The candidate data blocks whose trajectory time is within the target time period and whose distance to the target query point is less than dist(i,q) are selected. k The trajectory points are added to the second priority queue;

[0028] Generate a test range with the target query point as the center and the distance to the kth neighbor trajectory point as the radius;

[0029] Based on the test results of the trajectory points in the second priority queue within the test range, k trajectory points adjacent to the target query point are determined.

[0030] In one embodiment, based on the test results of the track points in the second priority queue in the test range, k track points adjacent to the target query point are determined, specifically including:

[0031] Determine whether the test range intersects with other data blocks; if not,

[0032] Then the k trajectory points within the test range are determined as the k trajectory points adjacent to the target query point; if so,

[0033] Then calculate the distance dist between the trajectory point in the data block intersecting the test range and the target query point, and put the value dist less than dist in the second priority queue. k The trackpoint replacement is added to the second priority queue.

[0034] In one embodiment, the space-time polygon range query algorithm is used to query the target data blocks in which all the trajectory points in the multiple data blocks belong to the target polygon area within the target time period, specifically including:

[0035] Store the horizontal coordinates of each trajectory point in the target polygon area in the array X[], and store the vertical coordinates in the array Y[], and obtain the maximum value x of the array X[]. max and the minimum value x min , and the maximum value y of the array Y[] max and the minimum value y min ;

[0036] Determine whether the trajectory point is within the minimum enclosing rectangle (x min ,y min )-(x max ,y max ); if not,

[0037] It is determined that the trajectory point does not belong to the target polygon area; if so,

[0038] Then the ray drawn from the trajectory point intersects with the target polygonal area, and based on the number of intersection points, it is determined whether the trajectory point belongs to the target polygonal area.

[0039] In one embodiment, spatiotemporal trajectory data is acquired and a spatial index is established, wherein the spatial index includes multiple data blocks, specifically including:

[0040] Define the spatiotemporal trajectory dataset P = {p1, p2, .., p n}, where each trajectory point p1, p2, ..., p n It is expressed as (lng, lat, t), where lng represents longitude, lat represents latitude, and t represents the time attribute;

[0041] The longitude lng and latitude lat of each trajectory point are abstracted into the coordinates of the point on the two-dimensional plane<x,y> , and define two points on the two-dimensional plane The Euclidean distance is

[0042] The present invention also provides a flight data-oriented spatiotemporal trajectory data management and analysis device, comprising:

[0043] An index building module, used to acquire spatiotemporal trajectory data and build a spatial index, wherein the spatial index includes a plurality of data blocks; and

[0044] A query module, used to query the target data blocks in which all the trajectory points in the multiple data blocks belong to the target polygon area within the target time period by using the space-time polygon range query algorithm;

[0045] The space-time polygon range query algorithm includes:

[0046] Calculate the minimum enclosing rectangle of the target polygon area;

[0047] Filtering data blocks intersecting with the minimum bounding rectangle and the target polygonal area from the multiple data blocks, and adding the data blocks to the candidate result set;

[0048] The data blocks whose trajectory points in the candidate set are located in the target polygonal area and whose trajectory time is within the target time period are determined as target data blocks.

[0049] The present invention also provides a computing device, comprising:

[0050] at least one processor; and

[0051] A memory stores instructions, and when the instructions are executed by the at least one processor, the at least one processor executes the method as described above.

[0052] The present invention also provides a machine-readable storage medium storing executable instructions, which, when executed, enable the machine to perform the method as described above.

[0053] Compared with the prior art, the spatiotemporal trajectory data management and analysis method for flight data according to the present invention, through the proposed spatiotemporal polygon range query algorithm, quickly queries the target data blocks belonging to the target polygon area in the constructed spatial index, solves the problem that the existing spatiotemporal data platform does not support the spatiotemporal data structure, and improves the efficiency and accuracy of spatiotemporal range queries; and proposes a spatiotemporal KNN query algorithm, enriches the types of spatiotemporal analysis operation algorithms, and improves the efficiency of spatiotemporal queries; at the same time, a strategy for statistical airspace traffic is proposed to improve query efficiency and functional scalability. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] Figure 1 is a flow chart of an embodiment of a method for managing and analyzing spatiotemporal trajectory data for flight data according to the present invention;

[0055] Figure 2 It is a system architecture diagram of an application scenario of the spatiotemporal trajectory data management and analysis method for flight data according to the present invention;

[0056] Figure 3 is a flow chart of a spatiotemporal polygon range query algorithm according to an embodiment of a spatiotemporal trajectory data management and analysis method for flight data of the present invention;

[0057] Figure 4 is a flow chart of a spatiotemporal KNN query algorithm according to an embodiment of a spatiotemporal trajectory data management and analysis method for flight data of the present invention;

[0058] Figure 5 It is a flow chart of counting airspace traffic according to an embodiment of a method for managing and analyzing spatiotemporal trajectory data for flight data of the present invention;

[0059] Figure 6 It is a module diagram of an embodiment of a device for managing and analyzing spatiotemporal trajectory data for flight data according to the present invention;

[0060] Figure 7 It is a hardware structure diagram of an embodiment of a spatiotemporal trajectory data management, analysis and computing device for flight data according to the present invention. DETAILED DESCRIPTION

[0061] The specific implementation modes of the present invention are described in detail below in conjunction with the accompanying drawings, but it should be understood that the protection scope of the present invention is not limited by the specific implementation modes.

[0062] Unless explicitly stated otherwise, throughout the specification and claims, the term “comprise” or variations such as “include” or “comprising”, etc., will be understood to include the stated elements or components but not to exclude other elements or components.

[0063] Ginseng Figure 1 and Figure 2 , introduces a specific implementation of the spatiotemporal trajectory data management and analysis method for flight data of the present application. In this implementation, the method includes:

[0064] S11. Obtain spatiotemporal trajectory data and establish a spatial index.

[0065] First, define the spatiotemporal trajectory dataset P = {p1,p2,..,p n}, where each trajectory point p1, p2, ..., p n It is expressed as (lng, lat, t), where lng represents longitude, lat represents latitude, and t represents time attribute. In this embodiment, in order to locate the object and calculate the distance between the points in space, the Euclidean space is used to calculate the distance. The distance between two points in space is expressed as Euclidean distance: the longitude lng and the dimension lat of each trajectory point are abstracted into the coordinates of the point on the two-dimensional plane<x,y> , and define two points on the two-dimensional plane The Euclidean distance is In this way, the reading and storage of the spatiotemporal trajectory data is completed.

[0066] Then, a spatial index is created for the spatiotemporal trajectory data, and partition is used to represent each indexed data block. Index is used to represent the index type, input is used to represent input data, and output is used to represent output data. Depending on the index type, different index creation methods can be used.

[0067] S12, using a spatiotemporal polygon range query algorithm to query target data blocks in which all trajectory points in the multiple data blocks belong to a target polygon area within a target time period.

[0068] Mate Reference Figure 3 Specifically, the spatiotemporal polygon range query algorithm includes:

[0069] S121, calculating the minimum enclosing rectangle of the target polygonal area.

[0070] Here, we first define a set of spatiotemporal trajectory datasets P = {p1, p2, .., p n} is E d A set of spatiotemporal trajectory datasets consisting of spatiotemporal trajectory objects in (d-dimensional Euclidean space). For each trajectory point i∈D, there is i=(lng,lat,t), lng represents longitude, lat represents latitude, and t represents time attribute.

[0071] Then set the query range parameters, including the time dimension query range and the space dimension query range. The time query range is T = τ∈(τ begin , τ end ) represents, where τ begin represents the start time, τ end Indicates the end time. The polygon query range q consists of a set of spatial points forming its boundary. Using a positive integer n, a set of x-axis coordinates X = {x1, x2, ..., x n}, a set of y-axis coordinates Y = {y1, y2, ..., y n} means calculating the minimum bounding rectangle mbr of the polygon.

[0072] S122: Filter the data blocks that intersect with the minimum bounding rectangle and the target polygonal area from the multiple data blocks, and add them to the candidate result set.

[0073] For each index data block partition obtained in the above steps, we can first determine whether the partition intersects with the minimum bounding rectangle mbr; if so, we can then determine whether the partition intersects with the polygon query range q; if so, we can add the current partition to the candidate result set. Otherwise, we can continue to determine the next partition until all partitions are screened.

[0074] S123: Determine the data blocks whose trajectory points in the candidate set are located in the target polygonal area and whose trajectory time is within the target time period as target data blocks.

[0075] For each partition in the candidate set, the PNPoly algorithm can be called to determine whether each trajectory point i is within the target polygon area, and at the same time, the time query range is determined. If it is satisfied, it is returned and output.

[0076] Specifically, the horizontal coordinates of each trajectory point in the target polygonal area can be stored in the array X[], and the vertical coordinates can be stored in the array Y[], and the maximum value x of the array X[] can be obtained. max and the minimum value x min , and the maximum value y of the array Y[] max and the minimum value y min ;

[0077] Use (test x ,test y ) represents the query trajectory point, and the judgment trajectory point (test x ,test y ) is within the minimum bounding rectangle (x min ,y min )-(x max ,y max ); if not, it is determined that the trajectory point does not belong to the target polygonal area; if so, a ray is drawn from the trajectory point to intersect the target polygonal area, and based on the number of intersection points, it is determined whether the trajectory point belongs to the target polygonal area.

[0078] Here, if the ray drawn from the trajectory point has an odd number of intersection points with the target polygonal area, it means that the trajectory point is located within the target polygonal area; and if the ray drawn from the trajectory point has an even number of intersection points with the target polygonal area, it means that the trajectory point is located outside the target polygonal area.

[0079] In some embodiments, the spatiotemporal trajectory data management and analysis method for flight data of the present application further includes:

[0080] S13. Calculate k trajectory points adjacent to the target query point based on the KNN query algorithm, thereby capturing the correlation of spatiotemporal trajectory data.

[0081] Mate Reference Figure 4 In the specific process, we can first initialize it, use q to represent a certain target query point, and use k to represent the threshold of the neighboring points near q that need to be queried. begin , τ end ) represents the time query range, where τ begin represents the start time, τ end Indicates the end time. Define two priority queues: the first priority queue PQ and the second priority queue RQ, where PQ represents the set of all partitions that intersect with the query point q. Since the partition may not be unique, the partitions in the priority queue can be sorted by distance. Use p to represent each partition in PQ, and use the RQ priority queue to represent the candidate trajectory points that meet the knn condition.

[0082] Secondly, generate the initial result. Find the data blocks that intersect with the target query point among multiple data blocks and add them to the first priority queue PQ; calculate the distance dist between each data block in the first priority queue PQ and the target query point p , and calculating the kth shortest distance dist between the trajectory points of each data block in the first priority queue and the target query point k (initialized to 0), and then satisfy dist p <dist k The data block corresponding to the trajectory point is determined as the candidate data block. At this time, it means that the candidate data block that meets the condition contains the initial result.

[0083] The first priority queue PQ here can be used to sort each data block partition according to a set rule. In one embodiment, for example, the data blocks are sorted according to the dist p Sort by size in descending order.

[0084] Next, the time range is matched for each trajectory point i in the candidate data block, and the trajectory time in the candidate data block is within the target time period and the distance dist(i,q) from the target query point is less than dist k The trajectory point i is added to the second priority queue RQ, thus obtaining the second priority queue RQ consisting of the initial results.

[0085] Among them, the formula for calculating the distance between the data block partition and the target query point q is:

[0086]

[0087] Among them, p represents each partirion in the PQ queue, i represents each trajectory point in p, q represents the target query point, and dist(i,q) represents the distance between trajectory point i and query point q.

[0088] Similarly, the second priority queue RQ can also sort each data block therein according to a set rule. k Sort by size in descending order.

[0089] Finally, the initial result is tested to determine the final result. Specifically, a test range C (e.g., a circle) with the target query point as the center and the distance to the kth neighbor trajectory point as the radius can be generated, and the k trajectory points adjacent to the target query point can be determined based on the test results of the trajectory points in the second priority queue within the test range.

[0090] Specifically, it can be determined whether the test range C intersects with other data blocks; if not, the k trajectory points in the test range are determined as k trajectory points close to the target query point; if so, the distance dist between the trajectory points in the data blocks intersecting the test range and the target query point is calculated, and dist is smaller than dist in the second priority queue RQ. k The trackpoint replacement is added to the second priority queue.

[0091] During the execution process, the final result can be generated through m rounds of iterations under time constraints. The size of m depends on the distribution of trajectory points in the original data set and the location of the target query point q. In each round of iteration, a data block partition is selected, all trajectory points in the partition are traversed, and the distance dist of the target query point q is calculated. For the selected target trajectory point i and its corresponding dist, the distance is compared with the tail element dist of the second priority queue RQ. k Compare (the data blocks in RQ are based on dist k size in descending order), if dist≤dist k , it means that i is more consistent with the target result, and the selected trajectory point i and its corresponding dist are written into RQ; if not, they are discarded and the next target point is searched. According to the arrangement rule of the priority queue, the elements in the second priority queue RQ are updated. After k rounds of iterations, k nearest results (trajectory points) are finally generated.

[0092] S14. Count the target airspace traffic based on the spatiotemporal polygon range query algorithm.

[0093] Mate Reference Figure 5 Specifically, first obtain the airspace sector parameters. Counting airspace traffic means counting the number of all aircraft passing through a sector. Divide the target airspace sector into multiple regular cylinders, the cross section of which is a polygon composed of multiple points. Define Sector to represent the spatial query range of a three-dimensional sector. The composition of Sector is as follows:

[0094] Sector: <Sid,List <volume>>

[0095] Volume:<Vid,lower,upper,List <point>>

[0096] Point:<Pid,lng,lat>

[0097] Among them, Sid represents the unique id of the sector Sector, using List <volume>Indicates that the sector is composed of a series of cylinders. Use Volume to define the cylinder, Vid to represent the unique id of the cylinder, lower to represent the lower limit of the cylinder height, upper to represent the upper limit of the cylinder height, List <point>Represents the polygonal cross section of the cylinder. Point represents the multiple vertices that make up the polygon. In addition, because the cylinder is a three-dimensional space, the height attribute alt of the trajectory point is introduced to represent the height of the trajectory in the airspace.

[0098] Secondly, define a count queue to record all the trajectory points of the aircraft passing through the sector. Based on the above-mentioned space-time polygon range query algorithm, and using the upper and lower bounds of the height of each column as constraints, filter out the traffic passing through a single column. That is:

[0099] i::PNPoly and τ start ≤it≤τ end and lower≤i.alt≤upper

[0100] Among them, i::PNPoly means that the trajectory point i is inside the polygon, τ start ≤it≤τ end Indicates that the time of the trajectory point is within the constraints, and lower≤i.alt≤upper indicates that the height of the trajectory point is between the upper and lower bounds of the cylinder. Based on the above conditions, determine whether the trajectory point passes through the airspace sector. If it meets the requirements, add it to the counting queue, otherwise, discard it. Repeat this step until all cylinders in the sector are traversed.

[0101] Finally, the trajectory points in the counting queue are deduplicated to obtain the target airspace traffic. The sector traffic can be represented by the number of records res after deduplication in the counting queue. Taking an airplane as an example, its spatiotemporal trajectory points may appear in more than one column, so it is necessary to deduplicate the repeated trajectory points to ensure that the trajectory points of the airplane passing through a sector are only counted once, and finally return res.

[0102] In the specific deduplication process, the trajectory id attribute (Trajid attribute) and the cylinder Vid (initialized to 0) are defined for the trajectory points in the counting queue; when the spatiotemporal polygon range query algorithm is executed on each cylinder, if the trajectory point i is within the cylinder Volume, the Vid of the trajectory id attribute is marked as the Vid of the current cylinder to form a composite key<Trajid,Vid> ; Use the composite key of each row of records to deduplicate the track points of the counting queue.

[0103] Ginseng Figure 2 , which is a spatiotemporal trajectory data system applied by the spatiotemporal trajectory data management and analysis method for flight data proposed in the above embodiments. It includes storage and processing nodes, index layer, spatiotemporal operation algorithm, statistical airspace traffic and user request. Among them, the spatiotemporal trajectory data set can be stored in the HDFS file system of the Hadoop platform; the index layer is responsible for establishing indexes on the data source, and the present invention supports different spatiotemporal indexes (Grid index, Rtree index, KDTree index, etc.); the spatiotemporal operation algorithm is the spatiotemporal polygon range query algorithm and the spatiotemporal KNN algorithm mentioned in the above embodiments; based on spatiotemporal operation, the application service of statistical airspace traffic can be realized, and the final result is stored on HDFS; when an external spatiotemporal query request is connected to the system, the system can process the request in time and return the final result. The user obtains the final result directly on HDFS.

[0104] Ginseng Figure 6 The embodiment of the present application also provides a flight data-oriented spatiotemporal trajectory data management and analysis device, which includes an index building module, a query module, a traffic statistics module, and a capture module.

[0105] An index building module, used to acquire spatiotemporal trajectory data and build a spatial index, wherein the spatial index includes a plurality of data blocks;

[0106] A query module, used to query the target data blocks in which all the trajectory points in the multiple data blocks belong to the target polygon area within the target time period by using the space-time polygon range query algorithm;

[0107] The space-time polygon range query algorithm includes:

[0108] Calculate the minimum enclosing rectangle of the target polygon area;

[0109] Filtering data blocks that intersect with the minimum bounding rectangle and the target polygonal area from the multiple data blocks, and adding them to a candidate result set;

[0110] The data blocks whose trajectory points in the candidate set are located in the target polygonal area and whose trajectory time is within the target time period are determined as target data blocks.

[0111] The traffic statistics module is used to count the target airspace traffic based on the space-time polygon range query algorithm; specifically, it is used to: divide the target airspace sector into multiple regular cylinders; based on the space-time polygon range query algorithm, and using the upper and lower bounds of the height of each cylinder as constraints, filter out the trajectory points in each cylinder to add to the counting queue; deduplicate the trajectory points in the counting queue to obtain the target airspace traffic.

[0112] In one embodiment, the traffic statistics module is specifically used to: define a trajectory id attribute and a cylinder Vid to which the trajectory point in the counting queue belongs; when executing the spatiotemporal polygon range query algorithm for each cylinder, if the trajectory point is within the cylinder, mark the Vid of the trajectory id attribute as the Vid of the current cylinder to form a composite key<Trajid,Vid> ; Using the composite key of each row of records, deduplicate the data of the trajectory points of the counting queue.

[0113] The capture module is used to calculate k trajectory points adjacent to the target query point based on the KNN query algorithm, so as to capture the correlation of spatiotemporal trajectory data; specifically, it is used to: find the data blocks that intersect with the target query point in the multiple data blocks, and add them to the first priority queue; calculate the distance dist between each data block in the first priority queue and the target query point p ; Calculate the kth shortest distance dist between the trajectory points of each data block in the first priority queue and the target query point k ; will satisfy dist p <dist k The data block corresponding to the trajectory point is determined as the candidate data block; the candidate data block whose trajectory time is within the target time period and whose distance to the target query point is less than dist(i,q) is selected. k The trajectory points are added to the second priority queue; a test range is generated with the target query point as the center and the distance to the kth neighbor trajectory point as the radius; based on the test results of the trajectory points in the second priority queue within the test range, k trajectory points adjacent to the target query point are determined.

[0114] In one embodiment, the capture module is specifically used to: determine whether the test range intersects with other data blocks; if not, determine the k trajectory points in the test range as k trajectory points adjacent to the target query point; if so, calculate the distance dist between the trajectory points in the data block intersecting the test range and the target query point, and set the value of dist smaller than dist in the second priority queue. k The trackpoint replacement is added to the second priority queue.

[0115] In one embodiment, the query module is specifically used to: store the horizontal coordinates of each trajectory point of the target polygonal area in an array X[], store the vertical coordinates in an array Y[], and obtain the maximum value x of the array X[]. max and the minimum value x min , and the maximum value y of the array Y[] max and the minimum value y min ; Determine whether the trajectory point is within the minimum enclosing rectangle (x min ,y min )-(x max ,y max ); if not, it is determined that the trajectory point does not belong to the target polygonal area; if so, a ray is drawn from the trajectory point to intersect the target polygonal area, and based on the number of intersection points, it is determined whether the trajectory point belongs to the target polygonal area.

[0116] In one embodiment, the establishment module is specifically used to: define a spatiotemporal trajectory data set P = {p1, p2, .., p n }, where each trajectory point p1, p2, ..., p n It is expressed as (lng, lat, t), where lng represents longitude, lat represents latitude, and t represents time attribute; the longitude lng and latitude lat of each trajectory point are abstracted into the coordinates of the point on the two-dimensional plane<x,y> , and define two points on the two-dimensional plane The Euclidean distance is

[0117] Figure 7 FIG. 2 shows a hardware structure diagram of a computing device 30 for managing and analyzing the spatiotemporal trajectory data of flight data according to an embodiment of the present specification. Figure 7 As shown, the computing device 30 may include at least one processor 301, a memory 302 (e.g., a non-volatile memory), a memory 303, and a communication interface 304, and the at least one processor 301, the memory 302, the memory 303, and the communication interface 304 are connected together via a bus 305. At least one processor 301 executes at least one computer-readable instruction stored or encoded in the memory 302.

[0118] It should be understood that the computer executable instructions stored in the memory 302, when executed, cause at least one processor 301 to perform the above combined operations in various embodiments of the present specification. Figure 1-5 Describes the various operations and functions.

[0119] In the embodiments of the present specification, the computing device 30 may include, but is not limited to, a personal computer, a server computer, a workstation, a desktop computer, a laptop computer, a notebook computer, a mobile computing device, a smart phone, a tablet computer, a cellular phone, a personal digital assistant (PDA), a handheld device, a messaging device, a wearable computing device, a consumer electronic device, and the like.

[0120] According to one embodiment, a program product such as a machine-readable medium is provided. The machine-readable medium may have instructions (i.e., the above-mentioned elements implemented in the form of software), which, when executed by a machine, causes the machine to perform the above-mentioned combination of various embodiments of this specification. Figure 1-5 Specifically, a system or device equipped with a readable storage medium may be provided, on which a software program code implementing the functions of any of the above-mentioned embodiments is stored, and a computer or processor of the system or device reads and executes the instructions stored in the readable storage medium.

[0121] In this case, the program code itself read from the machine-readable medium can realize the function of any one of the above embodiments, and thus the machine-readable code and the machine-readable storage medium storing the machine-readable code constitute part of this specification.

[0122] Examples of readable storage media include floppy disks, hard disks, magneto-optical disks, optical disks (such as CD-ROM, CD-R, CD-RW, DVD-ROM, DVD-RAM, DVD-RW, DVD-RW), magnetic tapes, non-volatile memory cards, and ROMs. Optionally, the program code may be downloaded from a server computer or a cloud via a communication network.

[0123] Those skilled in the art should understand that the various embodiments disclosed above can be modified and altered in various ways without departing from the essence of the invention. Therefore, the protection scope of this specification should be defined by the appended claims.

[0124] It should be noted that not all steps and units in the above-mentioned processes and system structure diagrams are necessary, and some steps or units can be ignored according to actual needs. The execution order of each step is not fixed and can be determined as needed. The device structure described in the above-mentioned embodiments can be a physical structure or a logical structure, that is, some units may be implemented by the same physical client, or some units may be implemented by multiple physical clients, or some components in multiple independent devices may be implemented together.

[0125] In the above embodiments, the hardware unit or module can be realized by mechanical or electrical means. For example, a hardware unit, module or processor can include permanent dedicated circuit or logic (such as special processor, FPGA or ASIC) to complete the corresponding operation. The hardware unit or processor can also include programmable logic or circuit (such as general-purpose processor or other programmable processor), which can be temporarily set by software to complete the corresponding operation. Specific implementation (mechanical method or dedicated permanent circuit or temporary circuit) can be determined based on cost and time consideration.

[0126] The specific embodiments described above in conjunction with the accompanying drawings describe exemplary embodiments, but do not represent all embodiments that can be implemented or fall within the scope of protection of the claims. The term "exemplary" used throughout this specification means "used as an example, instance, or illustration" and does not mean "preferred" or "having advantages" over other embodiments. For the purpose of providing an understanding of the described technology, the specific embodiments include specific details. However, these technologies can be implemented without these specific details. In some instances, in order to avoid obscuring the concepts of the described embodiments, well-known structures and devices are shown in block diagram form.

[0127] The above description of the present disclosure is provided to enable any person of ordinary skill in the art to implement or use the present disclosure. Various modifications to the present disclosure will be apparent to those of ordinary skill in the art, and the general principles corresponding to the present disclosure may be applied to other variations without departing from the scope of protection of the present disclosure. Therefore, the present disclosure is not limited to the examples and designs described herein, but is consistent with the widest range of principles and novel features disclosed herein.< / point> < / volume> < / point> < / volume>

Claims

1. A method for managing and analyzing spatiotemporal trajectory data for flight data, characterized in that: include: Acquire spatiotemporal trajectory data and establish a spatial index, wherein the spatial index includes a plurality of data blocks; as well as, Using a spatiotemporal polygon range query algorithm to query a target data block in which all trajectory points in the plurality of data blocks belong to a target polygon area within a target time period; The space-time polygon range query algorithm includes: Calculate the minimum enclosing rectangle of the target polygon area; Filtering data blocks intersecting with the minimum bounding rectangle and the target polygonal area from the multiple data blocks, and adding the data blocks to the candidate result set; Determine the data blocks in the candidate result set whose trajectory points are within the target polygonal area and whose trajectory time is within the target time period as target data blocks; The method further includes calculating k trajectory points adjacent to the target query point based on a KNN query algorithm, thereby capturing the correlation of spatiotemporal trajectory data; specifically including: Finding a data block intersecting with the target query point among the multiple data blocks, and adding the data block to the first priority queue; Calculate the distance dist between each data block in the first priority queue and the target query point p , p represents each data block in the first priority queue; Calculate the kth shortest distance dist between the trajectory points of each data block in the first priority queue and the target query point k , k represents the kth trajectory point; will satisfy dist p <dist k The data block corresponding to the trajectory point is determined as a candidate data block; The trajectory time in the candidate data block is within the target time period and the distance from the target query point Less than dist k The trajectory points are added to the second priority queue, represents the distance between trajectory point i and query point q, where q represents the target query point; Generate a test range with the target query point as the center and the distance to the kth neighbor trajectory point as the radius; Based on the test results of the trajectory points in the second priority queue within the test range, k trajectory points adjacent to the target query point are determined.

2. The method for managing and analyzing spatiotemporal trajectory data for flight data according to claim 1, characterized in that: The method further comprises counting target airspace traffic based on the spatiotemporal polygon range query algorithm; Specifically include: Divide the target airspace sector into a plurality of regular cylinders; Based on the space-time polygon range query algorithm and using the upper and lower bounds of the height of each cylinder as constraints, the trajectory points located in each cylinder are filtered out to add to the counting queue; The trajectory points in the counting queue are deduplicated to obtain the target airspace traffic.

3. The method for managing and analyzing spatiotemporal trajectory data for flight data according to claim 2, characterized in that: Deduplication of the trajectory points in the counting queue is performed to obtain the target airspace traffic, specifically including: Define the track id attribute and the cylinder V to which the track point belongs in the counting queue id , V id Indicates the unique id of the column; When executing the space-time polygon range query algorithm on each cylinder, if the trajectory point is within the cylinder, the V of the trajectory id attribute is id Marked as V for the current column id , to form a composite key; The composite key of each row of records is used to deduplicate data of the trajectory points of the counting queue.

4. The method for managing and analyzing spatiotemporal trajectory data for flight data according to claim 1, characterized in that: Determining k trajectory points adjacent to the target query point based on the test results of the trajectory points in the second priority queue in the test range specifically includes: Determine whether the test range intersects with other data blocks; if not, Then the k trajectory points within the test range are determined as the k trajectory points adjacent to the target query point; if so, Then calculate the distance dist between the trajectory point in the data block intersecting the test range and the target query point, and put the value dist less than dist in the second priority queue. k The trackpoint replacement is added to the second priority queue.

5. The method for managing and analyzing spatiotemporal trajectory data for flight data according to any one of claims 1 to 4, characterized in that: The target data blocks in which all the trajectory points in the plurality of data blocks belong to the target polygon area within the target time period are queried using the spatiotemporal polygon range query algorithm, specifically including: Store the horizontal coordinates of each trajectory point in the target polygon area in array X, store the vertical coordinates in array Y, and obtain the maximum value of array X and minimum value , and the maximum value of array Y and minimum value ; Determine whether the trajectory point is in the minimum enclosing rectangle of the target polygon area medium; if not, It is determined that the trajectory point does not belong to the target polygon area; if so, Then the ray drawn from the trajectory point intersects with the target polygonal area, and based on the number of intersection points, it is determined whether the trajectory point belongs to the target polygonal area.

6. The method for managing and analyzing spatiotemporal trajectory data for flight data according to any one of claims 1 to 4, characterized in that: Acquire spatiotemporal trajectory data and establish a spatial index, wherein the spatial index includes multiple data blocks, specifically including: Defining spatiotemporal trajectory datasets , where each trajectory point p1, p2, ..., p n Expressed as , Indicates longitude, Indicates latitude, Represents time attributes; The longitude of each track point and dimensions , abstracted as the coordinates of a point on a two-dimensional plane , and define two points on the two-dimensional plane The Euclidean distance is .

7. A device for managing and analyzing spatiotemporal trajectory data for flight data, characterized in that: include: An index building module, used to acquire spatiotemporal trajectory data and build a spatial index, wherein the spatial index includes a plurality of data blocks; as well as, A query module, used to query the target data blocks in which all the trajectory points in the multiple data blocks belong to the target polygon area within the target time period by using the space-time polygon range query algorithm; The space-time polygon range query algorithm includes: Calculate the minimum enclosing rectangle of the target polygon area; Filtering data blocks intersecting with the minimum bounding rectangle and the target polygonal area from the multiple data blocks, and adding the data blocks to the candidate result set; Determine the data blocks in the candidate result set whose trajectory points are within the target polygonal area and whose trajectory time is within the target time period as target data blocks; The capture module is used to calculate k trajectory points adjacent to the target query point based on the KNN query algorithm, so as to capture the correlation of spatiotemporal trajectory data; specifically used to: find the data blocks that intersect with the target query point in the multiple data blocks, and add them to the first priority queue; calculate the distance dist between each data block in the first priority queue and the target query point p , p represents each data block in the first priority queue; calculate the kth shortest distance dist between the trajectory point of each data block in the first priority queue and the target query point k , k represents the kth trajectory point; it will satisfy dist p <dist k The data block corresponding to the trajectory point is determined as a candidate data block; the trajectory time in the candidate data block is within the target time period and the distance from the target query point Less than dist k The trajectory points are added to the second priority queue, Represents the distance between trajectory point i and query point q, where q represents the target query point; generates a test range with the target query point as the center and the distance to the kth neighbor trajectory point as the radius; based on the test results of the trajectory points in the second priority queue within the test range, determines the k trajectory points close to the target query point.

8. A computing device comprising: at least one processor; as well as A memory storing instructions, wherein when the instructions are executed by the at least one processor, the at least one processor executes the method according to any one of claims 1 to 6.

9. A machine-readable storage medium storing executable instructions, wherein when the instructions are executed, the machine executes the method according to any one of claims 1 to 6.