An Efficient Pictorial Database System for PSQL

  • Authors:
  • N. Roussopoulos;C. Faloutsos;T. Sellis

  • Affiliations:
  • -;-;-

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1988

Quantified Score

Hi-index 0.01

Visualization

Abstract

Pictorial databases require efficient and direct spatial search based on the analog form of spatial objects and relationships instead of search based on some cumbersome alphanumeric encodings of the pictures. A description is given of PSQL, a query language that allows pictorial domains to be presented to the user in their analog form and allows him or her to do direct manipulation on the objects found on those domains. Direct spatial search and computation on the pictures is done using efficient data structures, R- and R/sup trees (multidimensional B-trees), which are excellent devices for searching spatial objects and relationships found on pictures.