The SP-tree: A Clustered Index Structure for Efficient Sequential Access

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

  • PDF / 161,316,611 Bytes
  • 1,143 Pages / 453.543 x 683.15 pts Page_size
  • 15 Downloads / 175 Views

DOWNLOAD

REPORT

Recommend Documents
Index Sequential Access Method (ISAM)

178 95 2MB

Indexed Sequential Access Method

172 16 5MB

Efficient Computation of Clustered-Clumps in Degenerate Strings

161 94 65MB

Conditional Sequential Modulation for Efficient Global Image Retouching

139 57 193MB

Spatial Index Structure

190 44 239KB

A Scalable Clustered Camera System for Multiple Object Tracking

154 61 6MB

Intellectual structure evolution of open access research observed through correlation index of keyword centrality

111 31 1015KB

Optimizing Transmission and Shutdown for Energy-Efficient Real-time Packet Scheduling in Clustered Ad Hoc Networks

168 80 2MB

Scheduling Heterogeneous Wireless Systems for Efficient Spectrum Access

163 76 1MB

Automatic Table-of-Contents Generation for Efficient Information Access

164 101 3MB

A novel equitation to predict the pressure derived collateral flow index in multiple sequential coronary stenoses

161 35 1MB

An Efficient Secondary Index for Spatial Data Based on LevelDB

187 88 54MB