The functional data model and the data languages DAPLEX
ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries
Journal of the ACM (JACM)
On the Equivalence of Database Models
Journal of the ACM (JACM)
Finite Differencing of Computable Expressions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Fundamentals of Computer Alori
Fundamentals of Computer Alori
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Properties of acyclic database schemes
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Adding range restriction capability to dynamic data structures
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Fragmentation: a technique for efficient query processing
ACM Transactions on Database Systems (TODS)
On the application of sheared retrieval to orthogonal range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Binding performance at language design time
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
Optimal sample cost residues for differential database batch query problems
Journal of the ACM (JACM)
Quasilinear algorithms for processing relational calculus expressions (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Faster join-projects and sparse matrix multiplications
Proceedings of the 12th International Conference on Database Theory
From clarity to efficiency for distributed algorithms
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
| Hi-index | 0.00 |
In this paper we define a language based on a broad subset of the relational calculus and show all expressions in this language can be evaluated in space O(N) and time O(N logdN), where d is a small constant whose value depends on the particular predicate and where N is the number of records stored in the data base. We currently have no hard statistics, but a reasonable guess seems to be that a standard sequential random access machine can handle 95% or more of commercial requests in time O(N log N) and memory O(N) using this technique.