Demo Data from VLDB 2026 / reviewers in the wild / expert
Joel Ossher
dblp:95/4745
· DBLP profile ↗
13ranked-venue papers
3as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 11 · 3 first-authorDatabases, data management, data science and information retrieval · 4 · 2 first-authorComputer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Software engineering, system software, and programming languages
3 papers |
Empirical software engineering · 78% Software maintenance and evolution · 9% Program synthesis and code generation · 9% | |
| Databases, data mining, and information retrieval
2 papers |
Information retrieval · 70% Data stream processing · 30% |
Topics — the 12 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Empirical software engineering › software metrics
object-oriented metrics |
0.2 | 1 | 2015 | How scale affects structure in Java programs · OOPSLA 2015 |
Empirical software engineering
software metrics |
0.2 | 1 | 2015 | How scale affects structure in Java programs · OOPSLA 2015 |
Information retrieval › document retrieval › domain-specific retrieval
code search |
0.1 | 1 | 2010 | Leveraging usage similarity for effective retrieval of examples in code repositories · SIGSOFT FSE 2010 |
Information retrieval
retrieval models |
0.1 | 1 | 2010 | Leveraging usage similarity for effective retrieval of examples in code repositories · SIGSOFT FSE 2010 |
Data stream processing
complex event processing |
0.1 | 1 | 2007 | Cayuga: a high-performance event processing engine · SIGMOD Conference 2007 |
Software maintenance and evolution › code reuse
code search and reuse |
0.1 | 1 | 2007 | CodeGenie: using test-cases to search and reuse source code · ASE 2007 |
Program synthesis and code generation
programming by example |
0.1 | 1 | 2007 | CodeGenie: using test-cases to search and reuse source code · ASE 2007 |
Empirical software engineering › mining software repositories
large-scale code analysis |
0.1 | 1 | 2015 | How scale affects structure in Java programs · OOPSLA 2015 |
Empirical software engineering
mining software repositories |
0.1 | 1 | 2015 | How scale affects structure in Java programs · OOPSLA 2015 |
Empirical software engineering
software repositories |
0.0 | 1 | 2010 | Leveraging usage similarity for effective retrieval of examples in code repositories · SIGSOFT FSE 2010 |
Data stream processing
event monitoring |
0.0 | 1 | 2007 | Cayuga: a high-performance event processing engine · SIGMOD Conference 2007 |
Software testing
test-driven development |
0.0 | 1 | 2007 | CodeGenie: using test-cases to search and reuse source code · ASE 2007 |
Methods — techniques the papers use, named apart from their topics
structural semantic indexing · 0.2statistical analysis · 0.2information retrieval · 0.2source code infrastructure · 0.1automated weaving and testing · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | How scale affects structure in Java programsabstractMany internal software metrics and external quality attributes of Java programs correlate strongly with program size. This knowledge has been used pervasively in quantitative studies of software through practices such as normalization on size metrics. This paper reports size-related super- and sublinear effects that have not been known before. Findings obtained on a very large collection of Java programs -- 30,911 projects hosted at Google Code as of Summer 2011 -- unveils how certain characteristics of programs vary disproportionately with program size, sometimes even non-monotonically. Many of the specific parameters of nonlinear relations are reported. This result gives further insights for the differences of ``programming in the small'' vs. ``programming in the large.'' The reported findings carry important consequences for OO software metrics, and software research in general: metrics that have been known to correlate with size can now be properly normalized so that all the information that is left in them is size-independent. Cristina V. Lopes, Joel Ossher |
OOPSLA | 2 |
| 2014 | Is Popularity a Measure of Quality? An Analysis of Maven ComponentsabstractOne of the perceived values of open source software is the idea that many eyes can increase code quality and reduce the amount of bugs. This perception, however, has been questioned by some due the lack of supporting evidence. This paper presents an empirical analysis focusing on the relationship between the utilization of open source components and their engineering quality. In this study, we determine the popularity of 2,406 Maven components by calculating their usage across 55,191 open source Java projects. As a proxy of code quality for a component, we calculate (i) its defect density using the set of bug patterns reported by Find Bugs, and (ii) 9 popular software quality metrics from the SQO-OSS quality model. We then look for correlations between (i) popularity and defect density, and (ii) popularity and software quality metrics. In most of the cases, no correlations were found. In cases where minor correlations exist, they are driven by component size. Statistically speaking, and using the methods in this study, the Maven repository does not seem to support the "many eyeballs" effect. We conjecture that the utilization of open source components is driven by factors other than their engineering quality, an interpretation that is supported by the findings in this study. Hitesh Sajnani, Vaibhav Saini, Joel Ossher, Cristina V. Lopes |
ICSME | 3 |
| 2014 | A dataset for maven artifacts and bug patterns found in themabstractIn this paper, we present data downloaded from Maven, one of the most popular component repositories. The data includes the binaries of 186,392 components, along with source code for 161,025. We identify and organize these components into groups where each group contains all the versions of a library. In order to asses the quality of these components, we make available report generated by the FindBugs tool on 64,574 components. The information is also made available in the form of a database which stores total number, type, and priority of bug patterns found in each component, along with its defect density. We also describe how this dataset can be useful in software engineering research. Vaibhav Saini, Hitesh Sajnani, Joel Ossher, Cristina V. Lopes |
MSR | 3 |
| 2014 | Sourcerer: An infrastructure for large-scale collection and analysis of open-source code
Sushil Krishna Bajracharya, Joel Ossher, Cristina V. Lopes |
Sci. Comput. Program. | 2 |
| 2012 | Parallel code clone detection using MapReduceabstractCode clone detection is an established topic in software engineering research. Many detection algorithms have been proposed and refined but very few exploit the inherent parallelism present in the problem, making large scale code clone detection difficult. To alleviate this shortcoming, we present a new technique to efficiently perform clone detection using the popular MapReduce paradigm. Preliminary experimental results demonstrates speed-up and scale-up of the proposed approach. Hitesh Sajnani, Joel Ossher, Cristina V. Lopes |
ICPC | 2 |
| 2011 | File cloning in open source Java projects: The good, the bad, and the uglyabstractWe present a study of the extent to which developers copy entire files or sets of files into their applications with little or no modification. Our aim is to determine the prevalence of such activity within open source Java development, and to identify the circumstances under which files are reused in this manner. To accomplish this aim, we developed a novel method of file-level code clone detection that is scalable to millions of files. We applied our method to the Sourcerer Repository, which contains over 13,000 Java projects aggregated from multiple open source repositories. Our method detected that in excess of 10% of files are clones, and that over 15% of all projects contain at least one cloned file. In addition to computing these raw numbers, we manually examined a large number of the reported clones. We found the most commonly cloned files to be Java extension classes and popular third-party libraries, both large and small. We also discovered a number of projects that occur in multiple online repositories, have been forked, or were divided into multiple subprojects. Joel Ossher, Hitesh Sajnani, Cristina V. Lopes |
ICSM | 1 |
| 2011 | Static discovery and remediation of code-embedded resource dependenciesabstractMany enterprises perform data-center transformation, consolidation, and migration in order to improve the efficiency of their IT infrastructures. These transformation projects begin with the discovery of the existing infrastructure, in particular the dependencies between applications. These dependencies are needed in planning, in order to determine how components influence one another, and in relinking, so that the component names and addresses can be updated. Typically, dependency discovery is done by network monitoring and middleware configuration analysis. These existing approaches will often fail to detect dependencies expressed in the application code. In this paper, we present the first method and tool for automatically identifying code-embedded external dependencies in Java Enterprise Edition applications. In addition, our tool can automatically alter the application code to update the dependencies, or externalize them to configuration files. We analyzed over 1000 Java EE applications from three enterprise environments. The results demonstrate the prevalence of code-embedded dependencies that would otherwise have to be identified manually, often causing failures during user-acceptance testing. Nikolai Joukov, Vasily Tarasov, Joel Ossher, Birgit Pfitzmann, Sergej Chicherin, Marco Pistoia, Takaaki Tateishi |
Integrated Network Management | 3 |
| 2011 | A test-driven approach to code search and its application to the reuse of auxiliary functionality
Otávio Augusto Lazzarini Lemos, Sushil Krishna Bajracharya, Joel Ossher, Paulo César Masiero, Cristina V. Lopes |
Inf. Softw. Technol. | 3 |
| 2010 | Automated dependency resolution for open source softwareabstractOpportunities for software reuse are plentiful, thanks in large part to the widespread adoption of open source processes and the availability of search engines for locating relevant artifacts. One challenge presented by open source software reuse is simply getting a newly downloaded artifact to build/run in the first place. The artifact itself likely reuses other artifacts, and so depends on their being located to function properly. While merely tedious in the individual case, this can cause serious difficulties for those seeking to study open source software. It is simply not feasible to manually resolve dependencies for thousands of projects, and many forms of analysis require declarative completeness. In this paper we present a method for automatically resolving dependencies for open source software. It works by cross-referencing a project's missing type information with a repository of candidate artifacts. We have implemented this method on top of the Sourcerer, an infrastructure for the large-scale indexing and analysis of open source code. The performance of our resolution algorithm was evaluated in two parts. First, for a small number of popular open source projects, we manually examined the artifacts suggested by our system to determine if they were appropriate. Second, we applied the algorithm to the 13,241 projects in the Sourcerer managed repository to evaluate the rate of resolution success. The results demonstrate the feasibility of this approach, as the algorithm located all of the required artifacts needed by 3,904 additional projects, increasing the percentage of declaratively complete projects in Sourcerer from 39% to 69%. Joel Ossher, Sushil Krishna Bajracharya, Cristina V. Lopes |
MSR | 1 |
| 2010 | Leveraging usage similarity for effective retrieval of examples in code repositoriesabstractDevelopers often learn to use APIs (Application Programming Interfaces) by looking at existing examples of API usage. Code repositories contain many instances of such usage of APIs. However, conventional information retrieval techniques fail to perform well in retrieving API usage examples from code repositories. This paper presents Structural Semantic Indexing (SSI), a technique to associate words to source code entities based on similarities of API usage. The heuristic behind this technique is that entities (classes, methods, etc.) that show similar uses of APIs are semantically related because they do similar things. We evaluate the effectiveness of SSI in code retrieval by comparing three SSI based retrieval schemes with two conventional baseline schemes. We evaluate the performance of the retrieval schemes by running a set of 20 candidate queries against a repository containing 222,397 source code entities from 346 jars belonging to the Eclipse framework. The results of the evaluation show that SSI is effective in improving the retrieval of examples in code repositories. Sushil Krishna Bajracharya, Joel Ossher, Cristina V. Lopes |
SIGSOFT FSE | 2 |
| 2009 | SourcererDB: An aggregated repository of statically analyzed and cross-linked open source Java projectsabstractThe open source movement has made vast quantities of source code available online for free, providing an extremely large dataset for empirical study and potential resuse. A major difficulty in exploiting this potential fully is that the data are currently scattered between competing source code repositories, none of which are structured for empirical analysis and cross-project comparison. As a result, software researchers and developers are left to compile their own datasets, resulting in duplicated effort and limited results. To address this challenge, we built SourcererDB, an aggregated repository of statically analyzed and cross-linked open source Java projects. SourcererDB contains local snapshots of 2,852 Java projects taken from Sourceforge, Apache and Java.net. These projects are statically analyzed to extract rich structural information, which is then stored in a relational database. References to entities in the 16,058 external jars are resolved and grouped, allowing for cross-project usage information to be accessed easily. This paper describes: (a) the mechanism for resolving and grouping these cross-project references, (b) the structure of and the metamodel for the SourcererDB repository, and (d) end-user dataset access mechanisms. Our goal in building SourcererDB is to provide a rich dataset of source code to facilitate the sharing of extracted data and to encourage reuse and repeatability of experiments. Joel Ossher, Sushil Krishna Bajracharya, Erik Linstead, Pierre Baldi, Cristina V. Lopes |
MSR | 1 |
| 2007 | CodeGenie: using test-cases to search and reuse source codeabstractWe present CodeGenie, a tool that implements a test-driven approachto search and reuse of code available on large-scale coderepositories. While using CodeGenie developers design test cases fora desired feature first, similar to Test-driven Development (TDD).However, instead of implementing the feature as in TDD, CodeGenieautomatically searches for it based on information available in thetests. To check the suitability of the candidate results in thelocal context, each result is automatically woven into thedeveloper's project and tested using the original tests. Thedeveloper can then reuse the most suitable result. Later, reusedcode can also be unwoven from the project as wished. For the codesearching and wrapping facilities, CodeGenie relies on Sourcerer, anInternet-scale source code infrastructure that we have developed Otávio Augusto Lazzarini Lemos, Sushil Krishna Bajracharya, Joel Ossher, Ricardo Morla, Paulo César Masiero, Pierre Baldi, Cristina V. Lopes |
ASE | 3 |
| 2007 | Cayuga: a high-performance event processing engineabstractWe propose a demonstration of Cayuga, a complex event monitoring system for high speed data streams. Our demonstration will show Cayuga applied to monitoring Web feeds; the demo will illustrate the expressiveness of the Cayuga query language, the scalability of its query processing engine to high stream rates, and a visualization of the internals of the query processing engine. Lars Brenna, Alan J. Demers, Johannes Gehrke, Mingsheng Hong, Joel Ossher, Biswanath Panda, Mirek Riedewald, Mohit Thatte, Walker M. White |
SIGMOD Conference | 5 |