Declustering Objects for Visualization

In this paper we propose a new declustering method which is particularly suitable for image and cartographic databases used for visualization. Our declustering method is based on algebraic techniques using vectors. The algorithm which computes the disk assignment requires O(Kj log K) time where K is the number of parallel disks in the system. The resulting disk assignment maximizes the area that can be visualized without accessing any disk more than once. The method is easy to implement and works for any number of parallel disks. Our mathematical analysis show that for common visualization queries our declustering method performs within seven percent from optimal for a wide range of practical multiple disk configurations.

[1]  Ronald L. Rivest,et al.  An application of number theory to the organization of raster-graphics memory , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

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

[3]  H. Meschkowski Unsolved and unsolvable problems in geometry , 1966 .

[4]  Edinburgh , 1875 .

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

[6]  Clement T. Yu,et al.  Efficient placement of audio data on optical disks for real-time applications , 1989, CACM.

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

[8]  B. Ripley,et al.  Introduction to the Theory of Coverage Processes. , 1989 .

[9]  Ramesh C. Jain NSF workshop on Visual Information Management Systems , 1993, SGMD.

[10]  Shahram Ghandeharizadeh,et al.  Object Placement in Parallel Hypermedia Systems , 1991, VLDB.

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

[12]  J. Seaman Introduction to the theory of coverage processes , 1990 .

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

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