Charles Barton

dblp:31/2491 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1 · 1 first-author

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.

Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 67% Data stream processing · 33%
Software engineering, system software, and programming languages
1 paper
Requirements engineering and software design · 61% Compilers and program optimization · 30% Programming languages and type systems · 9%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data stream processing
continuous query processing
0.012003
Streaming XPath Processing with Forward and Backward Axes · ICDE 2003
Query processing and optimization › XML query processing
streaming XPath evaluation
0.012003
Streaming XPath Processing with Forward and Backward Axes · ICDE 2003
Query processing and optimization
XML query processing
0.012003
Streaming XPath Processing with Forward and Backward Axes · ICDE 2003
Compilers and program optimization
code generation
0.012000
Mapping UML designs to Java · OOPSLA 2000
Requirements engineering and software design
model-driven engineering
0.012000
Mapping UML designs to Java · OOPSLA 2000
Requirements engineering and software design › model-driven engineering
UML-based code generation
0.012000
Mapping UML designs to Java · OOPSLA 2000

Methods — techniques the papers use, named apart from their topics

streaming algorithms · 0.0document-order traversal · 0.0
YearPublicationVenuePosition
2003 Streaming XPath Processing with Forward and Backward Axes
abstract
We present a streaming algorithm for evaluating XPath expressions that use backward axes (parent and ancestor) and forward axes in a single document-order traversal of an XML document. Other streaming XPath processors handle only forward axes. We show through experiments that our algorithm significantly outperforms (by more than a factor of two) a traditional nonstreaming XPath engine. Furthermore, our algorithm scales better because it retains only the relevant portions of the input document in memory. Our engine successfully processes documents over 1GB in size, whereas the traditional XPath engine degrades considerably in performance for documents over 100 MB in size and fails to complete for documents of size over 200 MB.
Charles Barton, Philippe Charles, Deepak Goyal, Mukund Raghavachari, Marcus Fontoura, Vanja Josifovski
ICDE1
2000 Mapping UML designs to Java
abstract
Tools for the generation of code from model descriptions are valuable in helping developers maintain consistency between a model and its implementation. In this paper, we describe a new method for generating Java implementation code from UML diagrams. Our method accepts UML diagrams specified at a higher-level than current tools, and places fewer constraints on the supported UML constructs, like multiple generalizations and association classes. Unlike current tools, it generates implementation code that shields system implementers from the low-level details of how associations and other UML constructs are mapped to Java. Furthermore, it supports the modular design of systems according to concerns[2, 10] by being able to generate code from a set of related UML diagrams. While our discussion is focused on the special problem of generating Java implementation code, the issues discussed in this paper are applicable more generally to object-oriented implementation languages.
William Harrison, Charles Barton, Mukund Raghavachari
OOPSLA2
1999 Mockingbird: Flexible Stub Compilation from Pairs of Declarations
abstract
Mockingbird is a prototype tool for developing interlanguage and distributed applications. It compiles stubs from pairs of interface declarations, allowing existing data types to be reused on both sides of every interface. Other multilanguage stub compilers impose data types on the application, complicating development. Mockingbird supports C/C++, Java, and CORBA IDL, and can be extended to other languages. Mockingbird can generate stubs that convert between types whose structural equivalence would be missed by other tools. We show that this kind of tool improves programming productivity, and describe, in detail, Mockingbird's design and implementation.
Joshua S. Auerbach, Charles Barton, Mark Chu-Carroll, Mukund Raghavachari
ICDCS2
1995 Single-program speculative multithreading (SPSM) architecture: compiler-assisted fine-grained multithreading
Pradeep K. Dubey, Kevin O'Brien, Kathryn M. O'Brien, Charles Barton
PACT4