Beier, FelixSattler, Kai-Uwe2018-04-122018-04-122017https://dl.gi.de/handle/20.500.12116/16398A lot of different indexes have been developed for accelerating search operations on large data sets. Search trees, representing the most prominent class, are ubiquitous in database management systems but are also widely used in non-DBMS applications. An approach for lowering the implementation complexity of these structures are index frameworks like generalized search trees (GiST). Common data management operations are implemented within the framework which can be specialized by data organization and evaluation strategies in order to model the actual index type. These frameworks are particularly useful in scientific and engineering applications where characteristics of the underlying data set are not known a priori and a lot of prototyping is required in order to find suitable index structures for the workload.enInformation systems directory structures computing methodologies graphics processorsText/Journal Article10.1515/itit-2016-00471611-2776