English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Querying Versioned Software Repositories

MPS-Authors
/persons/resource/persons45016

Mazeika,  Arturas
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Christopeit, D., Böhlen, M., Kanne, C.-C., & Mazeika, A. (2011). Querying Versioned Software Repositories. In J. Eder, M. Bieliková, & A. M. Tjoa (Eds.), Advances in Databases and Information Systems (pp. 42-55). Berlin: Springer. doi:10.1007/978-3-642-23737-9_4.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-14A1-B
Abstract
Large parts of today's data is stored in text documents that undergo a series of changes during their lifetime. For instance during the development of a software product the source code changes frequently. Currently, managing such data relies on version control systems (VCSs). Extracting information from large documents and their different versions is a manual and tedious process. We present {\sc Qvestor}, a system that allows to declaratively query documents. It leverages information about the structure of a document that is available as a context-free grammar and allows to declaratively query document versions through a grammar annotated with relational algebra expressions. We define and illustrate the annotation of grammars with relational algebra expressions and show how to translate the annotations to easy to use SQL views.