A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language as a function of the size of the database, and expression complexity is the complexity of ewduating a query in the language as a function of the size of the expression defining the query. We study the data and expression complexity of logical langnages -relational calculus and its extensions by transitive closure, fixpoint and second order existential quantificationdoi:10.1145/800070.802186 dblp:conf/stoc/Vardi82 fatcat:4cdrq5vgajbf5ptlzg445345lu