Latin squares and low discrepancy allocation of two-dimensional data

Authors:
Richard Anstee;Attila Sali
Affiliations:
Mathematics Department, University of British Columbia, Vancouver, Canada V6T 1Y4;Mathematical Institute of HAS, Budapest P.O.B. 127 H-1364, Hungary
Venue:
European Journal of Combinatorics
Year:
2007

Citing 8
Cited 0

On GDM allocation method for partial range queries

Information Systems
Efficient and effective querying by image content

Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
Disk allocation for Cartesian product files on multiple-disk systems

ACM Transactions on Database Systems (TODS)
Chabot: Retrieval from a Relational Database of Images

Computer
A Digital Library for Geographically Referenced Materials

Computer
Optimal Allocation of Two-Dimensional Data

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Multicolour Discrepancies

Combinatorics, Probability and Computing
Wavelets and filter banks: theory and design

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast browsing and retrieval of geographically referenced information can require the allocation of data on different storage devices for concurrent retrieval. By dividing the two-dimensional space into tiles (essentially an array), a system can allow users to specify regions of interest using a query rectangle and then retrieving information related to tiles included in the rectangle. Suppose that there are m I/O devices. A tile is labeled by i if the data corresponding to this area is stored in the ith I/O device. A labeling is efficient if the discrepancy of the numbers of occurrences of different labels in any given rectangle is small. In the present paper, constructions are given to make this discrepancy O(logm). The constructions use Latin squares. A lower bound of @W(logm) on the discrepancy is given for constructions of this Latin square type.