Optimal Allocation of Two-Dimensional Data

Efficient browsing and retrieval of geographically referenced information requires the allocation of data on different storage devices for concurrent retrieval. By dividing a two dimensional space into tiles, a system can allow users to specify regions of interest using a query rectangle and then retrieving all information related to tiles overlapping with the query. In this paper, we derive the necessary and sufficient conditions for strictly optimal allocations of two-dimensional data. These methods, when they exist, guarantee that for any query, the minimum number of tiles are assigned the same storage device, and hence ensures maximal retrieval concurrency.

[1]  Alfred V. Aho,et al.  Optimal partial-match retrieval when fields are independently specified , 1979, ACM Trans. Database Syst..

[2]  John S. Sobolewski,et al.  Disk allocation for Cartesian product files on multiple-disk systems , 1982, TODS.

[3]  Ronald L. Rivest,et al.  An application of number theory to the organization of raster-graphics memory , 1982, FOCS 1982.

[4]  Hung-Chang Du Disk allocation methods for binary Cartesian product files , 1986, BIT Comput. Sci. Sect..

[5]  Sam Yuan Sung Performance Analysis of Disk Modulo Allocation Method for Cartesian Product Files , 1987, IEEE Transactions on Software Engineering.

[6]  Sakti Pramanik,et al.  Optimal file distribution for partial match retrieval , 1988, SIGMOD '88.

[7]  Christos Faloutsos,et al.  Gray Codes for Partial Match and Range Queries , 1988, IEEE Trans. Software Eng..

[8]  David J. DeWitt,et al.  Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines , 1990, VLDB.

[9]  Christos Faloutsos,et al.  Disk Allocation Methods Using Error Correcting Codes , 1991, IEEE Trans. Computers.

[10]  Martin Vetterli,et al.  Wavelets and filter banks: theory and design , 1992, IEEE Trans. Signal Process..

[11]  Jaideep Srivastava,et al.  CMD: A Multidimensional Declustering Method for Parallel Data Systems , 1992, VLDB.

[12]  David J. DeWitt,et al.  A performance analysis of alternative multi-attribute declustering strategies , 1992, SIGMOD '92.

[13]  CMD : A Multidimensional Declustering Method for Parallel Database Systems 1 , 1992 .

[14]  Chin-Chen Chang,et al.  On GDM allocation for partial range queries , 1992, Inf. Syst..

[15]  Christos Faloutsos,et al.  Declustering using fractals , 1993, [1993] Proceedings of the Second International Conference on Parallel and Distributed Information Systems.

[16]  Khaled A. S. Abdel-Ghaffar,et al.  Optimal disk allocation for partial match queries , 1993, TODS.

[17]  Doron Rotem,et al.  Declustering Objects for Visualization , 1993, VLDB.

[18]  Michael Stonebraker,et al.  Chabot: Retrieval from a Relational Database of Images , 1995, Computer.

[19]  Terence R. Smith A Digital Library for Geographically Referenced Material , 1996, Computer.

[20]  T. Smith A digital library for geographically referenced materials , 1996, Computer.