Skip to main content
SpringerLink
Log in
Book cover

International Conference on Database Theory

ICDT 1997: Database Theory — ICDT '97 pp 409–418Cite as

Optimal allocation of two-dimensional data (Extended abstract)

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1186))

Abstract

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.

This author was supported in part by the National Science Foundation under grant NCR-9115423.

This author was supported in part by the National Science Foundation under grant IRI-9411330.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. A. S. Abdel-Ghaffar and A. El Abbadi. Optimal disk allocation for partial match inquiries. ACM Transactions on Database Systems, 18(1):132–156, March 1993.

    Google Scholar 

  2. A. V. Aho and J. D. Ullman. Optimal partial-match retrieval when fields are independently specified. ACM Trans. Database Syst., 4(2):168–179, 1979.

    Google Scholar 

  3. C. Y. Chen and C. C. Chang. On GDM allocation method for partial range queries. Information Systems, 17(5):381–394, 1992.

    Google Scholar 

  4. B. Chor, C. E. Leiserson, R. L. Rivest, and J. B. Shearer. An application of number theory to the organization of raster-graphics memory. Journal of ACM, 33(1):86–104, 1986.

    Google Scholar 

  5. L. T. Chen and D. Rotem. Declustering objects for visualization. In Proceedings of the 19th VLDB conference, pages 85–96, August 1993.

    Google Scholar 

  6. H. C. Du and J. S. Sobolewski. Disk allocation for cartesian product files on multiple-disk systems. ACM Trans. Database Syst., 7(1):82–101, 1982.

    Google Scholar 

  7. H. C. Du. Disk allocation method for binary cartesian product files BIT 26(2):138–147, 1986.

    MathSciNet  Google Scholar 

  8. C. Faloutsos. Gray codes for partial match and range queries. IEEE Transactions on Software Engineering, 14(10):1381–1393, October 1988.

    Article  Google Scholar 

  9. C. Faloutsos and P. Bhagwat. Declustering using fractals. In Proceedings of the Second International Conference on Parallel and Distributed Information Systems, pages 18–25, January 1993.

    Google Scholar 

  10. [FBF+94] C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz. Efficient and effective querying by image content. Journal of Intelligent Information Systems, 3:231–262, 1994.

    Google Scholar 

  11. C. Faloutsos and D. Metaxas. Disk allocation methods using error correcting codes. IEEE Transactions on Computers, 40(8):907–914, August 1991.

    Google Scholar 

  12. S. Ghandeharizadeh and D. J. DeWitt. Hybrid-range partitioning strategy: A new declustering strategy for multiprocessor database machines. In Proceedings of 16th International Conference on Very Large Data Bases, pages 481–492, August 1990.

    Google Scholar 

  13. S. Ghandeharizadeh, D. J. DeWitt, and W. Qureshi. A performance analysis of alternative multi-attribute declustering strategies. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 29–38, June 1992.

    Google Scholar 

  14. M. H. Kim and S. Pramanik. Optimal file distribution for partial match retrieval. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 173–182, June 1988.

    Google Scholar 

  15. J. Li, J. Srivastava, and D. Rotem. CMD: A multidimensional declustering method for parallel database systems. In Proceedings of the 18th VLDB Conference, pages 3–14, August 1992.

    Google Scholar 

  16. V. E. Ogle and M. Stonebraker. Chabot: Retrieval from a relational database of images. Computer, 28(9):40–48, September 1995.

    Google Scholar 

  17. T. R. Smith. A digital library for geographically referenced materials. Computer, 29(5):54–60, May 1996.

    Google Scholar 

  18. Y. Y. Sung. Performance analysis of disk modulo allocation method for cartesian product files. IEEE Transactions on Software Engineering, 13(9):1018–1026, September 1987.

    Google Scholar 

  19. M. Vitterli and C. Herley. Wavelets and filter banks: Theory and design. IEEE Transactions on Signal Processing, 40(9):2207–2232, September 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, 95616, Davis, CA, USA

    Khaled A. S. Abdel-Ghaffar

  2. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Amr El Abbadi

Authors
  1. Khaled A. S. Abdel-Ghaffar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amr El Abbadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Foto Afrati Phokion Kolaitis

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdel-Ghaffar, K.A.S., Abbadi, A.E. (1996). Optimal allocation of two-dimensional data (Extended abstract). In: Afrati, F., Kolaitis, P. (eds) Database Theory — ICDT '97. ICDT 1997. Lecture Notes in Computer Science, vol 1186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62222-5_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-62222-5_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62222-2

  • Online ISBN: 978-3-540-49682-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation