Advertisement

Spatial data management in database systems: Research directions

  • Won Kim
  • Jorge Garza
  • Ali Keskin
Keynote Paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 692)

Abstract

Spatial data management has been an active area of research during the past two decades, and results of research into spatial data structures and research into mapping spatial data into records in relational databases have found their way into commercial implementations of geographical information systems. However, no commercial database system today directly supports spatial data management, in particular, data definition and query facilities for spatial data. The objective of this paper is to identify a number of key issues that need to be addressed in the near term before we can expect to see a rich support of spatial data management in commercial database systems.

Keywords

Spatial Data Database System Spatial Operator Index Manager Query Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABEL89]
    Abel, D. “SIRO-DBMS: A Database Tool-Kit for Geographical Information Systems,” Intl. Journal of Geographical Information Systems, vol. 3, no. 2, April–June, 1989, pp. 103–116.Google Scholar
  2. [AREF91]
    Aref, W., and H. Samet. “Extending a DBMS with Spatial Operations,” technical report, Computer Science Department, University of Maryland, College Park, Maryland, Feb. 1991.Google Scholar
  3. [ATKI83]
    Atkinson, M., et al. “An Approach to Persistent Programming,” Computer Journal, vol. 26, no. 4, November 1983, pp. 360–365.Google Scholar
  4. [BATO88]
    Batory, D., et al. “GENESIS: An Extensible Database Management System,” IEEE Trans. on Software Engineering, vol. 14, no. 11, Nov. 1988.Google Scholar
  5. [BECK90]
    Beckman, N., H-P Kriegel, R. Schneider, and B. Seeger. “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Atlantic City, New Jersey, May 1990, pp. 322–331.Google Scholar
  6. [BENT75]
    Bentley, J. “Multidimensional Binary Search Trees Used for Associative Searching,” Comm. of ACM, vol. 18, no. 9, 1975.Google Scholar
  7. [FALO87]
    Faloutsos, C., T. Sellis, and N. Roussopoulos. “Analysis of Object-Oriented Spatial Access Methods,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, San Francisco, Calif., May 1987, pp. 426–439.Google Scholar
  8. [FINK74]
    Finkel, R., and J. Bentley. “Quadtrees: A Data Structure for Retrieval on Composite Keys,” Acta Informatica, vol. 4, no. 1, 1974.Google Scholar
  9. [FREE87]
    Freeston, M. “The BANG File: A New Kind of Grid File,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, San Francisco, Calif., May 1987, pp. 260–269.Google Scholar
  10. [FREY87]
    Freytag, J. “A Rule-Based View of Query Optimization,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, pp. 173–180, San Francisco, Calif., 1987.Google Scholar
  11. [GEN90]
    G5.New, vol. 2, no. 1, The Generation 5 Technology, 1990.Google Scholar
  12. [GRAE87]
    Graefe, G., and D. DeWitt. “The EXODUS Optimizer Generator,” in Proc. ACM SIGMOD Intl. Conf. on Managment of Data, pp. 160–172, San Francisco, Calif., 1987.Google Scholar
  13. [GREE89]
    Greene, D. “An Implementation and Performance Analysis of Spatial Data Access Methods,” in Proc. IEEE Intl. Conf. on Data Engineering, Feb. 1989, Los Angeles, Calif., pp. 606–615.Google Scholar
  14. [GUTT84]
    Guttman, A. “R-Trees: A Dynamic Index Structure for Spatial Searching,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Boston, Mass., June 1984, pp. 47–57.Google Scholar
  15. [HOEL92]
    Hoel, E., and H. Samet. “A Qualitative Comparison of Data Structures for Large Line Segment Databases” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, San Diego, Calif. June 1992.Google Scholar
  16. [JAGA90a]
    Jagadish, H. “Linear Clustering of Objects with Multiple Attributes,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Atlantic City, New Jersey, May 1990, pp. 332–342.Google Scholar
  17. [JAGA90b]
    Jagadish, H. “On Indexing Line Segments,” in Proc. Intl Conf. on Very Large Data Bases, Brisbane, Australia, August 1990, pp. 614–625.Google Scholar
  18. [KAEH81]
    Kaehler, T. “Virtual Memory for an Object-Oriented Language,” BYTE, pp. 378–387, August 1981.Google Scholar
  19. [KAME92]
    Kamel, I., and C. Faloutsos. “Parallel R-Trees,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, San Diego, California, June 1992.Google Scholar
  20. [KIM88]
    Kim, W. et al. “Integrating an Object-Oriented Programming System with a Database System,” in Proc. 3rd. Intl. Conf. on Object-Oriented Programming Systems, Languages, and Applications, San Diego, Calif. Sept. 1988.Google Scholar
  21. [KIM90]
    Kim, W. Introduction to Object-Oriented Databases, MIT Press, November 1990.Google Scholar
  22. [MAIE89]
    Maier, D. “Making Database Systems Fast Enough for CAD Applications,” Object-Oriented Concepts, Applications, and Databases, (ed. W. Kim, and F. Lochovsky), Addison-Wesley, 1989.Google Scholar
  23. [NIEV84]
    Nievergelt, J., H. Hinterberger, and K. Sevcik. “The Grid File: An Adaptable, Symmetric Multikey File Structure,” ACM Trans. on Database Systems, vol. 9, no. 1, March 1984.Google Scholar
  24. [OOI90]
    Ooi, B-C. Efficient Query Processing in Geographic Information Systems, Lecture Notes in Computer Science, Springer-Verlag, 1990.Google Scholar
  25. [OREN86]
    Orenstein, J. “Spatial Query Processing in an Object-Oriented Database System,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Washington, D.C., May 1986, pp. 326–336.Google Scholar
  26. [ROBI81]
    Robinson, J. “The K-D-B Tree: A Search Structure for Large Multidimensional Dynamic Indexes,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Ann Arbor, Michigan, April 1981.Google Scholar
  27. [ROUS85]
    Roussopoulos, N., and D. Leifker. “Direct Spatial Search on Pictoral Databases Using Packed R-Trees,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Austin, Texas, May 1985.Google Scholar
  28. [ROUS88]
    Roussopoulos, N., C. Faloutsos, T. Sellis. “An Efficient Pictorial Database System for PSQL,” IEEE Trans. on Software Engineering, vol. 14, no. 5, pp. 639–650, 1988.Google Scholar
  29. [SAME84]
    Samet, H. The Quadtree and Related Hierarchical Data Structures, ACM Computing Surveys, vol. 16, no. 2, June 1984.Google Scholar
  30. [SEEG90]
    Seeger, B., H-P Kriegel. “The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems,” in Proc. Intl Conf. on Very Large Data Bases, Brisbane, Australia, August 1990, pp. 590–601.Google Scholar
  31. [SELI79]
    Selinger, P., et. al. “Access Path Selection in a Relational Database Management System,” in Proc. ACM SIGMOD Intl. Conf. on Management of Data, Boston, Mass., May 1979, pp. 23–34.Google Scholar
  32. [SELL87]
    Sellis, T., N. Roussopoulos, and C. Faloutsos. “The R+-Tree: A Dynamic Index for Multi-Dimensional Objects,” in Proc. Intl Conf. on Very Large Data Bases, Brighton, England, 1987, pp. 507–518.Google Scholar
  33. [STON83]
    Stonebraker, M., B. Rubenstein, and A. Guttman. “Application of Abstract Data Types and Abstract Indices to CAD Data Bases,”Google Scholar
  34. [WAUG87]
    Waugh, T., and R. Healey. “The GEOVIEW Design: A Relational Data Base Approach to Geographical Data Handling,” Intl. Journal of Geographical Information Systems, vol. 1, no. 2, April–June, 1987, pp. 101–118.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Won Kim
    • 1
  • Jorge Garza
    • 1
  • Ali Keskin
    • 1
  1. 1.UniSQL, Inc.Austin

Personalised recommendations