169 results about "R-tree" patented technology

An apparatus and method for rapid translation of geographic latitude and longitude into any of a number of application-specific location designations or location classifications, including street address, nearest intersection, PSAP (Public Safety Answering Point) zone, telephone rate zone, franchise zone, or other geographic, administrative, governmental or commercial division of territory. The speed of translation meets call-setup requirements for call-processing applications such as PSAP determination, and meets caller response expectations for caller queries such as the location of the nearest commercial establishment of a given type. To complete its translation process in a timely manner, a memory-stored spatial database is used to eliminate mass-storage accesses during operation, a spatial indexing scheme such as an R-tree over the spatial database is used to locate a caller within a specific rectangular area, and an optimized set of point-in-polygon algorithms is used to narrow the caller's location to a specific zone identified in the database. Additional validation processing is supplied to verify intersections or street addresses returned for a given latitude and longitude. Automatic conversion of latitude-longitude into coordinates in different map projection systems is provided. The memory-stored database is built in a compact and optimized form from a relational spatial database as required. The R-tree spatial indexing of the memory-stored database allows for substantially unlimited scalability of database size without degradation of response time. Maximum performance for database retrievals is assured by isolating the retrieval process from all updating and maintenance processes. Hot update of the in-memory database is provided without degradation of response time.

The invention relates to a range image-based 3D spatial data processing method and a device. In the method, ground laser radar is adopted to scan an object to obtain 3D point cloud data on the surface of the object; a database object table is established by a PL/SQL programming approach; a reference datum is fit according to point cloud which is segmented in advance to generate a minimum bounding box (MBB) of the point cloud and subsequently generate the range image according to the reference datum obtained by fitting. Later, data of the MBB and the range image are written into the database object table and the relation between the MBB and a range image object is established, subsequently, R tree 3D spatial database index is established for the database objects which enter the database, finally, visualization is realized based on Oracle Objects for OLE (OO4O) and OpenGL.

A high-density, distance-measuring laser system and an associated computer that processes the data collected by the laser system. The computer determines a data partition structure and stores that structure as a header file for the scan before data is collected. As the scan progresses, the computer collects data points until a predetermined threshold is met, at which point a block of data consisting of the data points up to the threshold is written to disk. The computer indexes each data block using all three coordinates of its constituent data points using, preferably, a flexible index, such as an R-tree. When a data block is completely filled, it is written to disk preferably with its index and, as a result, each data block is ready for access and manipulation virtually immediately after having been collected. Also, each data block can be independently manipulated and read from disk.

The invention discloses an uncertain space-time trajectory data range query method under road network environment. The process includes that firstly, a road network is divided into divided areas with the number of K; a hash table is established according to sides and divided corresponding relations; boundary points of the divided areas are calculated, and a two-dimensional space R tree index is established; the shortest path distance among the boundary points of each dividing is calculated; a one-dimensional R tree time quantum index is established for each dividing, and a B+ tree for storing trajectory data for each one-dimensional R tree is established; then, the earliest arrival time and the latest leaving time of a certain trajectory and an uncertain trajectory are calculated, and a unit segment assemble and divided beginning and ending time are inserted into time interval components; and finally, according to the dividing of a query point, distance information of a divided boundary point and the query point is calculated, and therefore a query result is obtained. According to the uncertain space-time trajectory data range query method under the road network environment, a small amount of input/output (I/O) operations and online calculation are only needed to be performed for a part of dividing, the query results can be obtained, and the query results are high in accuracy degree and fast in response speed.

The embodiment of this invention discloses a position detecting method and device based on geo-fencing, relates to the field of position service, and is used for improving the accuracy of the position detection. the method includes the steps of when a position update of a terminal is detected, acquiring a current geographical coordinate of the terminal; detecting whether the acquired geographical coordinate is located in a rectangular coverage area represented by each leaf node in a pre-structured R-tree structure or not; if so, acquiring an actual coverage range of a polygonal geo-fence located in the rectangular coverage area; further detecting whether the geographical coordinate is located in the actual coverage range of the polygonal geo-fence or not, and outputting a detection result; and thus, the accuracy of the position detection is improved.

The invention discloses a three-dimensional space index method aiming at massive laser radar point cloud models. Aiming at characteristics of massive data and high spatial resolution of point cloud models, the method indexes data to a single three-dimensional space point by adopting a multi-level hybrid index strategy; aiming at an integrity characteristic of point cloud models, the method continuously subdivides massive cloud points from a minimum bounding rectangle (MBB) of an overall point cloud model by adopting a cotree index, and three-dimensional points in cotree index nodes are distributed uniformly in space; and aiming at a scattered characteristic and the data post-processing requirement of large-scale point cloud models, the method indexes a single three-dimensional space point by adopting a three-dimensional K-D tree, and the quick inquiry and processing of a single point coordinate and the attribute data of the single point coordinate can be achieved. On the basis of above integrated space index construction, the method adopts a three-dimensional R tree to manage the MBBs of a plurality of point cloud models in three-dimensional scenes, and a multi-level hybrid space index mode is formed finally.

A method and an apparatus for authenticating location-based services without compromising location privacy, which comprises a comprehensive solution that preserves unconditional location privacy when authenticating either range queries using three authentication schemes for R-tree and grid-file index, together with two optimization techniques, or k-nearest neighbor queries using two authentication schemes for R-tree and Voronoi Diagram index.

