Demo Data from EDBT 2026 / reviewers in the wild / expert
David S. Moffat
dblp:34/7020
· DBLP profile ↗
4ranked-venue papers
2as first author
0since 2021 · last 1988
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Software engineering, systems software and programming languages · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
database access optimization |
0.0 | 1 | 1983 | Manipulating Descriptions of Programs for Database Access · IJCAI 1983 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1988 | A Prolog Interface to a Functional Data Model Database
Peter M. D. Gray, David S. Moffat, Norman W. Paton |
EDBT | 2 |
| 1988 | Perlog: A Prolog With Persistence and ModulesabstractThe Perlog system is a Prolog system whose clauses and terms can persist on secondary storege as objects in a database. The unit of commitment is the module, and all atoms indirectly reference their module name, unless they are declared to be global. The module acts as a source of protection and reference to all its clauses, and also provides checks on import/export and on privacy, especially in the case of Abstract Data Types. This paper describes the structure of the module name space and the reasons for the decisions, particularly the use of metacalls to access procedures in other modules, and procedures with multiple definitions in different modules. A method for resolving global name clashes between previously committed modules is described. A model of the interpreter is presented in order to define the semantics of procedure call and assert and consult in a fully modular system. An example is given of a version of assert using B-tree routines in the database for clause storage. The system has been implemented in C and Prolog and PS-Algol under UNIX† on a VAX.‡ David S. Moffat, Peter M. D. Gray |
Comput. J. | 1 |
| 1986 | Interfacing Prolog to a Persistent Data Store
David S. Moffat, Peter M. D. Gray |
ICLP | 1 |
| 1983 | Manipulating Descriptions of Programs for Database Access
Peter M. D. Gray, David S. Moffat |
IJCAI | 2 |