spatial-index

问题 I have a table 'floating_options', and I want to create a spatial index on a column 'area_geo' (which is a sdo_geometry column, with two rows of data that appear as expected when I select * from floating_options). I have used the following code but I am receiving the error below. I would be very grateful for any help! Thanks! CREATE INDEX area_idx ON floating_options(area_geo) INDEXTYPE IS MDSYS.SPATIAL_INDEX; Error report - SQL Error: ORA-29855: error occurred in the execution of

问题 I have a table 'floating_options', and I want to create a spatial index on a column 'area_geo' (which is a sdo_geometry column, with two rows of data that appear as expected when I select * from floating_options). I have used the following code but I am receiving the error below. I would be very grateful for any help! Thanks! CREATE INDEX area_idx ON floating_options(area_geo) INDEXTYPE IS MDSYS.SPATIAL_INDEX; Error report - SQL Error: ORA-29855: error occurred in the execution of

问题 I am attempting to utilize the spatial index. I have a table of ips, and a ip2geo table with ip block ranges. I'm attempting to assign Geo ID to each ip from the ip2geo table When attempting to to selected using a columns value the Spatial Index doesn't doesn't get used. EXPLAIN SELECT *, ( SELECT locid FROM `ipblocks` i WHERE MBRCONTAINS(i.ippolygon, POINTFROMWKB(POINT(h.`ip`, 0))) ) AS locaid FROM `ips` h LIMIT 1; id select_type table type possible_keys key key_len ref rows Extra 1 PRIMARY

问题 Okay, so I am trying to install libspatialspatialindex to my Ubuntu machine python. I did follow all the instructions and downloaded libspatialindex1_1.4.0-1.1_amd64.deb from http://packages.ubuntu.com/lucid/libspatialindex1 and downloaded the amd64 version of it as my machine is 64bits machine. I installed it and then jumped to Rtree python https://pypi.python.org/pypi/Rtree to download and install the Rtree in python. I followed the installation instruction given in the install.txt file

问题 While working on the simulation of particle interactions, I stumbled across grid indexing in Morton-order (Z-order)(Wikipedia link) which is regarded to provide an efficient nearest neighbor cell search. The main reason that I've read is the almost sequential ordering of spatially close cells in memory. Being in the middle of a first implementation, I can not wrap my head around how to efficiently implement the algorithm for the nearest neighbors, especially in comparison to a basic uniform

问题 I have +10k points (latitude, longitude) and I'm building an app that shows you the k nearest points to a user's location. I think this is a very common problem and I don't want to reinvent the wheel. I'm learning about Quadtrees. It seems to be a good approach to solve this spatial problem. I'm using these tools: Python 2.5 MySQL MongoDb Building the Quadtree is not that hard: http://donar.umiacs.umd.edu/quadtree/points/pointquad.html But once I've created the tree and saved it to a db

问题 I have a Visual Studio project with 2 solutions: Solution 1: UmbracoCms (Umbraco 7.2 code base) Solution 2: SeachIndexer (lucene.net spatial - Windows Console Application) In my solution 2 I have reference to the following .dlls from the Umbraco solution: UmbracoCms.dll cms.dll businesslogic.ddl umbraco.dll umbraco.DataLayer.dll In the Program.cs file I have the following code: Node rootNode = new Node(1103); string nodeTypeAlias = "articlePage"; if (node.NodeTypeAlias == nodeTypeAlias)

问题 I've setup a spatial index on a table that has 1.3 million records in it that are all geocoded. These values are stored in a geography data type column. The problem I'm having is that when I query this column that has a spatial index is is really slow still. It's taking about 20 seconds to find all of the accounts within a mile for instance. Here is an example of a query that runs slow: DECLARE @g Geography; SET @g = (select ci.Geocode from CustomerInformation ci where ci.CIOI = 372658)

问题 Following this recommendation for an optimized nearest neighbor update, I'm using the below tsql to update a GPS table of 11,000 points with the nearest point of interest to each point. WHILE (2 > 1) BEGIN BEGIN TRANSACTION UPDATE TOP ( 100 ) s set [NEAR_SHELTER]= fname, [DIST_SHELTER] = Shape.STDistance(fshape) from( Select [dbo].[GRSM_GPS_COLLAR].*, fnc.NAME as fname, fnc.Shape as fShape from [dbo].[GRSM_GPS_COLLAR] CROSS APPLY (SELECT TOP 1 NAME, shape FROM [dbo].[BACK_COUNTRY_SHELTERS]

问题 Following this recommendation for an optimized nearest neighbor update, I'm using the below tsql to update a GPS table of 11,000 points with the nearest point of interest to each point. WHILE (2 > 1) BEGIN BEGIN TRANSACTION UPDATE TOP ( 100 ) s set [NEAR_SHELTER]= fname, [DIST_SHELTER] = Shape.STDistance(fshape) from( Select [dbo].[GRSM_GPS_COLLAR].*, fnc.NAME as fname, fnc.Shape as fShape from [dbo].[GRSM_GPS_COLLAR] CROSS APPLY (SELECT TOP 1 NAME, shape FROM [dbo].[BACK_COUNTRY_SHELTERS]