Efficient storage and fast querying of source code

Authors:
Oleksandr Panchenko;Hasso Plattner;Alexander B. Zeier
Affiliations:
Hasso Plattner Institute for Software Systems Engineering, Potsdam, Germany 14440;Hasso Plattner Institute for Software Systems Engineering, Potsdam, Germany 14440;Hasso Plattner Institute for Software Systems Engineering, Potsdam, Germany 14440
Venue:
Information Systems Frontiers
Year:
2011

Citing 17
Cited 2

Program understanding needs during corrective maintenance of large scale software

COMPSAC '97 Proceedings of the 21st International Computer Software and Applications Conference
Archetypal Source Code Searches: A Survey of Software Developers and Maintainers

IWPC '98 Proceedings of the 6th International Workshop on Program Comprehension
Programs as information

eclipse '03 Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange
JQuery: finding your way through tangled code

OOPSLA '04 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
An Information Retrieval Approach to Concept Location in Source Code

WCRE '04 Proceedings of the 11th Working Conference on Reverse Engineering
Hypertext support for the information needs of software maintainers

Journal of Software Maintenance and Evolution: Research and Practice
Integrating compression and execution in column-oriented database systems

Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Source Code Exploration with Google

ICSM '06 Proceedings of the 22nd IEEE International Conference on Software Maintenance
Sourcerer: a search engine for open source code supporting structure-based search

Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
Challenges of using LSI for concept location

ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Fast and practical indexing and querying of very large graphs

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Approximate Structural Context Matching: An Approach to Recommend Relevant Examples

IEEE Transactions on Software Engineering
Exploring the neighborhood with dora to expedite software maintenance

Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Code Conjurer: Pulling Reusable Software out of Thin Air

IEEE Software
ABAP Objects

ABAP Objects
CodeQuest: scalable source code queries with datalog

ECOOP'06 Proceedings of the 20th European conference on Object-Oriented Programming
Using the web as a reuse repository

ICSR'06 Proceedings of the 9th international conference on Reuse of Off-the-Shelf Components

Towards query formulation and visualization of structural search results

Proceedings of 2010 ICSE Workshop on Search-driven Development: Users, Infrastructure, Tools and Evaluation
Global IT and IT-enabled services

Information Systems Frontiers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Enabling fast and detailed insights over large portions of source code is an important task in a global development ecosystem. Numerous data structures have been developed to store source code and to support various structural queries, to help in navigation, evaluation and analysis. Many of these data structures work with tree-based or graph-based representations of source code. The goal of this project is to elaborate a data storage that enables efficient storing and fast querying of structural information. The naive adjacency list method has been enhanced with the use of recent data compression approaches for column-oriented databases to allow no-loss albeit compact storage of fine-grained structural data. The graph indexing has enabled the proposed data model to expeditiously answer fine-grained structural queries. This paper describes the basics of the proposed approach and illustrates its technical feasibility.