This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Grammars and Relations
September 1992 (vol. 18 no. 9)
pp. 840-849

The potential benefits obtained when context-free grammars are used to define complex objects in the relational model are demonstrated. The grammar formalism facilitates relational queries on the hierarchical structure of these objects and promotes the use of grammar-based tools as front ends to relational database systems.

[1] R. Agrawalet al., "Efficient management of transitive relationships in large data and knowledge bases," in [42], pp. 253-262, 1989.
[2] R. Agrawal, "Alpha: An extension of relational algebra to express a class of recursive queries,"IEEE Trans. Software Eng., vol. 14, pp. 879-885, July 1988.
[3] D.S. Bataroy and W. Kim, "Modeling concepts for VLSI CAD objects," inSupplement to ACM SIGMOD Int. Conf. Management of Data, pp. 18-32, 1985.
[4] J. Banerjeeet al., "Clustering a DAG for CAD databases,"IEEE Trans. Software Eng., vol. 14, pp. 1684-199, Nov. 1988.
[5] B. Carre,Graphs and Networks. Oxford: Clarendon, 1978.
[6] S. Ceriet al., "Software portotyping by relational techniques: Experiences with program construction systems,"IEEE Trans. Software Eng., vol. 14, pp. 1597-1609, Nov. 1988.
[7] S. Ceriet al., "Algres: an advanced database system for complex applications,"IEEE Software, vol. 14, pp. 68-78, July 1990.
[8] M. Careyet al., "A data model and query language for EXODUS," inProc. ACM SIGMOD Int. Conf. Management of Data, pp. 413-423, June 1988.
[9] Y. Chenet al., "The C information abstraction system,"IEEE Trans. Software Eng., vol. 16, pp. 325-334, Mar. 1990.
[10] E. F. Codd, "Extending the relational database model to capture more meaning,"ACM Trans. Database Syst., vol. 4, no. 4, pp. 397-434, Dec. 1979.
[11] C.J. Date, "A critique of the SQL database,"ACM SIGMOD Record, 1984.
[12] U. Dayal and J.M. Smith, "Probe: A knowledge-oriented database management system," in M.L. Brodie and J. Mylopoulos, Eds.,On Knowledge Base Management Systems. Berlin: Springer-Verlag, 1986.
[13] M. Gyssenset al., "A grammar-based approach towards unifying hierarchical data models," in [42], pp. 263-272, 1989.
[14] G.H. Gonnet and F. Tompa, "A constructive approach to the design of algorithms and their data structures,"Commun. ACM, vol. 26, pp. 912-920, Nov. 1983.
[15] G. H. Gonnet, "Mind your grammar: A new approach to modeling text," inProc. 13th Int. Conf. Very Large Databases, pp. 339-346, Sept. 1987.
[16] L. Haaset al., "Starburst mid-flight: As the dust clears,"IEEE Trans. Knowledge and Data Eng., vol. 2, pp. 143-160, Mar. 1990.
[17] S. Horowitz, "Adding relational query facilities to software development environments,"Theoretical Comb. Sci., vol. 73, pp. 213-230, 1990.
[18] P. Hallet al., "Relations and entities," in G.M. Niissen, Ed.,Modeling in Database Management Systems. Amsterdam: North Holland, 1976.
[19] S. Horwitz and T. Teitelbaum, "Generating editing environments based on relations and attributes,"ACM Trans. Program. Lang. Syst., vol. 8, no. 4, pp. 577-608, Oct. 1986.
[20] J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation. Reading, MA: Addison-Wesley, 1979.
[21] G. Harhalakis and S. Yang, "Integration of network analysis systems with MRP in a make-to-order manufacturing environement,"J. Eng. Costs and Prod. Econ., vol. 14, pp. 47-59, May 1988.
[22] H. V. Jagadish and R. Agrawal, "A study of transitive closure as a recursion mechanism," inProc. 1987 ACM SIGMOD Conf. (San Francisco, CA), 1987, pp. 331-334.
[23] S.C. Johnson, "YACC: Yet another compiler-compiler," Tech. Rep., Bell Labs, 1978.
[24] M. Ketabchi and V. Berzins, "Mathematical model of composite objects and its application for organizing engineering databases,"IEEE Trans. Software Eng., vol. 14, pp. 71-84, Jan. 1988.
[25] M. Linton, "Queries and views of programs using a relational database system,"Tech. Rep. 164, EECS, Univ. California, Berkeley, 1985.
[26] R. Lorieet al., "Supporting complex objects in a relational system for engineering databases," inQuery Processing in Database Systems, Berlin: Springer-Verlag, 1985.
[27] G. Lohman, "Grammar-like function rules for representing query optimization alternatives,"Tech. Rep. RJ 5992 (59591), IBM Almaden Research Center, Dec. 1987.
[28] L. Mark, "Self-describing database systems-Formalization and realization,"Tech. Rep. TR-1264, Dept. Comp. Sci., Univ. Maryland, 1985.
[29] S. Mamraket al., "Chameleon: A system for solving the data-translation problem,"IEEE Trans. Software Eng., vol. 15, pp. 1090-1108, Sept. 1989.
[30] O. L. Madsen and C. Norgaard, "An object-oriented metaprogramming system," inProc. 21st Ann. Hawaii Int. Conf. on Software Track, B. Shriver, Ed. Los Alamitos, CA: IEEE Computer Soc., 1988, pp. 406-415.
[31] L. Mark and N. Roussopoulos, "Meta-data management,"Computer, vol. 19, no. 12, Dec. 1986.
[32] M. Mannino and L. Shapiro, "Extensions to query languages for graph traversal problems,"IEEE Trans. Knowledge and Data Eng., vol. 2, Sept. 1990.
[33] C. O'Connell, "Supporting the development of grammar descriptions for multiple applications,"Tech. Rep. OSU-CISRC-7/9O-TR-20, Ohio State Univ. Comp. Inf. Sci. Res. Center, July 1990.
[34] D. Ridjanovic and M. Brodie, "Defining database dynamics with attribute grammars,"Inform. Processing Letters, vol. 14, pp. 132-138, May 1982.
[35] M. Ruschitzka and J. Clevenger, "Heterogeneous data translations based on environment grammars,"IEEE Trans. Software Eng., vol. 15, pp. 1236-1251, Oct. 1989.
[36] A. Rosenthal, S. Heiler, U. Dayal, and F. Manola, "Traversal recursion: a practical approach to supporting recursive applications," inProc. 1986 ACM SIGMOD Conf.(Washington, DC), 1986, pp. 166-176.
[37] N. Roussopoulos, "The logical access path schema of a database,"IEEE Trans. Software Eng., vol. 8, pp. 563-573, Nov. 1982.
[38] L.A. Rowe, "Database representations for programs," inProc. ACM SIGMOD Workshop on Software CAD Databases, pp. 120-126, Feb. 1989.
[39] T. Reps and T. Teitelbaum, "The synthesizer generator," inProc. ACM SIGSOFT/SIGPLAN Software Eng. Symp., 1984, pp. 41-48.
[40] C.V. Ramamoorthyet al., "Genesis: An integrated environment for supporting devlopment and evolution of software," inProc. COMPSAC, 1985.
[41] N. Roussopoulos and R. Yeh, "SEES--A software testing environment support system,"Trans. Software Eng., vol. SE-11, pp. 355-366, Apr. 1985.
[42] Proc. ACM SIGMOD Int. Conf. Management of Data, June 1989.
[43] P. Valduriez and H. Boral, "Evaluation of recursive queries using join indices," inProc. First Int. Conf. Expert Database Systems, pp. 197-208, Apr. 1986.
[44] J. Widomet al., "Implementing set-orinted production rules as an extension to Starburst," inProc. 17th Int. Conf. Very Large Databases, pp. 275-285, Sept. 1991.

Index Terms:
context-free grammars; complex objects; relational model; grammar formalism; relational queries; hierarchical structure; grammar-based tools; front ends; relational database systems; context-free grammars; query processing; relational databases; user interfaces
Citation:
L. Mark, R.J. Cochrane, "Grammars and Relations," IEEE Transactions on Software Engineering, vol. 18, no. 9, pp. 840-849, Sept. 1992, doi:10.1109/32.159832
Usage of this product signifies your acceptance of the Terms of Use.