The functional data model and the data languages DAPLEX
ACM Transactions on Database Systems (TODS)
An implementation technique for database query languages
ACM Transactions on Database Systems (TODS)
Communications of the ACM
A relational model of data for large shared data banks
Communications of the ACM
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
FQL: a functional query language
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
The ROBOT System: Natural language processing applied to data base query
ACM '78 Proceedings of the 1978 annual conference
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
A FAD for Data Intensive Applications
IEEE Transactions on Knowledge and Data Engineering
The Semantic Binary Relationship Model of information
SIGIR '84 Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Generic multiset programming for language-integrated querying
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Generic multiset programming with discrimination-based joins and symbolic Cartesian products
Higher-Order and Symbolic Computation
Static and dynamic semantics of NoSQL languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hi-index | 0.00 |
Functional programming systems, although they have nice theoretical properties and elegant implementations, have failed to make any significant impact in the practical world of applications programming. We shall describe a simple FP system for databases that is gaining considerable practical use as an interface language for complex database management systems. Not only does it provide a concise formalism for database queries but the implementation, which is done by a lazy evaluator, in many cases produces more efficient queries than conventional query systems because it reduces the amount of i/o. We also suggest that the implementation technique may be more generally applicable to FP systems.