Gram: A graph data model and query language

Proceedings of the ACM Conference on Hypertext

Volumn Part F129614, Issue , 1992, Pages 201-211

  Amann, Bernd ^a   Scholl, Michel ^b  

^a INRIA   (France)

^b CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HYPERTEXT SYSTEMS; PATTERN MATCHING; QUERY LANGUAGES;

ALGEBRAIC LANGUAGES; AS GRAPH; CONNECTED SUBGRAPHS; EDGE LABELS; GRAPH DATA MODELS; RECURSIONS; REGULAR EXPRESSIONS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 84957623724     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/168466.168527     Document Type: Conference Paper

References (20)

1. F. Afrati and C. Koutras, A hypertext model supporting query mechanisms, ECHT '90, 52-66, Versailles, Nov. 1990.
2. B. Amann and V. Christophides, Providing persistence to the hypermedia system Multi- Card by using the OODBMS O2, internal note, Verso project, INRIA, Sept. 1992.
3. 2 Book:, Morgan Kaufmann, 1992.
4. C. Beeri and Y. Kornatzky, A logical query language for hypertext systems, ECHT '90, 67-80, Versailles, Nov. 1990.
5. J. Biskup, U. Rasch, and H. Stiefeling, An extension of SQL for querying graph relations, Computer Languages, 15(2), 65-82, 1990.
6. B. Conklin, Hypertext: An introduction and survey, IEEE Computer, 20(19), 17-41, Sept. 1987.
7. M. Consens and A. Mendelzon, Expressing structural hypertext queries in graph log, Proceedings of Hypertext '89, Nov. 1989, 269292.
8. M. Consens and A. Mendelzon, Graph Log: A visual fromalism for real life recursion, Pro-ceedings of the ACM Symposium on Principles of Database Systems, Nashville, Tennessee, 1990, 404-416.
9. N. Delisle and M. Schwartz, Contexts: A partitioning concept for hypertexts, ACM Trans-Actions on Information Systems, 5(2), 168- 186, Apr. 1987.
10. S. Feiner, Seeing the forest for the trees: Hierarchical display of hypertext structure, Pro-ceedings of the Conference on Office Information Systems, Palo Alto, Calif., Mar. 1988, 205-212.
11. R. Furuta and P. Stotts, Separating hypertext content from structure in trellis, Hypertext: State of the Art, 205-213, 1989.
12. R. Giiting, Extending a spatial database system by graphs and object class hierarchies, Proceedings of the Int. Workshop on Database Management Systems for Geographical Appli-cations, Capri, May 1991, G. Gambosi, H. Six, and M. Scholl (eds.), Capri, May 1991.
13. M. Gyssens, J. Paredaens, and D. V. Gucht, A graph-oriented object database model, Proceedings of the ACM Symposium on Principles of Database Systems, Nashville, Tennessee, 1990, 417-424.
14. F. G. Halasz, Reflections on notecards: Seven issues for the next generation of hypermedia systems, Communications of the ACM, 31(7), 836-852, July 1988.
15. F. G. Halasz and M. Schwartz, The Dexter hypertext reference model, Proceedings of the NIST Hypertext Standardization Workshop, Jan. 1990, 95-133.
16. F. Harary, Graph Theory, Addison Wesley Series in Mathematics, 1971.
17. A. Rizk and L. Sauter, Multicard: An open hypermedia system, this volume, 1992.
18. F. W. Tompa, A data model for flexible hypertext database systems, ACM Transactions on Information Systems, 7(1), 85-100, July 1989.
19. J. Ullman, Principles of Database and Knowledgebase Systems, volume 2, Computer Science Press, 1989.
20. P. T. Zellweger, Active paths through multimedia documents, Proceedings of the 1st int. Conf. on Electronic Publishing: Document Manipulation and Typography, Nice (France), Apr. 1988, 19-34.