Sciweavers

ADC
2000
Springer

Efficient Range Query Retrieval for Non-Uniform Data Distributions

14 years 3 months ago
Efficient Range Query Retrieval for Non-Uniform Data Distributions
Answering range queries is a common database operation. Methods based on hashing techniques to minimise the cost of answering range queries by taking the query distribution into account have previously been proposed. These methods have all assumed a uniform distribution of data to disk pages to achieve good performance. This assumption makes them less useful in practice because most real data distributions are non-uniform. In this paper, we discuss a method to eliminate this restriction. Extensive experimentation using a multi-dimensional file structure, the BANG file, indicates that our method results in good performance for all data distributions. In one case an improvement of over 36 times was achieved without compromising the storage utilisation. Our method also results in a stable and efficient file organisation. If the query distribution does not change substantially, an optimised file organisation rarely requires reorganisation.
Salahadin Mohammed, Evan P. Harris, Kotagiri Ramam
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where ADC
Authors Salahadin Mohammed, Evan P. Harris, Kotagiri Ramamohanarao
Comments (0)