Vrgoc, DomagojDomagojVrgocTONY TAN2020-05-042020-05-04201401290541https://scholars.lib.ntu.edu.tw/handle/123456789/490119https://www.scopus.com/inward/record.uri?eid=2-s2.0-84928532793&doi=10.1142%2fS0129054114400188&partnerID=40&md5=ec93c488e53cab0a9f9f4985ddf111fcThe standard regular expressions over finite alphabets have been widely accepted as the most basic formalism to query graph databases. However, the major drawback of this approach is that it ignores the presence of data. In this paper we study the so called regular expressions with binding (REWB), that is, regular expressions equipped with variables to store data within a well defined scope. In particular, we study the complexity of the query evaluation of REWB queries over graph databases. © 2014 World Scientific Publishing Company.data words; Graph databases; query languagesconference paper10.1142/S01290541144001882-s2.0-84928532793https://doi.org/10.1142/S0129054114400188