Completeness of Query Operations on Resource Spaces

A great variety of languages can be designed by different people for different purposes to operate resource spaces. Two fundamental issues are: can we design more operations in addition to existing operations? and, how many operations are sufficient or necessary? This paper solves these problems by investigating the theoretical basis for determining how complete a selection capability is provided in a resource operation sublanguage independent of any host language. The result is very useful to the design and analysis of operating languages.