Alexei P. Stolboushkin
- AGSS86.A.K. Ailamazian, M.M. Gilula, A.P. Stolboushkin, and G.F. Schwarz. Reduction of the relational model with infinite domains to the case of finite domains. Doklady Akademiz nauk SSSR, 286(2):308-311, 1986. Russian.Google Scholar
- AH91.A. Avron and J. Hirshfeld. On first order database query languages, in Proc. 6th IEEE Symp. on Logzc zn Computer Science, pages 226-231, 1991.Google ScholarCross Ref
- Cod70.E.F. Codd. A relational model for large shared data banks. Communicalzons of the A CM, 13:377-387, 1970. Google ScholarDigital Library
- Cod72.E.F. Codd. Relational completeness of data base sublanguages. In R. Rustin, editor, Database Systems, pages 33-64. Prentice-Hall, 1972.Google Scholar
- Di 69.R.A. Di Paola. The recursive unsolvability of the decision problem for the class of definite formulas. Journal of the A CM, 16(2):324-327, 1969. Google ScholarDigital Library
- ELTT65.Yu.L. Ershov, I.A. Lavrov, A.D. Taimanov, and M.A. Taitslin. Elementary theories. Russian Mathematical Surveys, 20(4):35-105, 1965.Google ScholarCross Ref
- End72.H.B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.Google Scholar
- Hir91.J. Hirshfeld. Safe queries in relational databases with functions. In CSL '91: 5th Workshop on Computer Sczence Logic, LNCS, pages 173- 183. Springer-Verlag, 1991. Google ScholarDigital Library
- Kif88.M. Kifer. On safety, domain independence, and capturability of database queries. In Proc. Third Inlernalional Conference on Data and Knowledge Bases, 1988.Google ScholarCross Ref
- KKR90.P.C. Kanellakis, G.M. Kuper, and P.Z. Revesz. Constraint query languages. In Proc. 9th A CM Symp. on Principles of Database Systems, pages 299-313, 1990. Google ScholarDigital Library
- Rab77.M.D. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic, volume 3. North-Holland, Amsterdam, New York, Oxford, 1977.Google ScholarCross Ref
- Ull82.J.D. Vllman. Pmnciples of Database Systems. Computer Science Press, 2 edition, 1982. Google ScholarDigital Library
- Ull88.:I.D. Ullman. Principles of Database and Knowledge-Base Systems, Volumes I and H. Computer Science Press, 1988. Google ScholarDigital Library
- Van91.Van Gelder, A. and R.W. Topor. Safety and translation of relational calculus queries. A CM Trans. on Database Systems, 16(2):235-278, June 1991. Google ScholarDigital Library
- Var81.M.Y. Vardi. The decision problem for database dependencies. Information Processing Letters, pages 251-254, 1981.Google ScholarCross Ref
Index Terms
- Finite queries do not have effective syntax
Recommendations
An Effective Syntax for Bounded Relational Queries
SIGMOD '16: Proceedings of the 2016 International Conference on Management of DataA query Q is boundedly evaluable under a set A of access constraints if for all datasets D that satisfy A, there exists a fraction DQ of D such that Q(D) = Q(DQ), and the size of DQ and time for identifying DQ are both independent of the size of D. That ...
Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions
OOPSLA '04Application programmer's interfaces give access to domain knowledge encapsulated in class libraries without providing the appropriate notation for expressing domain composition. Since object-oriented languages are designed for extensibility and reuse, ...
Comprehending queries over finite maps
PPDP '23: Proceedings of the 25th International Symposium on Principles and Practice of Declarative ProgrammingRecent programming languages research has developed language-integrated query, a convenient technique to seamlessly embed a domain-specific database query language into a general-purpose host programming language; such queries are then automatically ...
Comments