We introduce a time- and space-efficient technique to solve regularpath queries over labeled graphs. We combine a bit-parallel simula-tion of the Glushkov automaton of the regular expression with thering index introduced by Arroyuelo et al., exploiting its wavelettree representation of the triples in order to efficiently reach thestates of the product graph that are relevant for the query. Ourquery algorithm is able to simultaneously process several automa-ton states, as well as several graph nodes/labels. Our experimentalresults show that our representation uses 3-5 times less space thanthe alternatives in the literature, while generally outperformingthem in query times (1.67 times faster than the next best).

翻译：我们引入了一种时间和空间高效技术来解决标签图形的常规路径查询。 我们将常规表达式的Glushkov 自动模擬与Arroyuelo 等人推出的环状指数结合起来, 利用它的三重波纹树代表面, 以便有效地到达与查询相关的产品图表状态。 我们的解析算法能够同时处理几个自动状态, 以及几个图形节点/ 标签。 我们的实验结果显示, 我们的表达方式使用的空间比文献中的替代品少了3-5倍, 而通常在查询时间比它们表现得快( 1.67 倍 ) 。