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.

To determine relationships among objects represented in a database at least one interior rectangle lying entirely within a first geometric shape is define. A minimum bounding area for the first geometry and a minimum bounding area for a second geometry are defined and compared with one another to determine if the second geometry fulfills a primary filter condition of an interaction between the first and second geometries. Based on the fulfillment of the primary condition by the second geometry, it is determined whether an intermediate filter condition of interaction between the first and second geometries is fulfilled by analyzing the distribution of the second geometry with respect to at least one interior rectangle within the first geometry. It is determined whether the second geometry fulfills a secondary filter condition by comparing the second geometry with the first geometry if the second geometry fulfills the primary filter condition.

The invention discloses a high-efficiency difference disturbance location privacy protection system and a method, considering that the attacker has the challenge to the location privacy protection method based on the location disturbance and fuzzy technology about the background knowledge of the user side information, the difference privacy protection technology is guided to the location fuzzy privacy protection method, the Hilbert space filling curve capable of self-adaption transition on the user location according to the distributed change features in the geographic space of the mobile user and the current fashionable quadtree or R tree spatial index are used for forming the location index for all mobile users in the geographic space, and the K anonymity contact area satisfying the principle of reciprocity is effectively generated. Then, the difference privacy protection technology is used for generating the location disturbance point reasonable near user real location of k location points of the contact area as the query location of LBS user for requesting service from the LBS service provider, the problems and deficiencies of the existing method can be overcome.

A text sentence comparison method includes converting a first text sentence and a second text sentence into a first R tree (or a first RO tree) and a second R tree (or a second RO tree), respectively, calculating a distance between the first R tree and the second R tree (or a distance between the first RO tree and the second RO tree) on the basis of a distance between two R trees (or a distance between two RO trees), which is defined at least in accordance with a condition of a mapping between vertexes and edges of the two R trees (or the two RO trees), and calculating a distance between the first text sentence and the second text sentence on the basis of the calculated distance between the first R tree and the second R tree (or the calculated distance between the first RO tree and the second RO tree).

The invention relates to a method and apparatus that uses an R-tree's vector data as a mechanism for query and retrieval of raster data in conjunction with or instead of the vector data. The invention relates to a method of storing, indexing and retrieving raster data comprising: storing raster data, storing vector data, and indexing said raster data and said vector data with same index information.

The invention discloses a data index building and query method for Internet of Things intellisense. The method includes: firstly, sampling by a data monitoring unit, and storing data to a sample data storage server of the Internet of Things; secondly, allowing a sample data server to organize sampled values of one monitoring object according to a sampling time sequence to form a sampled value sequence of the monitoring object, and storing the sampled value sequence as an attribute value in data record of the monitoring object; and thirdly, building a tree index layer, and indexing the monitoring object data records stored by the sample data storage servers of the Internet of Things. The tree index layer comprises a plurality of index servers. A master node is named as an index master server, and other nodes are named as index slave servers. The tree index layer includes a full-text keyword B<+> tree index, an Internet of Things space-time R tree index, and a sample component symbolic keyword B<+> tree index. The data index building and query method for Internet of Things intellisense is applicable to real-time multimodal search of massive data of Internet of Things.

A text sentence comparison method includes converting a first text sentence and a second text sentence into a first R tree (or a first RO tree) and a second R tree (or a second RO tree), respectively, calculating a distance between the first R tree and the second R tree (or a distance between the first RO tree and the second RO tree) on the basis of a distance between two R trees (or a distance between two RO trees), which is defined at least in accordance with a condition of a mapping between vertexes of the two R trees (or the two RO trees), and calculating a distance between the first text sentence and the second text sentence on the basis of the calculated distance between the first R tree and the second R tree (or the calculated distance between the first RO tree and the second RO tree).

The present invention provides a wireless communication computer field, in particular relating to a spatial-temporal data fast index method, it is a high effect indexing mechanism, storing different time stamp space-time state using overlapping indexed structure, if the adjacent time slices have identical R-tree index branch, only one version is kept, this reduces the storage space. At the same time, data on one time slice adopts blocking index mechanism based on the four-fork tree no longer finding whole index space, the whole space is divided into n=sumd-1i=0(2k)i sub-index spaces (d is depth of the four-fork tree, k is dimensionality of the index space), only need find one subspace therein, greatly reduces the index time. Utilizing the index method is used for high efficient location of multiple wireless move node and data monitor management.

