In this paper, we propose a new index called the H-tree that supports efficient retrieval of instances of a single class as well as retrieval of instances of a ...

Nov 9, 2005 · In this paper, we propose a new index called the H-tree that supports efficient retrieval of instances of a single class as well as retrieval of ...

Jan 1, 1992 · In this paper, we propose a new index called the H-tree that supports efficient retrieval of instances of a single class as well as retrieval of ...

Publication type: Conference Proceeding · Language: English · Authors: Low, Chee Chin; Ooi, Beng Chin; Lu, Hongjun.

Chee Chin Low, Beng Chin Ooi, Hongjun Lu: H-trees: A Dynamic Associative Search Index for OODB. SIGMOD Conference 1992: 134-143. manage site settings.

The support of the superclass-subclass concept in object-oriented databases. (OODB) makes an instance of a subclass also an instance of its superclass. As a.

Like H-trees, SL-trees have a B+-like tree for each class of a class ... H-trees: A Dynamic Associative Search Index for OODB. ACM SIGMOD (June 1992) ...

H-trees: A Dynamic Associative Search Index For. OODB. In Pro&dings of the IiXM ACM-. SIGMOD Conference on the Management of Data, pagee 134-143, June 1992.

Apr 25, 2024 · Chee Chin Low, Beng Chin Ooi, Hongjun Lu: H-trees: A Dynamic Associative Search Index for OODB. SIGMOD Conference 1992: 134-143; 1991.

Feb 5, 2020 · H-Tree (Hierarchy Tree), which was proposed by Low et al [LOL92], is a dynamic associative search index for. OODB. It is a hierarchical indexing ...