Index Tree
Fuente:
Zenodo
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Recurso digital |
| Sprache: | Englisch |
| Veröffentlicht: |
Zenodo
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866901891989897216 |
|---|---|
| author | Ul Hassan, Sabih |
| author_facet | Ul Hassan, Sabih |
| contents | <p>Sorting is the process of arranging a set of numbers into ascending or descending order. Searching is the process of finding the location, or presence, of a given number. These are some of the most common processes executed in most problems. The data structures and algorithms that are used to perform these operations give a time complexity of O(N log N) for sorting integers and O(log N) for searching integers, in the worst case. Index Tree provides a time complexity of O(1) for searching integers and O(N) for sorting integers, in the worst case. If used for indexing, one object of the Index Tree can act as an index for multiple tables if their primary key is of integer type, resulting in less storage space for multiple indexes. Since one object represents multiple indexes, it can be directly loaded into memory, taking less memory compared to multiple objects for multiple indexes, resulting in less time to find a record’s reference in memory rather than in storage.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_14606813 |
| institution | Zenodo |
| language | eng |
| publishDate | 2025 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | Index Tree Ul Hassan, Sabih Searching, Order 1 search, Sorting, Linear sorting, Indexing <p>Sorting is the process of arranging a set of numbers into ascending or descending order. Searching is the process of finding the location, or presence, of a given number. These are some of the most common processes executed in most problems. The data structures and algorithms that are used to perform these operations give a time complexity of O(N log N) for sorting integers and O(log N) for searching integers, in the worst case. Index Tree provides a time complexity of O(1) for searching integers and O(N) for sorting integers, in the worst case. If used for indexing, one object of the Index Tree can act as an index for multiple tables if their primary key is of integer type, resulting in less storage space for multiple indexes. Since one object represents multiple indexes, it can be directly loaded into memory, taking less memory compared to multiple objects for multiple indexes, resulting in less time to find a record’s reference in memory rather than in storage.</p> |
| title | Index Tree |
| topic | Searching, Order 1 search, Sorting, Linear sorting, Indexing |
| url | https://doi.org/10.5281/zenodo.14606813 |