The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
There have little work on processing joins with direction predicates, the research work on processing of spatial joins has primarily focused on topological and distance relations. The processing of direction relation queries is essentially a traversing process. A new fine query filtering method based on R-tree presented in this paper. A fine filtering step added in the middle of the traditional 2-stage...
The interval and the density valve are need to input in traditional clustering methods that based on grid and density method, result in unsmoothed cluster, wrong judgment of clustering boundary. A clustering approach was proposed, which can confirm the interval and the number of clustering, reasonable cluster the object and create the Hilbert R-tree using the result of clustering. Experiment result...
Aimed at the traditional method expends time and overlapping area is big, this paper proposes a new creation method with R-tree. Through ranking the coordinate of spatial object's center point on 2D, a number of objects, which have minimal span, are picked up to establish the R-tree. The static batch load method optimizes spatial index structure, which can improve the spatial utilization and reduce...
Traditional grid-density based spatial clustering algorithms divide input data space into partitions with same width and neglect the natural distributing character of initial data space. A new robust spatial clustering algorithm based on optimized-division (OpD-Clus) is proposed in this paper. Spatial data space is divided by hyper-planes which are encertained with axis-paralleled histogram in OpD-Clus...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.