Demo Data from VLDB 2026 / reviewers in the wild / expert
Patricia G. Selinger
dblp:48/1954 · also Pat Selinger
· DBLP profile ↗
13ranked-venue papers
8as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 12 · 7 first-authorSoftware engineering, systems software and programming languages · 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
11 papers |
Database system architecture and tuning · 70% Data mining · 13% Data stream processing · 6% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 9 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Database system architecture and tuning
what-if analysis |
0.1 | 1 | 2011 | Data is Dead... Without What-If Models · Proc. VLDB Endow. 2011 |
Data models and query languages
XML |
0.0 | 1 | 2002 | Information Integration and XML in IBM's DB2 · VLDB 2002 |
Query processing and optimization › query planning
access path selection |
0.0 | 2 | 1981 | Support for Repetitive Transactions and Ad Hoc Queries in System R · ACM Trans. Database Syst. 1981 Access Path Selection in a Relational Database Management System · SIGMOD Conference 1979 |
Distributed and cloud data management › distributed database architecture
distributed relational database |
0.0 | 1 | 1984 | Optimization of Nested Queries in a Distributed Relational Database · VLDB 1984 |
Query processing and optimization › query optimization
nested query optimization |
0.0 | 1 | 1984 | Optimization of Nested Queries in a Distributed Relational Database · VLDB 1984 |
Query processing and optimization
query compilation |
0.0 | 1 | 1981 | Support for Repetitive Transactions and Ad Hoc Queries in System R · ACM Trans. Database Syst. 1981 |
Database system architecture and tuning
relational database system |
0.0 | 1 | 1981 | Support for Repetitive Transactions and Ad Hoc Queries in System R · ACM Trans. Database Syst. 1981 |
Query processing and optimization › query optimization
join ordering |
0.0 | 1 | 1979 | Access Path Selection in a Relational Database Management System · SIGMOD Conference 1979 |
Query processing and optimization
query optimization |
0.0 | 1 | 1979 | Access Path Selection in a Relational Database Management System · SIGMOD Conference 1979 |
Methods — techniques the papers use, named apart from their topics
what-if models · 0.1r* prototype · 0.0distributed execution facilities · 0.0survey · 0.0name binding · 0.0access path selection · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Data is Dead... Without What-If Models
Peter J. Haas, Paul P. Maglio, Patricia G. Selinger, Wang Chiew Tan |
Proc. VLDB Endow. | 3 |
| 2005 | Top Five Data Challenges for the Next DecadeabstractSummary form only given. For the past three decades, those of us in the database field have principally focused attention and significant effort on technology for storing, querying, accessing, and securing data with well-known structure in high-performance data management systems. Our focus has been riveted on performance, performance, and performance. The world has changed dramatically since the early days of database management systems, however. The dynamics of DBMS have changed, moving from supporting back office systems, to front offices, to Web-based systems. Computer architecture has changed, as we have moved from systems where 256 K was a large size memory, disk drives were very expensive, most processors were water-cooled, and screens glowed with green characters. Not only has more data been produced in the last several years than in all previous history, but also more and more of it is in digital form. Accelerated pace and higher expectations driven by competitive necessity have changed the nature of database solutions from well-understood batch-oriented processing to real-time, ad hoc query on continuously streaming data. All these changes are coming together to create a new set of challenges for the decade ahead. The author discusses the top five of these challenges in the database area. Patricia G. Selinger |
ICDE | 1 |
| 2002 | Information Integration and XML in IBM's DB2
Patricia G. Selinger |
VLDB | 1 |
| 1993 | Predictions and Challenges for Database Systems in the Year 2000
Patricia G. Selinger |
VLDB | 1 |
| 1992 | Database Management in the Year 2000: Projections and Star Gazing (Panel)
Paul G. Sorenson, Felipe Cariño, Jnan R. Dash, Patricia G. Selinger |
VLDB | 4 |
| 1988 | Issues in Building Large Database Systems
Patricia G. Selinger |
SIGMOD Conference | 1 |
| 1987 | Chickens and Eggs: The Interrelationship of Systems and TheoryabstractThis paper describes a personal perspective of the kinds of contributions that systems research and theoretical research make to one another particularly in the database area. Examples of each kind of contribution are given, and then several case studies from the author a personal experience are presented. The case studies illustrate database systems research where theoretical work contributed to systems results and vice versa. Areas of database systems which need more contributions from the theoretical community will also be presented. Patricia G. Selinger |
PODS | 1 |
| 1984 | Optimization of Nested Queries in a Distributed Relational Database
Guy M. Lohman, Dean Daniels, Laura M. Haas, Ruth Kistler, Patricia G. Selinger |
VLDB | 5 |
| 1983 | "I wish I were over there": Distributed Execution Protocols for Data Definition in R*abstractThe design and implementation of R*, an experimental prototype of a distributed system for the management of interrelated, voluntarily cooperating, but also autonomous databases is based on several major objectives: site autonomy, transparency, ease of use and performance. This paper discusses the way data definition and control statements are executed in a distributed environment and shows how the general objectives are fulfilled. Specialized distributed execution facilities have been developed to facilitate the implementation of complex multi-site functions. This paper describes the facilities and methodology used to implement the distributed processing needed to perform multi-site data definition operations in R*. Paul F. Wilms, Bruce G. Lindsay 0001, Patricia G. Selinger |
SIGMOD Conference | 3 |
| 1983 | Site autonomy issues in R*: A distributed database management system
Patricia G. Selinger, Dean Daniels, Laura M. Haas, Bruce G. Lindsay 0001, Pui Ng, Paul F. Wilms, Robert A. Yost |
Inf. Sci. | 1 |
| 1983 | State-of-the-Art Issues in Distributed Databases
Patricia G. Selinger |
IEEE Trans. Software Eng. | 1 |
| 1981 | Support for Repetitive Transactions and Ad Hoc Queries in System RabstractSystem R supports a high-level relational user language called SQL which may be used by ad hoc users at terminals or as an embedded data sublanguage in PL/I or COBOL. Host-language programs with embedded SQL statements are processed by the System R precompiler which replaces the SQL statements by calls to a machine-language access module. The precompilation approach removes much of the work of parsing, name binding, and access path selection from the path of a running program, enabling highly efficient support for repetitive transactions. Ad hoc queries are processed by a similar approach of name binding and access path selection which takes place on-line when the query is specified. By providing a flexible spectrum of binding times, System R permits transaction-oriented programs and ad hoc query users to share a database without loss of efficiency. System R is an experimental database management system designed and built by members of the IBM San Jose Research Laboratory as part of a research program on the relational model of data. This paper describes the architecture of System R, and gives some preliminary measurements of system performance in both the ad hoc query and the “canned program” environments. Donald D. Chamberlin, Morton M. Astrahan, W. Frank King III, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, Bradford W. Wade, Robert A. Yost |
ACM Trans. Database Syst. | 8 |
| 1979 | Access Path Selection in a Relational Database Management SystemabstractIn a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specification of desired data as a boolean expression of predicates. System R is an experimental database management system developed to carry out research on the relational model of data. System R was designed and built by members of the IBM San Jose Research Laboratory. Patricia G. Selinger, Morton M. Astrahan, Donald D. Chamberlin, Raymond A. Lorie, Thomas G. Price |
SIGMOD Conference | 1 |