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.
Because the number of data objects is large in the spatial database, generally speaking, the cost of spatial database query is larger than that of the relational database, the traditional R-tree index structure allows the overlapping and coverage among the sibling nodes, resulting in the duplicate storage of the spatial objects and multiple query paths, the inquiry and search efficiency are low, in...
Efficiency is an important subject in moving object databases research area in recent decade. Particularly for fixed network, where many index structures have been proposed, such as the ones containing 2 D R-tree and 1D R-tree. For range query, these index structures are shown to be relatively efficient than that of 3D R-tree. But for the problem of searching the trajectory of individual moving object,...
The balance of data and the utilization of resources are essential to distributed spatial database system. The paper presents an efficient parallel spatial query algorithm which takes seriously the organization of spatial data into account. The algorithm adopts a balanced spatial data partitioning strategy for distributed spatial databases. According to the characteristics of data partitioning, it...
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a set of keywords. In return, the user obtains a list of businesses whose description contains these keywords, ordered by their distance from the specified address. The problems of nearest neighbor search on spatial data and...
Given two sets DA and DB of multidimensional objects, a spatial region R, and a critical distance dc, an optimal-nearest- neighbor (ONN) query retrieves outside R, the object in DB with maximum optimality. Let CAR (Sp,p) be the cardinality of the subset Sp of objects in DA which locate within R and are enclosed by the vicinity circle centered at p with radius dc. Then, an object o is said to be better...
In this paper, an efficient parallel algorithm to search large time series databases is proposed. There are existing parallel algorithms for performing such tasks, which generally utilize multidimensional tree structures and thus are subjected to the performance of multidimensional trees. On the other hand, there have been a number of serial algorithms proposed in the past decade. Most of them use...
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.