This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
We present a typed polymorphic calculus that supports a general mechanism for view definition and object sharing among classes. In this calculus, a class can contain inclusion spe...
Abstract Appears in Proceedings of the Thirteenth Symposium on Principles of Database Systems, 1994 Ashish Gupta Yehoshua Sagivy Je rey D. Ullman Jennifer Widom Dept. of Computer S...
Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, J...