An Algorithm for Handling Many Relational Calculus Queries Efficiently

@article{Willard2002AnAF,
  title={An Algorithm for Handling Many Relational Calculus Queries Efficiently},
  author={Dan E. Willard},
  journal={J. Comput. Syst. Sci.},
  year={2002},
  volume={65},
  pages={295-331}
}
This article classifies a group of complicated relational calculus queries whose search algorithms run in time O(I LogI + U) and space O(I) , where I and U are the sizes of the input and output, and d is a constant depending on the query (which is usually, but not always, equal to zero or one). Our algorithm will not entail any preprocessing of the data.