The Formal Reconstruction and Speedup Of The Linear Time Fragment Of Willard’s Relational Calculus Subset
Authors:
- Deepak GoyalDGDeepak Goyal
- Robert PaigeRPRobert Paige
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 382-414
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- High level reading and data structure compilation1997
- Applications of Range Query Theory to Relational Data Base Join and Selection OperationsJournal of Computer and System Sciences, 1996
- Using multiset discrimination to solve language processing problems without hashingTheoretical Computer Science, 1995
- Model checking and boolean graphsTheoretical Computer Science, 1994
- Programming with Sets1986
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Improving the access time for random access filesCommunications of the ACM, 1977
- Automatic data structure choice in a language of very high levelCommunications of the ACM, 1975
- Optimization of very high level languages—I: Value transmission and its corollariesComputer Languages, 1975
- A relational model of data for large shared data banksCommunications of the ACM, 1970