| 
|
Quote: B+-trees are nearly optimal for disk-based indices; good storage utilization
topics >
all references >
references a-b >
Topic:
b-trees
Topic:
external search and sort
Topic:
full-text indexing
Quotation Skeleton
Organization and maintenance of an index for a … some pseudo random access backup store like a … proportional to log_k l where l is the … of the scheme becomes near optimal. Storage utilization … a special data structure, so-called B-trees. The scheme … performed with indexes up to 100000 keys. An … transactions per second on an IBM 360/44 with … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: b-trees (16 items)
Topic: external search and sort (23 items)
Topic: full-text indexing (35 items)