Since large structured query logs have recently become available, we have a new opportunity to gain insights in the types of queries that users ask. Even though such logs can be quite volatile, there are various new observations that can be made about the structure of queries inside them, on which we report here. Furthermore, building on an extensive analysis that has been done on such logs, we were able to provide a theoretical explanation why regular path queries in graph database applications behave better than worst-case complexity results suggest at first sight.

中文翻译：

---

使用查询日志分析桥接理论与实践

由于最近出现了大型结构化查询日志，我们有了一个新的机会来深入了解用户提出的查询类型。尽管此类日志可能非常不稳定，但可以对其中的查询结构进行各种新的观察，我们将在此报告。此外，在对此类日志进行的广泛分析的基础上，我们能够提供理论上的解释，为什么图形数据库应用程序中的常规路径查询比最坏情况复杂性结果乍看之下表现得更好。