Efficient processing of relational calculus expressions using range query theory
- 1 June 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 14 (2) , 164-175
- https://doi.org/10.1145/971697.602281
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- The power of inequality semijoinsInformation Systems, 1981
- Power of Natural SemijoinsSIAM Journal on Computing, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Properties of acyclic database schemesPublished by Association for Computing Machinery (ACM) ,1981
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980
- Multidimensional divide-and-conquerCommunications of the ACM, 1980
- Efficient worst-case data structures for range searchingActa Informatica, 1980
- The theory of joins in relational databasesACM Transactions on Database Systems, 1979
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975