Utilizing first-order logic in query processing

  • Authors:
  • Djamshid Asgari;Lawrence Henschen

  • Affiliations:
  • -;-

  • Venue:
  • CSC '84 Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium
  • Year:
  • 1984

Quantified Score

Hi-index 0.00

Visualization

Abstract

The purpose of this research is to improve on the current membership algorithms and their applications in relational database model and information retrieval. A new technique proposed which makes up for deficiencies existing methods. This membership algorithm based on full first-order logic, extending Sagiv's prepositional calculus approach. Our technique does not assign one relation name (association) to all database dependencies like the representation of Nicolas. Finally, it may be used to improve relation schema design. Furthermore, we can utilize our technique derive data retrieval programs for answering queries, an idea that has not previously appeared in the literature.