As in conventional database management systems (DBMSs), to allow users to efficiently access and retrieve data objects, a multimedia database management system (MMDBMS) must employ an effective access method such as indexing and hashing. This paper provides a survey of tree-based multidimensional ...
the Lazy-Split B+-tree (LSB+-tree). In detail, by their introduction, the first concept of LSB+-tree can efficiently reduce the number of node splits, the second can reduce the number of node modifications, and the last can make a further improvement on buffer space utilization and flash...
In this example, it is assumed that the value of marks is to be communicated by the sender to the receiver. Using conventional methods, this is achieved by referring to the element name “marks”. If, however, the metadata referring to the data value are in different languages on the send...
A tree-based trylock technique for reducing contention on a root trylock includes attempting to acquire a trylock at each node of a tree-based hierarchical node structure while foll
Summary: In this paper we consider the scalability issues of a classical data structure used for multidimensional indexing: the R-Tree. This data structure allows for an efficient retrieval of records in low-dimensional spaces and is de facto standard of the industry. Following the design ...
This makes the proposed technique a good candidate for integration in a fuzzy DBMS when it is developed as an extension of a crisp DBMS. The efficiency of the proposal is contrasted with another indexing method for similar data and queries, G-tree, which is specifically designed to index ...
In-memory indexR-TreeGiSTExperimental evaluationIn this paper we consider the scalability issues of a classical data structure used for multidimensional indexing: the R-Tree. This data structure allows for an efficient retrieval of records in low-dimensional spaces and is de facto standard of the ...
• The scalability of our FORDBMS and CBIR system shown is guaranteed by the scalability of the host ORDBMS system, OracleⓇ 10.2. Future...C. D. Barranco, J. R. Campan˜a, and J. M. Medina. A B+-tree based indexing technique for fuzzy numerical data. Fuzzy Sets and Systems,...
We propose a new indexing structure, the 2-D-S-tree, to organize 2-D strings for query efficiency. The 2-D-S-tree is completely dynamic; inserts and deletes can be intermixed with searches and no periodic reorganization is required. A performance analysis is conducted, and both analytical ...
In addition, the querying process in image/video DBMSs is expected to be iterative with progressively more refined queries being issued during the later stages. Thus the indexing structure should be able to efficiently support both vague queries ( retrieving a large number of approximate matches) ...