This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Extensions to Query Languages for Graph Traversal Problems
September 1990 (vol. 2 no. 3)
pp. 353-363

Extensions to database query languages for retrievals that involve inferencing on the nodes and edges of a graph are surveyed. Common types of inferencing are to find paths between two nodes, compute a value for a path such as a distance or an elapsed time, and to choose among alternative paths. The survey is based on the data model (relational or functional), method of extension (iteration, recursion, or special operators), interface style (string or tabular), and restrictions (data- and problem-oriented). The Quel, objected-oriented functional data, G-Whin, and Alpha languages are examined in detail with different values for these properties. The characteristics of other languages are summarized in several tables. The results of the survey indicate the diversity of language extensions and the need to provide data-model and query-language features to address such problems.

[1] R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries,"Proc. Third Int'l Conf. Data Eng., CS Press, Los Alamitos, Calif., Order No. FN762, 1987, pp. 580-590.
[2] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[3] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACM-SIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 16-52.
[4] O. P. Buneman and R. E. Frankel, "FQL-A functional query language," inProc. 1979 ACM SIGMOD Int. Conf. Management of Data, Boston, MA, May 1979.
[5] P. Buneman, "Can we reconcile programming languages and databases? " inDatabases--Role and Structure, P. Stocker, P. Gray, and M. Atkinson, Eds. Cambridge, MA: Cambridge University Press, 1984, pp. 226-243.
[6] B. Carre,Graphs and Networks. Oxford, England: Clarendon, 1978.
[7] A. Chandra and D. Harel, "Horn clause queries and generalization," inACM SIGACT-SIGMOD Symp. Principles Database Syst., 1982.
[8] S. Chang, "Pictorial information systems: Guest Editor's Introduction,"IEEE Comput. Mag., vol. 14, no. 11, Nov. 1981.
[9] C.J. Date,An Introduction to Database Systems, Vol. II, Addison-Wesley Publishing Co., Reading, Mass., 1983.
[10] C. J. Date,Relational Databases: Selected Writings. Reading, MA: Addison-Wesley, 1986.
[11] 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.
[12] A. Geoffrion, "Introduction to structured modeling,"Management Sci., vol. 33, no. 5, pp. 547-588, May 1987.
[13] S. Heiler and A. Rosenthal, "G-WHIZ: A visual interface for the functional model with recursion," inProc. 11th Very Large Data Bases, Stockholm, Sweden, 1985, pp. 209-218.
[14] L. J. Henschen and S. Naqvi, "On compiling queries in recursive first-order databases,"J. ACM, vol. 1, no. 1, pp. 47-85, 1984.
[15] F. S. Hillier and G. J. Lieberman,Operations Research, 3rd ed. San Francisco, CA: Holden-Day, 1980.
[16] Y. Ioannidis and E. Wong, "An algebraic approach to recursive inference," inProc. First Int. Conf. Expert Database Syst., Charleston, SC, Apr. 1986, pp. 209-224.
[17] H. Jagadish and R. Agrawal, "A study of transitive closure as a recursion mechanism," AT&T Bell Lab. Tech. Rep., 1986.
[18] D. Jagannathanet al., "SIM: A database system based on the semantic data model," inProc. ACM SIGMOD Conf., Chicago, IL, June 1988, pp. 46-55.
[19] D. Kendrick and A. Meeraus, "GAMS" An introduction," Development Res. Dep., The World Bank, Washington, DC 20433.
[20] R. Kung, E. Hanson, Y. Ioannidis, T. Sellis, L. Shapiro, and M. Stonebraker, "Heuristic search in data base systems," inProc. 1st Int. Workshop Expert Data Base Systems, Kiawah Island, SC, Oct. 1984.
[21] R. Lee and W. Miller, "A logic programming approach to building planning and simulation models,"Decision Support Syst., vol. 2, no. 1, pp. 15-25, 1986.
[22] M. Mannino, I. Choi, and D. Batory, "An overview of the Object-Oriented Functional Data Language," inProc. IEEE Conf. Data Eng. (COMPDEC), Los Angeles, CA, Feb. 1989.
[23] M. Mannino, "The Object-Oriented Functional Data Language,"IEEE Trans. Software Eng., to be published.
[24] T. H. Merrett,Relational Information System. Reston, VA: Reston Publishing, 1984.
[25] K. Nygard and L. Shapiro, "Data base management systems in operations research," Working Paper, Computer Sci./Oper. Res. Dep., Univ. of North Dakota State, 1986.
[26] J. Orenstein, "Spatial query processing in an object-oriented database system," inProc. ACM SIGMOD Conf., Washington, DC, May 1986, pp. 326-336.
[27] G. Ozsoyoglu and Z. Ozsoyoglu, "Statistical database query languages,"IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1071- 1080, Oct. 1985.
[28] A. Rosenthal, S. Heiler, and F. Manola, "An example of knowledge-based query processing on a CAD/CAM DBMS," inProc. 10th Very Large Data Bases, 1984.
[29] 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.
[30] P. Selinger,et al., "Access path selection in a relational data base system," inProc. 1979 ACM-SIGMOD Int. Conf. Management of Data, Boston, MA, June 1979.
[31] T. Sellis and L. Shapiro, "Optimization of extended database query languages," inProc. 1985 ACM-SIGMOD Int. Conf. Management of Data, Austin, TX, May 1985.
[32] M. Stonebraker,et al., "The design and implementation of INGRES,"ACM Trans. Database Syst., vol. 1, no. 3, Sept. 1976.
[33] M. Stonebraker, B. Rubenstein, and A. Guttmann, "Application of abstract data types and indices to CAD data bases," inProc. Data-base Week: Eng. Design Appl., San Jose, CA, May 1983, pp. 107- 113.
[34] M. Stonebraker and L. Rowe, "The design of POSTGRES," inProc. 1986 ACM-SIGMOD Conf. Management of Data, Washington, DC, May 1986.
[35] J. D. Ullman, "Implementation of logical query languages for databases,"ACM TODS, vol. 10, no. 3, pp. 289-321, 1985.
[36] P. Valduriez and H. Boral, "Evaluation of recursive queries using join indices," inProc. First Int. Conf. Expert Database Syst., Charleston, SC, Apr. 1986, pp. 197-208.
[37] D. Varvel and L. Shapiro, "The computational completeness of extended database query languages,"IEEE Trans. Software Eng., vol. 15, no. 5, pp. 632-637, May 1989.
[38] L. Vieille, "Recursive axioms in deductive databases: The query/ subquery approach," inProc. First Int. Conf. Expert Database Syst., Charleston, SC, Apr. 1986, pp. 179-196.
[39] Wirth, N. 1976.Algorithms + Data Structures = Programs, Englewood Cliffs, NJ, Prentice Hall.
[40] S. Tsur and C. Zaniolo, "LDL: a logic-based data-language," inProc. 12th VLDB Conf., 1986, pp. 33-41.
[41] M. Zloof, "Query-by-example: A database language,"IBM Syst. J., vol. 16, no. 4, pp. 324-343, 1977.
[42] Orack Corp.,SQL*Plus Reference Guide, Belmont, CA, 1987.

Index Terms:
graph traversal problems; database query languages; inferencing; elapsed time; data model; interface style; Quel; objected-oriented functional data; G-Whin; Alpha languages; information retrieval; query languages
Citation:
M.V. Mannino, L.D. Shapiro, "Extensions to Query Languages for Graph Traversal Problems," IEEE Transactions on Knowledge and Data Engineering, vol. 2, no. 3, pp. 353-363, Sept. 1990, doi:10.1109/69.60798
Usage of this product signifies your acceptance of the Terms of Use.