We present GeX for the approximate matching of complex queries on graph-modeled data.

GeX generalizes existing approaches and allows for querying any graph-based datasets.

GeX query language supports queries ranging from keyword-based to complex ones.

GeX query answering model delivers meaningfully approximated results only.

GeX implements data structures and algorithms to efficiently support query answering.