Determining relationships among objects represented in a database includes defining a plurality of tiles in the approximation of the first geometry by dividing the approximation of the first geometry in a first direction a plurality of times and dividing the approximation of the first geometry in a second direction perpendicular to the first direction a plurality of times. A second geometry is analyzed to determine if it fulfills a first filter condition with respect to any of the tiles defined in the approximation of the first geometry. If the second geometry fulfills the first filter condition with respect to any of the tiles defined in the first geometry carrying out a mathematical comparison of the first geometry and the second geometry.

The invention relates to a three-dimensional R-tree index expansion structure-based three-dimensional city model adaptive method. The method comprises the following steps of: expanding a three-dimensional R-tree index expansion structure to ensure that an intermediate node can manage a target model; generating a multi-level of detail (LOD) target model from a leaf node layer to a root node layer, namely from bottom to top layer by layer, wherein different R-tree layers represent different LODs; a target in the leaf node layer is the highest LOD model; a father node of the leaf node layer is an LOD model of a second detail; and the LOD is gradually lowered upwards in turn, and the root node layer has the lowest LOD; defining multi-LOD definition parameters which comprise the number of layers, the farthest action range of the highest LOD, and the interlayer times; and in a real-time visual process, modifying the multi-LOD definition parameter in real time according to the current performance so as to quantitatively adjust the scene complexity of a three-dimensional city model.

A method for determining a with-distance relationship between a first geometry object and a second geometry object. The method includes defining an exterior approximation of the first geometry and the second geometry. A distance between the exterior approximations is computed. The computed distance is compared with a first predetermined distance to determine whether the second geometry satisfies a first filter condition with respect to the first geometry.

A method for determining a with-distance relationship between a first geometry object and a second geometry object. The method includes defining an exterior approximation of the first geometry and the second geometry. A distance between the exterior approximations is computed. The computed distance is compared with a first predetermined distance to determine whether the second geometry satisfies a first filter condition with respect to the first geometry.

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 relates to a quick query method of position information on the basis of a space index technology. The method comprises the following steps that: according to target space coordinate information to be queried, establishing an R tree space index, establishing R tree node mapping on an HBase database, and forming a space index database; according to a minimum boundary rectangle formed by user input coordinate information, carrying out query in the space index database; and returning a query result to the user. By use of the method, an R tree space index technology can be adopted to realize the quick query of a space coordinate. A bottom layer adopts the HBase database as a storage medium, the parallelization of a query task can be realized, and query performance is improved. Information including oil spill and the like can be accurately positioned. In addition, compared with a traditional method, the quick query method is characterized in that query performance is obviously improved, and is suitable for system development which aims at oil field or ocean data coordinate information query.

The invention belongs to the technical field of cloud computing private protection, and discloses an efficient ciphertext retrieval method based on CP-ABE automatic correction and a cloud computing service system. The method comprises the steps of storing an encrypted Bloom filter and a corresponding ciphertext file ID set in a leaf node of the R tree by combining the R tree and the Bloom filter as index structures; using the cloud server to perform the matrix positioning on the R tree according to the search trap door, and then match the encrypted Bloom filters in the leaf nodes; sorting thefiles according to the inner product result of the Bloom filter; introducing a random number in the trap door generation process, wherein different trap doors can be generated even if according to thesame keyword; performing the co-encryption by using the access structure and the owner secret attribute. According to the method, a symmetric key with a small CP-ABE encryption volume is used, so that the fine-grained access control is realized; a multi-agent server is introduced to realize the decentralization, and the collusion between the proxy servers is prevented.

The invention discloses a segmentation-based hidden Markov model map matching method. The method comprises the following steps: step one, carrying out noise processing on a GPS trajectory and establishing a R-tree spatial index on a road network; step two, carrying out segmentation on the GPS trajectory based on an angle and searching a candidate path set corresponding to the segmented sub-trajectory segments; and step three, selecting a path with the highest probability corresponding to the trajectory as a matching result by using a hidden Markov model. Therefore, a problem of low efficiencyof the GPS trajectory point-by-point map matching method is solved; and the accuracy of map matching is improved.