Geo-BTree-based range query method and device
A query method and range of technology, applied in special data processing applications, instruments, electrical digital data processing and other directions, can solve problems such as low retrieval efficiency, and achieve the effect of high query efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0044] Embodiment 1: as Figure 1-10 As shown, a range query method based on Geo-BTree, including:
[0045] Data preprocessing steps:
[0046] Step 111, according to the geohash precision table (such as figure 2 shown), set the geohash encoding length n to 8, and the longitude and latitude bit strings are 20 bits respectively;
[0047] Step 112, convert the position point in D into a character string with a length of 8 through the geohash algorithm, and the implementation method is as follows:
[0048] Example: (19.596412 -99.219501)
[0049] First divide the latitude range (-90,90) into two intervals (-90,0) and (0,90). If the target latitude is in the previous interval, it is coded as 0, otherwise it is coded as 1. Because 19.596412 belongs to the interval (0,90), it is encoded as 1; then (0,90) is divided into two intervals (0,45) and (45,90), because 19.596412 belongs to the interval (0,45), so Coded as 0; and so on until the length of the bit string is 20. The fina...
Embodiment 2
[0117] Embodiment 2: as Figure 1-10 As shown, a range query method based on Geo-BTree, including:
[0118] The data preprocessing step is to encode all the position points in the data set into a character string with a length of n, sort the position points in the data set according to the lexicographical order according to the character strings, and number the IDs;
[0119] The spatial index building step is to build a B-Tree index structure according to the sorted strings;
[0120] In the range query step, starting from the ID returned by retrieving the B-Tree index structure, two-way search is performed in the record set to obtain the ID in the query domain, and the ID candidate set is obtained after filtering, and the position point corresponding to the ID in the candidate set is verified and returned within the query range location point.
[0121] Further, the data preprocessing step may be set, specifically including the following steps:
[0122] Step 110: Given a dat...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com