Initially, retrieval in a binary trie structure is developed. With the aid of a fairly complex
recurrence relation, the rather scraggly binary trie is transformed into a compact multi-way …

A compact 0-complete tree is an indexing mechanism that can be effectively used for large
databases with long and variable-size keys. Compared to B-trees, compact 0-complete trees …

A compact 0-complete tree is an indexing mechanism that can be effectively used for large
databases with long and variable-size keys. Compared to B-trees, compact 0-complete trees …

The O-tree is an indexing mechanism closely related to B-trees and Prefix B-trees. In this
paper we derive the expected storage overhead of O-Trees under the standard Bernoulli …

A compact 0-complete tree is an indexing mechanism that can be effectively used for large
databases with long and variable-size keys. Compared to B-trees, compact 0-complete trees …

In this report, a novel approach to ordered retrieval in very large files is developed. The
method employs a B-tree like search algorithm that is independent of key type or key length …

요약언어 정보 처리 응용 분야는 정보검색, 형태소분석, 철자검색, 음성인식, 문자 인식 등
다양하다. 이러한정보처리 과정은 전자 사전이 필수적이다. 본 논문에서는 국어대사전에 대한 …

When used as representations of images underlying the spatial access methods, region
quadtrees can enable precise descriptions of spatial objects, while making their locations in …

A new retrieval method, called compact 0-complete trees or Co-trees, was first presented on
VLDB'88 conference [OrP88]. In that paper we have described the basic algorithms (eg …

A compact 0-complete tree is an indexing mechanism that can be effectively used for large
databases with long and variable-size keys. Compared to B-trees, compact 0-complete trees …