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

Abstracf-The PROBE research project has produced results in the areas of data modeling, spatial/temporal query processing, recursive query processing, and database system architecture for “nontraditional” application areas, many of which involve spatial data and data with complex structure. PROBE provides the point se? as a construct for modeling spatial data. This abstraction is compatible with notions of spatial data found in a wide variety of applications. PROBE is extensible and supports a generalization hierarchy, so it is possible to incorporate application-specific implementations of the point set abstraction. PROBE’s query processor supports point sets with the geometry filter, an optiniizer of spatial queries. Spatial queries are processed by decomposing them into 1) a set-at-a-time portion that is evaluated efficiently by the geometry filter and 2) a portion that involves detailed nianipulations of individual spatial objects by functions supplied with the application-specific representation. The output from the first step is an approximate answer, which is refined in the second step. The data model and the geometry filter are valid in all dimensions, and they are compatible with a wide variety of representations. PROBE’S spatial data model and geometry filter are described, and it is shown how these facilities can be used to support image database applications.

[1]  Umeshwar Dayal,et al.  PDM: An Object-Oriented Data Model , 1986, OODBS.

[2]  Alejandro P. Buchmann,et al.  Molecular Objects, Abstract Data Types, and Data Models: A Framework , 1984, VLDB.

[3]  Jack A. Orenstein Algorithms and data structures for the implementation of a relational database system , 1983 .

[4]  Alfonso F. Cardenas,et al.  Database Structure and Manipulation Capabilities of a Picture Database Management System (PICDMS) , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Frank Manola,et al.  Toward a General Spatial Data Model for an Object-Oriented DBMS , 1986, VLDB.

[6]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[7]  Jack A. Orenstein Spatial query processing in an object-oriented database system , 1986, SIGMOD '86.

[8]  Prof. Randy H. Katz,et al.  Information Management for Engineering Design , 1985, Surveys in Computer Science.

[9]  Walter A. Burkhard,et al.  Interpolation-based index maintenance , 1983, BIT.

[10]  George Nagy,et al.  Geographic Data Processing , 1979, CSUR.

[11]  Aris M. Ouksel,et al.  Storage mappings for multidimensional linear dynamic hashing , 1983, PODS.

[12]  J. L. Smith,et al.  A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..

[13]  Won Kim,et al.  Modeling concepts for VLSI CAD objects , 1985, TODS.

[14]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[15]  Irene Gargantini,et al.  An effective way to represent quadtrees , 1982, CACM.

[16]  Christos Faloutsos,et al.  Multiattribute hashing using Gray codes , 1986, SIGMOD '86.

[17]  T. H. Merrett,et al.  A class of data structures for associative searching , 1984, PODS.