In a database system having a primary server side (10) and a secondary server side (30), a high availability data replicator (26, 46) transfers log entries from the primary side (10) to the secondary side (30) and replays the transferred log entries to synchronize the secondary side (30) with the primary side (10). R-tree index transfer threads (54, 56) copy user-defined routines, the user defined index, and index databases deployed on the primary server side (10) to the secondary server side (30) and deploy the copied user-defined routines, reconstruct the user-defined index, and copy data pages on the secondary side (30) to make the user-defined index consistent and usable on the secondary side (30).

The invention discloses a regional early warning method based on a limited location. According to the divided geographic location ranges of different danger levels, a plurality of electronic fences used to represent different danger levels are set up, and the electronic fences are polygonal; each electronic fence is established. The outermost minimum rectangle of the electronic fence; take each side of the electronic fence as a diagonal line, and establish the minimum outer rectangle for each edge, according to the smallest outer rectangle as the leaf node, the outermost smallest rectangle of the electronic fence as the root node and the preset R The tree construction rules establish an R tree; obtain the position of the target in real time, and use the ray algorithm based on the R tree index to judge whether the position of the target is located in a certain electronic fence area; according to the judgment that the target is in a certain electronic fence, In this way, the danger warning level of the target position is divided. Notifications are made through Beidou satellite signals, enabling relevant personnel to leave the dangerous area in time.

The invention discloses a spatial index establishing method, a spatial index use method and a spatial index use device. The spatial index establishing method includes using classes set in a classification database for classifying spatial objects in a spatial database; aiming at the spatial objects of each class and according to distribution of the spatial objects of the class in a spatial region, continuously dividing the spatial region by the aid of a quadtree mode until distribution of the spatial objects of the class in each divided sub-region satisfies set conditions; and establishing spatial indexes for the spatial objects of the class in each divided sub-region by the aid of an R-tree mode. Probability of interlapping of various spatial objects can be decreased by establishing the spatial indexes for the spatial objects of each class, and since spatial regions dense in spatial object distribution are divided into smaller regions according to distribution characteristics of all classes of spatial objects when the spatial indexes are established for each class of spatial objects, spatial overlapping probability is further decreased, and speed of using the established spatial indexes for searching is increased while accuracy of using the established spatial indexes for searching is improved.

The invention belongs to the technical field of a spatial database and in particular relates to a method for querying a road network k aggregation nearest neighboring node (k-ANN) based on a Voronoi graph. The method comprises the following steps of: resolving a first nearest neighboring node (1-NN) of each query point through an R tree index; constructing a priority queue to store the 1-NN of all query points, wherein the weight is the current aggregation distance from each query point to a target node; extending a certain query point according to a certain sequence on the basis of a road network Voronoi graph, updating the aggregation distance of the next NN of the query point, inserting or updating and performing other kinds of operation on the priority queue until the target node at the head of the queue is extended by all the query points, then the target node is a first aggregation nearest neighboring node (1-ANN); and after the 1-ANN is deleted from the queue, acquiring a second aggregation nearest neighboring node (2-ANN) which accords with the conditions for the second time, and acquiring the k-ANN according to the characteristics. The method has excellent performance in the aspect of response time and page views of user query.

The present invention relates to a lazy bulk insertion method for moving object indexing, which utilizes a hash-based data structure to overcome the disadvantages of an R-tree, and uses two buffers to simultaneously store operations in the buffers and process queries stored in the buffers, so that the overall update cost can be reduced. In the lazy bulk insertion method, a buffer is substituted and a state of the buffer is changed to a deactivated state if an input query cannot be stored in the buffer. Operations stored in the deactivated buffer are sequentially analyzed, information about objects corresponding to respective operations is obtained from a direct link to analyze the operations, and thus the operations are aligned on the basis of object IDs. Operations, aligned in ascending order of spatial objects, are identified depending on respective objects, effectiveness of the operations is determined, and thus the operations are realigned on the basis of terminal node IDs. The number of insert operations and the number of delete operations are counted for each terminal node, and variation in the number of empty spaces in the terminal node is obtained, thus splitting and merging of the terminal nodes is predicted. A processing sequence of queries is reorganized so as to reduce variation in the node on the basis of the predicted information.

A method for locating neighboring data geometries of a query geometry. A minimum bounding rectangle of the query geometry is determined. A minimum bounding rectangle of each data geometry is determined. Candidate data geometries are identified by determining if a distance between the minimum bounding rectangle of the query geometry and the data geometry is less than a threshold distance. A distance between the query geometry and the candidate data geometry is mathematically calculated when a number of candidate data geometries equals a threshold number or when no more data geometries remain.

The invention discloses a storage and management method for vector big data in water conservancy space. The method comprises the steps that step 1, enabling a computer to express a water conservancy space vector data set; step 2 performing parallel conversion of vector data; step 3, performing spatial data division based on the calculation amount evaluation model; step 4, constructing a distributed spatial grid R tree index; and step 5, carrying out vector data distributed memory parallel retrieval. According to the method, the bottleneck problem that spatial data and attribute data are separately treated when the spatial data and the attribute data are stored through a traditional relational database is solved. The balance of the distributed calculation amount is fully considered. The problems of low construction speed and low retrieval efficiency of the traditional space vector data index are solved.