EDBT 2026 Demo / reviewers in the wild / expert
Noah Mendelsohn
dblp:72/549
· DBLP profile ↗
4ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2Applied, interdisciplinary, general and emerging computing · 2Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers |
Compilers and program optimization · 55% Runtime systems and virtual machines · 30% Program analysis · 15% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Runtime systems and virtual machines › interpreter
bytecode interpretation |
0.1 | 1 | 2007 | A high-performance interpretive approach to schema-directed parsing · WWW 2007 |
Compilers and program optimization
parsing |
0.1 | 1 | 2007 | A high-performance interpretive approach to schema-directed parsing · WWW 2007 |
Compilers and program optimization › parsing
parser generation |
0.1 | 1 | 2006 | XML screamer: an integrated approach to high performance XML parsing, validation and deserialization · WWW 2006 |
Program analysis
schema validation |
0.0 | 1 | 2006 | XML screamer: an integrated approach to high performance XML parsing, validation and deserialization · WWW 2006 |
Program analysis
static analysis |
0.0 | 1 | 2006 | XML screamer: an integrated approach to high performance XML parsing, validation and deserialization · WWW 2006 |
Methods — techniques the papers use, named apart from their topics
schema compiler · 0.1bytecode design · 0.1parser generation · 0.1compilation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | A high-performance interpretive approach to schema-directed parsingabstractXML delivers key advantages in interoperability due to its flexibility, expressiveness, and platform-neutrality. As XML has become a performance-critical aspect of the next generation of business computing infrastructure, however, it has become increasingly clear that XML parsing often carries a heavy performance penalty, and that current, widely-used parsing technologies are unable to meet the performance demands of an XML-based computing infrastructure. Several efforts have been made to address this performance gap through the use of grammar-based parser generation. While the performance of generated parsers has been significantly improved, adoption of the technology has been hindered by the complexity of compiling and deploying the generated parsers. Through careful analysis of the operations required for parsing and validation, we have devised a set of specialized byte codes, designed for the task of XML parsing and validation. These byte codes are designed to engender the benefits of fine-grained composition of parsing and validation that make existing compiled parsers fast, while being coarse-grained enough to minimize interpreter overhead. This technique of using an interpretive,validating parser balances the need for performance against the requirements of simple tooling and robust scalable infrastructure. Our approach is demonstrated with a specialized schema compiler, used to generate byte codes which in turn drive an interpretive parser. With almost as little tooling and deployment complexity as a traditional interpretive parser, the byte code-driven parser usually demonstrates performance within 20% of the fastest fully compiled solutions. Morris Matsa, Eric Perkins, Abraham Heifets, Margaret Gaitatzes Kostoulas, Daniel Silva 0001, Noah Mendelsohn, Michelle Leger |
WWW | 6 |
| 2006 | XML screamer: an integrated approach to high performance XML parsing, validation and deserializationabstractThis paper describes an experimental system in which customized high performance XML parsers are prepared using parser generation and compilation techniques. Parsing is integrated with Schema-based validation and deserialization, and the resulting validating processors are shown to be as fast as or in many cases significantly faster than traditional nonvalidating parsers. High performance is achieved by integration across layers of software that are traditionally separate, by avoiding unnecessary data copying and transformation, and by careful attention to detail in the generated code. The effect of API design on XML performance is also briefly discussed.. Margaret Gaitatzes Kostoulas, Morris Matsa, Noah Mendelsohn, Eric Perkins, Abraham Heifets, Martha Mercaldi Kim |
WWW | 3 |
| 1982 | Digital audio mixer: A VLSI approachabstractAudio mixing panels have traditionally been implemented using analog circuits. The limitations of analog circuits, noise and flexibility, have been outweighed by the the power requirements and complexity of digital alternatives. The power consumption of digital processing circuits can be reduced by the use of VLSI circuits. The primary remaining limitation, circuit complexity, is minimized by using a simple self-framing serial data format for transmission of signals. Control circuitry is minimized by using the same serial data format for transmission of packetized control data. An attractive digital VLSI architecture for an audio mixing panel is proposed. The proposed digital interface standard is not limited to audio mixers; use of this interface standard will allow other speech or audio signal processing chips to be easily integrated into a system. A VLSI chip was built to prove the viability of the digital audio system concept. The chip accepts two streams of digitized audio samples, and selectively delays one stream to provide word synchronization with the other. The chip may be used in audio mixers and signal processors, or may be adapted as a subcomponent of larger chips. David V. James, Noah Mendelsohn, David R. Fuchs |
ICASSP | 2 |
| 1982 | Compilation of the Pascal Case StatementabstractAbstract Pascal case statements can be compiled using a variety of methods, including comparison trees and branch tables. The scheme discussed here combines the two techniques to allow comparison trees with entries that are branch tables. The use of a combination of the two techniques is shown to adapt well to certain instances of case statements. Extensions to the standard case statement also require such a scheme to obtain an efficient implementation. John L. Hennessy, Noah Mendelsohn |
Softw. Pract. Exp. | 2 |