QUOGGLES: Query On Graphs – A Graphical Largely Extensible System

  • Paul Holleis
  • Franz J. Brandenburg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)

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.

References

  1. 1.
    Brandenburg, F.J.: Graph-drawing contest report. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 376–379. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    University of Passau: Gravisto (2002), http://www.gravisto.org/
  3. 3.
    Holleis, P.: Design and implementation of an extensible query language on graphs. Diploma thesis (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Paul Holleis
    • 1
  • Franz J. Brandenburg
    • 2
  1. 1.University of MunichMunichGermany
  2. 2.University of PassauPassauGermany

Personalised recommendations