Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Efficient processing of relational calculus expressions using range query theory
Home
Publications
Efficient processing of relational calculus expressions using range query theory
Efficient processing of relational calculus expressions using range query theory
Author:
DW
Dan E Willard
Dan E Willard
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Open Access
Publisher website
Google Scholar
1 January 1984
conference paper
Published by
Association for Computing Machinery (ACM)
Vol. 14
(2)
,
164-175
DOI:
10.1145/602259.602281
Abstract
No abstract available
Keywords
PREDICATE (MATHEMATICAL LOGIC)
BASE (TOPOLOGY)
CODD'S THEOREM
CONSTANT (COMPUTER PROGRAMMING)
Cited
Cited by 11 articles
Scroll to top