QUOGGLES: Query On Graphs – A Graphical Largely Extensible System

Holleis, Paul and Brandenburg, Franz J. (2004) QUOGGLES: Query On Graphs – A Graphical Largely Extensible System. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 465-470 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_48).

Full text not available from this repository.

Abstract

We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line processing, and composes its queries as directed acyclic graphs. The main focus is on the extensibility and the ease of use. The language permits queries that select a distinguished subgraph, e.g., the set of all green nodes with degree at least d or the set of edges whose endnodes have a neighbor which has exactly one neighbor. It is SQL complete, however, it cannot describe paths of arbitrary length; otherwise NP-hard problems like Hamilton path could directly be expressed. QUOGGLES also enables the user to concatenate queries with algorithms, e.g. with graph drawing algorithms, which are then applied to the selected subgraph.

Item Type:Conference Paper
Additional Information:10.1007/978-3-540-31843-9_48
Classifications:S Software and Systems > S.001 General
ID Code:618

Repository Staff Only: item control page

References

Brandenburg, F.J.: Graph-drawing contest report. Proceedings Graph Drawing 2002, LNCS 2528 (2002) 376-379

University of Passau: Gravisto. http://www.gravisto.org/ (2002)

Holleis, P.: Design and implementation of an extensible query language on graphs. Diploma thesis (2004)