Anzeige
Erschienen in:
2017 | OriginalPaper | Buchkapitel
The SP-tree: A Clustered Index Structure for Efficient Sequential Access
verfasst von : Guang-Ho Cha
Erschienen in: Advances in Computer Science and Ubiquitous Computing
Verlag: Springer Singapore
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
We introduce the SP-tree that is a variant of a multidimensional index structure, with the object of offering efficient sequential disk access. The SP-tree is based on the index clustering technique called the segment-page clustering (SP-clustering). Most relevant index pages are widely scattered on a disk due to dynamic page allocation, and thus many random disk accesses are required during the query processing. The SP-clustering avoids the scattering by storing the relevant nodes contiguously in a segment that contains a sequence of contiguous disk pages and improves the query performance by offering sequential disk access within a segment. Experimental results demonstrate that the SP-clustering improves the query performance up to several times compared with the traditional ones with respect to the total elapsed time.