A grammar-based approach towards unifying hierarchical data models
暂无分享,去创建一个
A simple model for representing the hierarchical structure of information is proposed. This model, called the grammatical model, is based on trees that are generated by grammars; the grammars describe the hierarchy of the information represented by the trees. Two methods for querying in this data model are given. The first, called the grammatical algebra, is based on a set of primitive grammar-oriented operators, the second, called the grammatical calculus, on local transformations on the trees. The semantics of both is formally defined. Decidability issues regarding the grammatical calculus are investigated. Finally, the two querying methods are proved to be equally expressive.
[1] Serge Abiteboul,et al. Non first normal form relations to represent hierarchically organized data , 1984, PODS.
[2] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[3] Nicole Bidoit,et al. The Verso Algebra or How to Answer Queries with Fewer Joins , 1987, J. Comput. Syst. Sci..
[4] Serge Abiteboul,et al. IFO: A Formal Semantic Database Model , 1987, ACM Trans. Database Syst..