Median split trees: a fast lookup technique for frequently occurring keys /
39
Main Author: | |
---|---|
Format: | |
Subjects: |
_version_ | 1796682632952545280 |
---|---|
author | 457245 Sheil, B. A. |
author_facet | 457245 Sheil, B. A. |
author_sort | 457245 Sheil, B. A. |
collection | OCEAN |
description | 39 |
first_indexed | 2024-03-04T21:45:35Z |
format | |
id | KOHA-OAI-TEST:185430 |
institution | Universiti Teknologi Malaysia - OCEAN |
last_indexed | 2024-03-04T21:45:35Z |
record_format | dspace |
spelling | KOHA-OAI-TEST:1854302020-12-19T17:05:10ZMedian split trees: a fast lookup technique for frequently occurring keys / 457245 Sheil, B. A. 39PSZJBLInformation retrieval |
spellingShingle | Information retrieval 457245 Sheil, B. A. Median split trees: a fast lookup technique for frequently occurring keys / |
title | Median split trees: a fast lookup technique for frequently occurring keys / |
title_full | Median split trees: a fast lookup technique for frequently occurring keys / |
title_fullStr | Median split trees: a fast lookup technique for frequently occurring keys / |
title_full_unstemmed | Median split trees: a fast lookup technique for frequently occurring keys / |
title_short | Median split trees: a fast lookup technique for frequently occurring keys / |
title_sort | median split trees a fast lookup technique for frequently occurring keys |
topic | Information retrieval |
work_keys_str_mv | AT 457245sheilba mediansplittreesafastlookuptechniqueforfrequentlyoccurringkeys |