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.
The object-level indexing of mobile data that supports spatio-temporal querying is presented. The indexing scheme focuses on handling linear trajectories of moving objects. In this paper, a compressed B+-tree based framework is proposed to only support the visual content of multimedia data indexing and querying of spatio-temporal relationships of mobile objects in a multimedia database system. A prototype...
The KDB-tree is a traditional point access method for retrieving multidimensional data. Many literatures frequently address the low storage utilization and insufficient retrieval performance as two bottlenecks for KDB-tree family of structures. A large amount of unnecessary splits caused by data insertion orders and data skewness is the fatal reason for these two bottlenecks. Compressing KDB-trees...
The B+-tree and its variants have been reported as the good index structures for retrieving data. However, their index schemes are short of optimizing data arrangement in the external structures. Improper handles adopted in the traditional splitting policies including pre-partition of data underlying space, node splitting by force, node splitting with unbalanced partition, and node splitting upon...
In this paper, we propose a new indexing method called compressed B+-tree. The traditional B+-tree is the most common dynamic index structures in database systems. However, in practical applications, its performance still remains considerable room for improvement. Compressed B+-tree outperforms traditional access methods in two respects. The first is more economic storage requirement in the indexing...
Many literatures have improved the techniques of traditional KDB-tree and its variants for acquiring some performance enhancement. However, they all suffer from the low storage utilization problem caused by their imperfect "splitting policies." Frequent splits do not only increase the size of index structure but also deteriorate the performance of the system. A new insertion algorithm with...
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.