DMCA
Codequest: Scalable source code queries with datalog (2006)
| Venue: | In ECOOP Proceedings |
| Citations: | 56 - 0 self |
BibTeX
@INPROCEEDINGS{Hajiyev06codequest:scalable,
author = {Elnar Hajiyev and Mathieu Verbaere and Oege De Moor},
title = {Codequest: Scalable source code queries with datalog},
booktitle = {In ECOOP Proceedings},
year = {2006},
pages = {2--27},
publisher = {Springer}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Source code querying tools allow programmers to explore relations between different parts of the code base. This paper describes such a tool, named CodeQuest. It combines two previous proposals, namely the use of logic programming and database systems. As the query language we use safe Datalog, which was originally introduced in the theory of databases. That provides just the right level of expressiveness; in particular recursion is indispensable for source code queries. Safe Datalog is like Prolog, but all queries are guaranteed to terminate, and there is no need for extra-logical annotations. Our implementation of Datalog maps queries to a relational database system. We are thus able to capitalise on the query optimiser provided by such a system. For recursive queries we implement our own optimisations in the translation from Datalog to SQL. Experiments confirm that this strategy yields an efficient, scalable code querying system. 1
Keyphrases
scalable source code query safe datalog source code query right level scalable code previous proposal extra-logical annotation recursive query database system logic programming source code querying tool different part datalog map query relational database system particular recursion query optimiser query language code base
