Adding Regular Expressions to Graph Reachability and Pattern Queries（将正则表达式添加到图形可达性和模式查询）.pdfVIP

Adding Regular Expressions to Graph Reachability and Pattern Queries 1,2 2 1 1 1 Wenfei Fan , Jianzhong Li , Shuai Ma , Nan Tang , Yinghui Wu 1 University of Edinburgh, UK {wenfei@inf., shuai.ma@, ntang@inf.,y.wu-18@sms.}ed.ac.uk 2 Harbin Institute of Technology, China lijzh@ Abstract鈥擨t is increasingly common to 铿乶d graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries and a class of graph patterns, in which an edge is speci铿乪d with a regular expression of a certain form, expressing the connectivity in a data graph via edges of various types. In addition, we de铿乶e graph pattern matching based on a revised notion of graph simulation. On graphs in emerging applications such as social networks, we show that these queries are capable of 铿乶ding more sensible information than their traditional counterparts. Better still, their increased expressive power does not come with extra complexity. Indeed, (1) we investigate their containment Fig. 1. Querying Essembly Network and minimization problems, and show that these fundamental problems are in quadratic time for reachability queries and connecting one user to a friend, if she shares the same views on are in cubic time for pattern queries. (2) We develop an most (more tha