This paper presents GuLP a graph query language that enables to declaratively express preferences. Preferences enable to order the answers to a query and can be stated in terms of nodes/edge attributes and complex paths. We present the formal syntax and semantics of GuLP and a polynomial time algorithm for evaluating GuLP expressions. We describe an implementation of GuLP in the GuLP-it system, which is available for download. We evaluate the GuLP-it system on real-world and synthetic data. Copyright 2013 ACM.
Querying graphs with preferences / Fionda, V.; Pirro', Giuseppe. - (2013), pp. 929-938. (Intervento presentato al convegno 22nd ACM International Conference on Information and Knowledge Management, CIKM 2013 tenutosi a San Francisco, CA, usa) [10.1145/2505515.2505758].