Expressiveness of Query Languages for Resource Space Model
A great variety of query languages can be designed for operating resource spaces. But how many operations are complete or necessary? How to define “complete” or “necessary” formally? This chapter answers these questions by investigating the theoretical basis for determining how complete a selection capability is provided in a proposed resource sublanguage independently of any host language. The results are very useful to the design and analysis of the operating languages of the Resource Space Model.
KeywordsQuery Language Relational Algebra Extended Cartesian Product Finite Collection Common Axis
Unable to display preview. Download preview PDF.