Expressing structural hypertext queries in graphlog
Mariano P. Consens, Alberto O. Mendelzon · ACM Conference on Hypertext and Social Media (HT) · 1989
GraphLog is a visual query language in which queries are formulated by drawing graph patterns. The hyperdocument graph is searched for all occurrences of these patterns. The language is powerful enough to allow the specification and manipulation of arbitrary subsets of the network and supports the computation of aggregate functions on subgraphs of the hyperdocument. It can support dynamically defined structures as well as inference capabilities, going beyond current static and passive hypertext systems.The expressive power of the language is a fundamental issue: too little power limits the applications of the language, while too much makes efficient implementation difficult and probably affects ease of use. The complexity and expressive power of GraphLog can be characterized precisely by using notions from deductive database theory and descriptive complexity. In this paper, from a practical point of view, we present examples of GraphLog queries applied to several different hypertext systems, providing evidence for the expressive power of the language, as well as for the convenience and naturalness of its graphical representation. We also describe an ongoing implementation of the language.
Cited by 131 works. doi:10.1145/74224.74247
Authors
References
- Smalltalk-80: The Language and its Implementation
- Principles of database and knowledge-base systems, Vol. I
- SMALLTALK-80: the interactive programming environment
- Reflections on NoteCards: seven issues for the next generation of hypermedia systems
- Notecards in a nutshell
- Universality of data retrieval languages
- Neptune: a hypertext system for CAD applications
- Finding Regular Simple Paths in Graph Databases
- Searching for information in a hypertext medical handbook
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions