PROBE Spatial Data Modeling and Query Processing in an Image Database Application

IEEE Transactions on Software Engineering

Volumn 14, Issue 5, 1988, Pages 611-629

  Orenstein, Jack A ^a   Manola, Frank A ^a  

^a Matsushita Electric Corporation of America   (United States)

Author keywords

Object oriented database system; spatial data; spatial query

Indexed keywords

EID: 0000910882     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.6139     Document Type: Article

References (38)

1. D. J. Abel and J. L. Smith, “A data structure and algorithm based on a linear key for a rectangle retrieval problem”, Comput. Vision, Graphics, Image Processing, vol. 27, no. 1, pp. 19–31, 1983.
2. D. S. Batory and A. P. Buchmann, “Molecular objects, abstract data types and data models: A framework”, in Proc. 10th Int. Conf. Very Large Databases, 1984.
3. D. S. Batory and W. Kim, “Modeling concepts for VLSI CAD objects”, ACM Trans. Database Syst., vol. 10, no. 3, 1985.
4. J. L. Bentley, “Multi-Dimensional binary search trees used for associative searching”, Commun. ACM, vol. 18, no. 9, pp. 509–517, 1975.
5. W. A. Burkhard, “Interpolation-based index maintenance”, in Proc. 2nd ACM SIGACT-SIGMOD Symp. Principles Database Syst., pp. 76-89, 1983.
6. M. J. Carey et al., “The architecture of the EXODUS extensible DBMS”, in Proc. Int. Workshop Object-Oriented Database Syst., pp. 52-65, 1986.
7. S.-K. Chang et al., “A relational database system for pictures”, in Proc. IEEE Workshop Picture Data Description Management, 1977.
8. S.-K. Chang, Ed., IEEE Comput., Special Issue on Pictorial Information Systems, vol. 14, no. 11, 1981.
9. M. Chock et al., “Database structure and manipulation capabilities of a picture database management system ‘PICDBMS,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-6, no. 4, 1984.
10. U. Dayal et al., “PROBE-A research project in knowledge-oriented database systems: Preliminary analysis”, Computer Corporation of America, Tech. Rep. CCA-85-03, 1985.
11. C. Faloutsos, “Multiattribute hashing using gray codes”, in Proc. ACM S1GMOD, 1986.
12. I. Gargantini, “An effective way to represent quadtrees”, Commun. ACM, vol. 25, no. 12, pp. 905–910, 1982.
13. D. Goldhirsch and J. A. Orenstein, “Extensibility in PROBE”, Database Eng., June 1987.
14. A. Guttman, “R-trees: A dynamic index structure for spatial searching”, in Proc. ACM SIGMOD, 1984.
15. Proceedings of the IEEE Workshop on Picture Data Description and Management, 1977.
16. R. H. Katz, Information Management for Engineering Design. New York: Springer-Verlag, 1985.
17. R. Laurini, “Graphics databases built on Peano space-filling curves”, in Proc. EUROGRAPHICS Conf, pp. 327-338, 1985.
18. R. A. Lorie and A. Meier, “Using a relational DBMS for geographical databases”, IBM Res. Rep. RJ 3848 ‘43915’ 4/6/83, 1983.
19. F. Manola and J. Orenstein, “Toward a general spatial data model for an object-oriented DBMS”, in Proc. 12th Int. Conf. Very Large Databases, 1986.
20. F. Manola and U. Dayal, “PDM: An object-oriented data model”, in Proc. Int. Workshop Object-Oriented Database Syst., 1986.
21. F. Manola, “PDM: An object-oriented data model for PROBE”, Computer Corporation of America, Tech. Rep., to appear.
22. S. Morehouse, “ARC/INFO: A geo-relational model for spatial information”, in Proc. Seventh Int. Symp. Comput. Assisted Cartography, American Congress on Surveying and Mapping, 1985.
23. G. Nagy and S. Wagle, “Geographic data processing”, ACM Comput. Surv., vol. 11, no. 2, pp. 139–181, 1979.
24. J. A. Orenstein, “Algorithms and data structures for the implementation of a relational database system”, School Comput. Sci., McGill Univ., Montreal, P.Q., Canada, Tech. Rep. SOCS-82-17, 1983.
25. J. A. Orenstein and T. H. Merrett, “A class of data structures for associative searching”, in Proc. 3rd ACM SIGACT-SIGMOD Symp. Principles Database Syst., pp. 181-190, 1984.
26. J. A. Orenstein, “Spatial query processing in an object-oriented database system”, in Proc. ACM SIGMOD, 1986.
27. J. A. Orenstein and F. A. Manola, “Spatial data modeling and query processing in PROBE”, Computer Corporation of America, Tech. Rep. CCA-86-05, 1986.
28. M. Ouksel and P. Scheuermann, “Storage mappings for Multi-Dimensional linear dynamic hashing”, in Proc. 2nd ACM SIGACT-SIGMOD Symp. Principles Database Syst., pp. 90-105, 1983.
29. G. Peano. “La curva di Peano nel 'formulario mathematico.'” in Selected Works of G. Peano. H. C. Kennedy. Ed. ‘transi.’. Allen and Unwin.
30. A. Rosenthal. S. Heiler. U. Dayal. and F. Manola, “Traversal recursion: A practical approach to supporting recursive applications”, in Proc: ACM S1GMOD, 1986.
31. A. Rosenthal. S. Heiler. U. Dayal. and F. Manola, “Traversal recursion: A practical approach to supporting recursive applications”. Computer Corporation of America, Tech. Rep. CCA-86-06. 1986.
32. N. Roussopoulos and D. Leifker, “Direct spatial search on pictorial databases using packed R-trees”, in Proe. ACM S1GMOD, 1985.
33. H.-J. Schek and P. Pistor. “Data structures for an integrated data base management and information retrieval system”, in Proc. VLDB 8. pp. 197-207. 1982.
34. P. Sehwarz, et al. “Extensibility in the Starburst database system”, in Proc. Int. Workshop Object-Oriented Database Syst. pp. 85-93, 1986.
35. J. D. Smith. “The application of data base management systems to spatial data handling”, Dep. Landscape Architecture Regional Planning. Univ. Massachusetts. Amherst, MA, Project Rep., 1984.
36. M. Stonebraker et al. “Document processing in a relational data base system”. ACM TOOLS. vol. 1. no. 2. pp. 143–158, 1983.
37. M. Stonebraker. “Object management in POSTGRES using procedures”. in Proc. Int. Workshop Object-Oriented Database Syst. 1986. pp. 66-72.
38. M. Stonebraker and L. A. Rowe. “The design of POSTGRES”. in Proc. ACMSIGMOD. 1986. pp. 340-355.