Typing regular path query languages for data graphs
SPLASH '15: Conference on Systems, Programming, Languages, and Applications: Software for Humanity Pittsburgh PA USA October, 2015(2015)
摘要
Regular path query languages for data graphs are essentially untyped. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, schema language for edge-labelled data graphs. This schema language is, then, used to define a query type inference approach with good precision properties.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络