An Algorithm for Handling Many Relational Calculus Queries Efficiently

摘要

This article classifies a group of complicated relational calculus queries whose search algorithms run in time O(I LogdI+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.